On the complexity of quadratic programming with two quadratic constraints

DOI10.1007/S10107-016-1073-8zbMath1396.90055OpenAlexW2525586417MaRDI QIDQ2364486

Luca Consolini, Marco Locatelli

Publication date: 21 July 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-1073-8

zbMATH Keywords

complexityquadratic problemsbivariate polynomial systems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (9)

On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ Comment on: ``Approximation algorithms for quadratic programming ⋮ A survey of hidden convex optimization ⋮ KKT-based primal-dual exactness conditions for the Shor relaxation ⋮ (Global) optimization: historical notes and recent developments ⋮ Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating global quadratic optimization with convex quadratic constraints
• Approximating quadratic programming with bound and quadratic constraints
• Some results for quadratic problems with one or two quadratic constraints
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• On the complexity of computing with planar algebraic curves
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• The DMM bound
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• New Results on Quadratic Minimization
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• On the complexity of solving a bivariate polynomial system
• Ideals, Varieties, and Algorithms
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems

This page was built for publication: On the complexity of quadratic programming with two quadratic constraints