Removing redundant quadratic constraints

DOI10.1007/978-3-642-15582-6_46MaRDI QIDQ5747893zbMATH OpenOpenAlexFDO

Authors David Adjiashvili, Michel Baes, Philipp Rostalski

Publication date 14 September 2010

Published in Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15582-6_46

zbMATH Keywords

aircraft wing designsemidefinite optimizationsemidefinite relaxation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Semidefinite programming (90C22)

Recommendations

• Quadratic programs with hollows
• Detecting redundancy in optimization problems over intersection of ellipsoids
• Best ellipsoidal relaxation to solve a nonconvex problem.
• LMI approximations for the radius of the intersection of ellipsoids: Survey.
• Convex hull of two quadratic constraints is an LMI set

Cited in

(1)

• Detecting redundancy in optimization problems over intersection of ellipsoids

This page was built for publication: Removing redundant quadratic constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747893)