Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
From MaRDI portal
Recommendations
- Semidefinite relaxation and nonconvex quadratic optimization
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Semidefinite programming relaxation for nonconvex quadratic programs
Cited in
(31)- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- A semidefinite programming method for integer convex quadratic minimization
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Chebyshev center of the intersection of balls: complexity, relaxation and approximation
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Comment on: ``Approximation algorithms for quadratic programming
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Conic relaxation approaches for equal deployment problems
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- Semidefinite relaxation and nonconvex quadratic optimization
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- New results on semidefinite bounds forℓ1-constrained nonconvex quadratic optimization
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- Lower-order penalization approach to nonlinear semidefinite programming
This page was built for publication: Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441957)
