Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Copositive optimization -- recent developments and applications
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
Branch-and-bound approaches to standard quadratic optimization problems
A branch-and-cut algorithm for a class of sum-of-ratios problems
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
A convex analysis approach for convex multiplicative programming
Applications of second-order cone programming
Quadratic programming with one negative eigenvalue is NP-hard
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Quadratic maximization and semidefinite relaxation
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
A polyhedral study of nonconvex quadratic programs with box constraints
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Finding all solutions of nonlinearly constrained systems of equations
DC programming: overview.
Outer space branch and bound algorithm for solving linear multiplicative programming problems
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Global algorithm for solving linear multiplicative programming problems
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
\(NP\)-hardness of linear multiplicative programming and related problems
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
Class of global minimum bounds of polynomial functions
The bilinear programming problem
The trust region subproblem and semidefinite programming*
A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
On Cones of Nonnegative Quadratic Functions
Introduction to global optimization.
On copositive programming and standard quadratic optimization problems
A new algorithm for the general quadratic programming problems with box constraints

This page was built for publication: Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems