The Indefinite Quadratic Programming Problem

DOI10.1287/OPRE.27.3.516MaRDI QIDQ4197634zbMATH OpenOpenAlexFDO

Authors Paul F. Kough

Publication date 1979

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.27.3.516

zbMATH Keywords

Bender's Decomposition PrincipleCutsE- Convergent MethodsIndefinite Quadratic ProgrammingNumerical Examples

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cited in

(13)

• Global minimization of indefinite quadratic problems
• Reduction of indefinite quadratic programs to bilinear programs
• A branch bound method for subset sum problem
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• A decomposition approach for global optimum search in QP, NLP and MINLP problems
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
• A finite cutting plane method for facial disjunctive programs
• An algorithm for piece-wise indefinite quadratic programming problem
• On the global minimization of concave functions
• Global optimization algorithms for linearly constrained indefinite quadratic problems
• Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: The Indefinite Quadratic Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197634)