Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization

DOI10.1007/s11590-013-0670-1zbMath1321.90095OpenAlexW2024017812MaRDI QIDQ2448210

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

complexitysemidefinite programmingquadratic optimization\(\ell_1\) unit ballstandard quadratic program

Mathematics Subject Classification ID

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

Related Items (1)

A new semidefinite relaxation for \(L_{1}\)-constrained quadratic

Cites Work

• Unnamed Item
• Convex approximations to sparse PCA via Lagrangian duality
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• Quadratic maximization and semidefinite relaxation
• Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
• Grothendieck-Type Inequalities in Combinatorial Optimization
• The UGC Hardness Threshold of the L_p Grothendieck Problem
• On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On Cones of Nonnegative Quadratic Functions

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