Global minimization of indefinite quadratic problems

Review text

A branch and bound algorithm is proposed for finding the global optimum of large-scale indefinite quadratic problems over a polytope. The algorithm uses separable programming and techniques from concave optimization to obtain approximate solutions. Results on error bounding are given and preliminary computational results using the Cray 1 S supercomputer are reported.

Recommendations

Cites work

Cited in

(38)

Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
On solving a d.c. programming problem by a sequence of linear programs
Local minima for indefinite quadratic knapsack problems
Reduction of indefinite quadratic programs to bilinear programs
An application of Lipschitzian global optimization to product design
New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
A finite algorithm for solving general quadratic problems
Primal-relaxed dual global optimization approach
On global optimization with indefinite quadratics
Test problem construction for linear bilevel programming problems
A reformulation-convexification approach for solving nonconvex quadratic programming problems
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
On solving general reverse convex programming problems by a sequence of linear programs and line searches
An algorithm for indefinite integer quadratic programming
Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
scientific article; zbMATH DE number 4133837 (Why is no real title available?)
An efficient global algorithm for a class of indefinite separable quadratic programs
A method of global optimization for indefinite quadratic programming problems
Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
scientific article; zbMATH DE number 4164557 (Why is no real title available?)
Global optimization: A quadratic programming perspective
A new branch-and-bound algorithm for indefinite quadratic programming problems
scientific article; zbMATH DE number 1203224 (Why is no real title available?)
On zero duality gap in nonconvex quadratic programming problems
scientific article; zbMATH DE number 221928 (Why is no real title available?)
An algorithm for piece-wise indefinite quadratic programming problem
Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
A new algorithm for finding global solution of indefinite quadratic programming problems
Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
Global optimization algorithms for linearly constrained indefinite quadratic problems
Decomposition methods for solving nonconvex quadratic programs via branch and bound
Jointly constrained bilinear programs and related problems: An overview
A computational comparison of some branch and bound methods for indefinite quadratic programs

Describes a project that uses

Uses Software

MINOS