The Indefinite Quadratic Programming Problem
From MaRDI portal
Publication:4197634
DOI10.1287/opre.27.3.516zbMath0409.90070OpenAlexW2001223909MaRDI QIDQ4197634
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
CutsNumerical ExamplesBender's Decomposition PrincipleE- Convergent MethodsIndefinite Quadratic Programming
Related Items
A finite cutting plane method for facial disjunctive programs, A branch bound method for subset sum problem, Global minimization of indefinite quadratic 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, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Jointly constrained bilinear programs and related problems: An overview, An algorithm for piece-wise indefinite quadratic programming problem, Reduction of indefinite quadratic programs to bilinear programs, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, On the global minimization of concave functions, Global optimization algorithms for linearly constrained indefinite quadratic problems
