Global minimization of indefinite quadratic problems
From MaRDI portal
Recommendations
- Publication:3491318
- scientific article; zbMATH DE number 221928
- A new branch-and-bound algorithm for indefinite quadratic programming problems
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- An algorithm for global minimization of linearly constrained quadratic functions
Cites work
- scientific article; zbMATH DE number 3892947 (Why is no real title available?)
- A Method for Solving the Indefinite Quadratic Programming Problem
- Computational aspects of two-segment separable programming
- Constrained global optimization: algorithms and applications
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- Generalized Benders decomposition
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving the linear complementarity problem through concave programming
- The Indefinite Quadratic Programming Problem
Cited in
(36)- A new algorithm for finding global solution of indefinite quadratic programming problems
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- On zero duality gap in nonconvex quadratic programming problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- An algorithm for indefinite integer quadratic programming
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Jointly constrained bilinear programs and related problems: An overview
- scientific article; zbMATH DE number 4164557 (Why is no real title available?)
- An efficient global algorithm for a class of indefinite separable quadratic programs
- A new branch-and-bound algorithm for indefinite quadratic programming problems
- On solving a d.c. programming problem by a sequence of linear programs
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- An algorithm for piece-wise indefinite quadratic programming problem
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- Reduction of indefinite quadratic programs to bilinear programs
- On global optimization with indefinite quadratics
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- Global optimization: A quadratic programming perspective
- Local minima for indefinite quadratic knapsack problems
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- A method of global optimization for indefinite quadratic programming problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- 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
- Primal-relaxed dual global optimization approach
- scientific article; zbMATH DE number 4133837 (Why is no real title available?)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
- An application of Lipschitzian global optimization to product design
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
This page was built for publication: Global minimization of indefinite quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092620)
