Approximating global quadratic optimization with convex quadratic constraints

DOI10.1023/A:1008370723217zbMath0953.90040OpenAlexW1899296442MaRDI QIDQ1304392

Yinyu Ye

Publication date: 30 January 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008370723217

zbMATH Keywords

quadratic programmingapproximation algorithmglobal optimizer

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

On the complexity of quadratic programming with two quadratic constraints ⋮ A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ A global optimization algorithm using parametric linearization relaxation ⋮ Approximation algorithms for homogeneous polynomial optimization 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 ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Moment inequalities for sums of random matrices and their applications in optimization ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation ⋮ A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach

This page was built for publication: Approximating global quadratic optimization with convex quadratic constraints