Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 14 (1) , 268-283
- https://doi.org/10.1137/s1052623401395899
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive ProgrammingJournal of Global Optimization, 2002
- On Lagrangian Relaxation of Quadratic Matrix ConstraintsSIAM Journal on Matrix Analysis and Applications, 2000
- Trust Region MethodsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2000
- On maximization of quadratic form over intersection of ellipsoids with common centerMathematical Programming, 1999
- Semidefinite relaxation and nonconvex quadratic optimizationOptimization Methods and Software, 1998
- Approximation Algorithms for Quadratic ProgrammingJournal of Combinatorial Optimization, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Feasibility testing for systems of real quadratic equationsDiscrete & Computational Geometry, 1993
- Cones of Matrices and Set-Functions and 0–1 OptimizationSIAM Journal on Optimization, 1991