A note on approximating quadratic programming with rank constraint

DOI10.1080/02331934.2010.523111zbMath1254.90146OpenAlexW1995594370MaRDI QIDQ2903138

Zheng-Hai Huang, Sheng-Long 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

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

Cites Work

• Positive definite functions on spheres
• On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite relaxation and nonconvex quadratic optimization

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