Adaptive computable approximation to cones of nonnegative quadratic functions
From MaRDI portal
Publication:5169468
DOI10.1080/02331934.2014.895899zbMath1291.49022OpenAlexW2031088654WikidataQ57442322 ScholiaQ57442322MaRDI QIDQ5169468
Cheng Lu, Qing-Wei Jin, Shu-Cherng Fang, Wen-Xun Xing, Zhen-bo Wang
Publication date: 10 July 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.895899
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)
Related Items (6)
On conic QPCCs, conic QCQPs and completely positive programs ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ Completely positive and copositive program modelling for quadratic optimization problems ⋮ An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints ⋮ Conic approximation to nonconvex quadratic programming with convex quadratic constraints ⋮ On solving quadratically constrained quadratic programming problem with one non-convex constraint
Cites Work
- Unnamed Item
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- On convex relaxations for quadratically constrained quadratic programming
- Separation and relaxation for cones of quadratic forms
- Computable representations for convex hulls of low-dimensional quadratic forms
- Global Optimization with Polynomials and the Problem of Moments
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
- Linear Matrix Inequalities in System and Control Theory
- New Results on Quadratic Minimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- LMI Approximations for Cones of Positive Semidefinite Forms
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Adaptive computable approximation to cones of nonnegative quadratic functions
