Conic approximation to nonconvex quadratic programming with convex quadratic constraints
From MaRDI portal
Publication:2018510
DOI10.1007/s10898-014-0195-xzbMath1339.90259OpenAlexW1976931616WikidataQ57438369 ScholiaQ57438369MaRDI QIDQ2018510
Cheng Lu, Shu-Cherng Fang, Qing-Wei Jin, Zhi-bin Deng
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0195-x
Related Items
A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints ⋮ On indefinite quadratic optimization over the intersection of balls and linear constraints ⋮ Globally solving extended trust region subproblems with two intersecting cuts ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs ⋮ An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints ⋮ On solving quadratically constrained quadratic programming problem with one non-convex constraint ⋮ On linear conic relaxation of discrete quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- BARON: A general purpose global optimization software package
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Lectures on Modern Convex Optimization
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
- Copositive realxation for genera quadratic programming
- New Results on Quadratic Minimization
- Trust Region Methods
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- State Constraints in Convex Control Problems of Bolza
- On Cones of Nonnegative Quadratic Functions
