On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
From MaRDI portal
Publication:3596347
DOI10.1007/11496915_10zbMATH Open1119.90032OpenAlexW1852767571MaRDI QIDQ3596347FDOQ3596347
Authors: Anthony Man-Cho So, Yinyu Ye, Jiawei Zhang 
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496915_10
Recommendations
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Complex Quadratic Optimization and Semidefinite Programming
- Quadratic maximization and semidefinite relaxation
- Semidefinite programming and combinatorial optimization
Cited In (10)
- On quadratic programming with a ratio objective
- Title not available (Why is that?)
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Quadratic maximization and semidefinite relaxation
- Complex Quadratic Optimization and Semidefinite Programming
- Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
This page was built for publication: On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596347)
