A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
From MaRDI portal
Publication:5084603
DOI10.1287/ijoc.2020.1017OpenAlexW3126550887MaRDI QIDQ5084603
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1017
Uses Software
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Approximation algorithms for indefinite quadratic programming
- A branch and reduce approach for solving a class of low rank d.c. programs
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Quadratic programming with one negative eigenvalue is NP-hard
- Approximating global quadratic optimization with convex quadratic constraints
- On the complexity of approximating a KKT point of quadratic programming
- Approximation algorithms for quadratic programming
- Approximating quadratic programming with bound and quadratic constraints
- A hybrid LP/NLP paradigm for global optimization relaxations
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A finite algorithm for a particular D.C. quadratic programming problem
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Introduction to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- On maximization of quadratic form over intersection of ellipsoids with common center
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On solving nonconvex optimization problems by reducing the duality gap
- \(NP\)-hardness of linear multiplicative programming and related problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Global solution of non-convex quadratically constrained quadratic programs
- Fixing Variables in Semidefinite Relaxations
- Reducibility among Combinatorial Problems
- Dual bounds and optimality cuts for all-quadratic programs with convex constraints
This page was built for publication: A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
