Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
From MaRDI portal
Publication:4441957
DOI10.1137/S1052623401395899zbMath1075.90061MaRDI 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 algorithm; semidefinite programming relaxation; quadratically constrained quadratic optimization
Related Items
Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, 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, Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, 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, Conic relaxation approaches for equal deployment problems, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
