Complexity and nonlinear semidefinite programming reformulation of _1-constrained nonconvex quadratic optimization

DOI10.1007/S11590-013-0670-1MaRDI QIDQ2448210zbMATH OpenOpenAlexFDO

Authors Yong Hsia

Publication date 30 April 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-013-0670-1

zbMATH Keywords

\(\ell_1\) unit ballcomplexityquadratic optimizationsemidefinite programmingstandard quadratic program

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

Recommendations

• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
• scientific article; zbMATH DE number 1380758
• Semidefinite programming relaxation for nonconvex quadratic programs
• New results on semidefinite bounds forℓ₁-constrained nonconvex quadratic optimization
• Semidefinite relaxation and nonconvex quadratic optimization
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• Approximating non-convex quadratic programs by semidefinite and copositive programming
• On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Cites work

• Cones of Matrices and Set-Functions and 0–1 Optimization
• Convex approximations to sparse PCA via Lagrangian duality
• Grothendieck-type inequalities in combinatorial optimization
• scientific article; zbMATH DE number 6783411 (Why is no real title available?)
• Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• On Cones of Nonnegative Quadratic Functions
• On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball
• Quadratic maximization and semidefinite relaxation
• The UGC hardness threshold of the \(L_{p}\) Grothendieck problem

Cited in

(9)

• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• On the complexity of finding stationary points of nonconvex quadratic programs
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
• SDP reformulation for robust optimization problems based on nonconvex QP duality
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
• New results on semidefinite bounds forℓ₁-constrained nonconvex quadratic optimization
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations

This page was built for publication: Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization

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