Removing redundant quadratic constraints

Authors:
David Adjiashvili;Michel Baes;Philipp Rostalski
Affiliations:
ETH Zürich, Zurich, Switzerland;ETH Zürich, Zurich, Switzerland;ETH Zürich, Zurich, Switzerland
Venue:
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Year:
2010

Citing 8
Cited 0

Robust Convex Optimization

Mathematics of Operations Research
Lectures on modern convex optimization: analysis, algorithms, and engineering applications

Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
Robust Truss Topology Design via Semidefinite Programming

SIAM Journal on Optimization
Convex Optimization

Convex Optimization
More output-sensitive geometric algorithms

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Dualize it: software for automatic primal and dual conversions of conic programs

Optimization Methods & Software
A Survey of the S-Lemma

SIAM Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determining whether an ellipsoid contains the intersection of many concentric ellipsoids is an NP-hard problem. In this paper, we study various convex relaxations of this problem, namely two semidefinite relaxations and a second-order cone relaxation. We establish some links between these relaxations and perform extensive numerical testings to verify their exactness, their computational load and their stability. As an application of this problem, we study an issue emerging from an aircraft wing design problem: how can we simplify the description of a feasible loads region?