A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
From MaRDI portal
Recommendations
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A global optimization algorithm for generalized quadratic programming
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A branch and reduce approach for solving a class of low rank d.c. programs
- A finite algorithm for a particular D.C. quadratic programming problem
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A hybrid LP/NLP paradigm for global optimization relaxations
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A relaxation method for nonconvex quadratically constrained quadratic programs
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Approximating global quadratic optimization with convex quadratic constraints
- Approximating quadratic programming with bound and quadratic constraints
- Approximation algorithms for indefinite quadratic programming
- Approximation algorithms for quadratic programming
- Dual bounds and optimality cuts for all-quadratic programs with convex constraints
- Fixing Variables in Semidefinite Relaxations
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Global solution of non-convex quadratically constrained quadratic programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- Introduction to global optimization
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- On maximization of quadratic form over intersection of ellipsoids with common center
- On solving nonconvex optimization problems by reducing the duality gap
- On the complexity of approximating a KKT point of quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Reducibility among combinatorial problems
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Solving semidefinite-quadratic-linear programs using SDPT3
Cited in
(4)
This page was built for publication: A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084603)
