A note on approximating quadratic programming with rank constraint

DOI10.1080/02331934.2010.523111MaRDI QIDQ2903138zbMATH OpenOpenAlexFDO

Authors Zhenghai Huang, Shenglong Hu

Publication date 23 August 2012

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2010.523111

zbMATH Keywords

feasible solutionrelative approximation ratio

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• Approximating global quadratic optimization with convex quadratic constraints
• Approximation algorithms for quadratic programming
• Approximating quadratic programming with bound and quadratic constraints
• The positive semidefinite Grothendieck problem with rank constraint
• New bounds on the unconstrained quadratic integer programming problem

Cites work

• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
• Positive definite functions on spheres
• Semidefinite relaxation and nonconvex quadratic optimization

Cited in

(5)

• Ranking in quadratic integer programming problems
• Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
• An approximation theory of matrix rank minimization and its application to quadratic equations
• An efficient solution method for rank two quasiconcave minimization problems
• Improved approximation bound for quadratic optimization problems with orthogonality constraints

This page was built for publication: A note on approximating quadratic programming with rank constraint

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