A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
From MaRDI portal
Publication:2112679
DOI10.1016/j.cam.2022.114944zbMath1502.90117OpenAlexW4309182084MaRDI QIDQ2112679
Publication date: 11 January 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114944
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A branch and reduce approach for solving a class of low rank d.c. programs
- Quadratic programming with one negative eigenvalue is NP-hard
- A computational study of global optimization solvers on two trust region subproblems
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- A finite algorithm for a particular D.C. quadratic programming problem
- A new algorithm for concave quadratic programming
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- Conic approximation to quadratic optimization with linear complementarity constraints
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
This page was built for publication: A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
