Approximation algorithms for quadratic programming
From MaRDI portal
Publication:1386484
DOI10.1023/A:1009739827008zbMath0896.90154OpenAlexW1570765209MaRDI QIDQ1386484
Zhi-Quan Luo, Yinyu Ye, Fu, Minyue
Publication date: 24 May 1998
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009739827008
Related Items
A parametric linearizing approach for quadratically inequality constrained quadratic programs, An efficient algorithm for solving the generalized trust region subproblem, Comment on: ``Approximation algorithms for quadratic programming, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, On convergence of iterative methods for maximal correlation problems, Finding second-order stationary points in constrained minimization: a feasible direction approach, Convex hull results on quadratic programs with non-intersecting 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, An effective algorithm for globally solving quadratic programs using parametric linearization technique, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, LMI approximations for the radius of the intersection of ellipsoids: Survey., Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, Range assignment of base-stations maximizing coverage area without interference, A Two-Variable Approach to the Two-Trust-Region Subproblem, The trust region subproblem with non-intersecting linear constraints, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, Detecting redundancy in optimization problems over intersection of ellipsoids, An effective global optimization algorithm for quadratic programs with quadratic constraints
