Global minimization of indefinite quadratic problems
From MaRDI portal
Publication:1092620
DOI10.1007/BF02239972zbMath0627.65072OpenAlexW199950694MaRDI QIDQ1092620
Panos M. Pardalos, J. H. Glick, J. Ben Rosen
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02239972
branch and bound algorithmglobal optimumconstrained global optimizationconcave optimizationindefinite quadratic programmingerror boundinglarge-scale indefinite quadratic problems
Related Items
An efficient global algorithm for a class of indefinite separable quadratic programs, On solving general reverse convex programming problems by a sequence of linear programs and line searches, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Polynomial time algorithms for some classes of constrained nonconvex quadratic problems, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, On zero duality gap in nonconvex quadratic programming problems, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Jointly constrained bilinear programs and related problems: An overview, An algorithm for piece-wise indefinite quadratic programming problem, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, A computational comparison of some branch and bound methods for indefinite quadratic programs, On solving a d.c. programming problem by a sequence of linear programs, Reduction of indefinite quadratic programs to bilinear programs, An application of Lipschitzian global optimization to product design, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Test problem construction for linear bilevel programming problems, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Global optimization algorithms for linearly constrained indefinite quadratic problems, Decomposition methods for solving nonconvex quadratic programs via branch and bound, Primal-relaxed dual global optimization approach
Uses Software
Cites Work
- Unnamed Item
- Constrained global optimization: algorithms and applications
- Generalized Benders decomposition
- Solving the linear complementarity problem through concave programming
- Computational aspects of two-segment separable programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- The Indefinite Quadratic Programming Problem
- A Method for Solving the Indefinite Quadratic Programming Problem
