Relaxations of quadratic programs in operator theory and system analysis

MaRDI QIDQ4534559zbMATH OpenFDO

Authors A. Megretski

Publication date 18 November 2002

zbMATH Keywords

duality gap boundserror boundsquadratic programmingrelaxation

Mathematics Subject Classification ID

Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Quadratic programming (90C20) General systems (93A10)

Recommendations

• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
• Exactness criteria for SDP-relaxations of quadratic extremum problems
• Semidefinite and Lagrangian relaxations for hard combinatorial problems
• On approximating complex quadratic optimization problems via semidefinite programming relaxations

Cited in

(12)

• Relaxation of a quadratic functional defined by a nonnegative unbounded matrix
• The Knaster problem and the geometry of high-dimensional cubes
• On the tightness of SDP relaxations of QCQPs
• The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins
• On Convex Hulls of Epigraphs of QCQPs
• Fast heuristics and approximation algorithms
• Memory-efficient structured convex optimization via extreme point sampling
• Grothendieck’s Theorem, past and present
• scientific article; zbMATH DE number 7053310 (Why is no real title available?)
• Quadratic forms on graphs
• From worst case to the average: structural guarantees in k-CSP approximation via orthogonal arrays
• A CLuP algorithm to practically achieve 0.76 SK-model ground state free energy

This page was built for publication: Relaxations of quadratic programs in operator theory and system analysis

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