Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
From MaRDI portal
Publication:4441957
DOI10.1137/S1052623401395899zbMath1075.90061OpenAlexW2075781693MaRDI QIDQ4441957
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401395899
approximation algorithmsemidefinite programming relaxationquadratically constrained quadratic optimization
Related Items (13)
Comment on: ``Approximation algorithms for quadratic programming ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints ⋮ Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation ⋮ Chebyshev center of the intersection of balls: complexity, relaxation and approximation ⋮ Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints ⋮ Lower-order penalization approach to nonlinear semidefinite programming ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ Conic relaxation approaches for equal deployment problems ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
This page was built for publication: Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
