On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
From MaRDI portal
Publication:3596347
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
- scientific article; zbMATH DE number 1833395 (Why is no real title available?)
- 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)
