On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball

DOI10.1051/ro:2006023zbMath1180.90222OpenAlexW1982723745MaRDI QIDQ3635701

Marc Teboulle, Mustafa Çelebi Pinar

Publication date: 6 July 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105348

zbMATH Keywords

dualitynon-convex quadratic optimizationsemidefinite programming relaxation\(\ell_1\)-norm constraint

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, Convex approximations to sparse PCA via Lagrangian duality, Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization, Unified global optimality conditions for smooth minimization problems with mixed variables, A proximal bundle method for nonsmooth nonconvex functions with inexact information, A new semidefinite relaxation for \(L_{1}\)-constrained quadratic

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Conditions for global optimality. II
• Approximating quadratic programming with bound and quadratic constraints
• Quadratic maximization and semidefinite relaxation
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Global Optimization with Polynomials and the Problem of Moments
• Matrix Analysis
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• GloptiPoly
• Convex Analysis
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications