A finite algorithm for solving general quadratic problems

DOI10.1007/BF01096531zbMath0809.90107OpenAlexW2049569426MaRDI QIDQ1315437

Immanuel M. Bomze, Gabriele Danninger

Publication date: 28 March 1995

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096531

zbMATH Keywords

global optimizationpseudoconvexitysimplex algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Multi-standard quadratic optimization: Interior point methods and cone programming reformulation ⋮ Optimality conditions and optimization methods for quartic polynomial optimization ⋮ A new algorithm for solving the general quadratic programming problem ⋮ Necessary and sufficient global optimality conditions for convex maximization revisited ⋮ Properties of two DC algorithms in quadratic programming ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ On a solution method in indefinite quadratic programming under linear constraints ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Linear convergence of a type of iterative sequences in nonconvex quadratic programming ⋮ Box-constrained quadratic programs with fixed charge variables ⋮ A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ Copositive realxation for genera quadratic programming ⋮ Global optimality conditions for some classes of optimization problems ⋮ Boundedness of a type of iterative sequences in two-dimensional quadratic programming ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Block pivoting and shortcut strategies for detecting copositivity ⋮ A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems ⋮ Decomposition methods for solving nonconvex quadratic programs via branch and bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The simplex method. A probabilistic analysis
• Constrained global optimization: algorithms and applications
• Checking local optimality in constrained quadratic programming is NP- hard
• Finite criteria for conditional definiteness of quadratic forms
• Quadratic programming with one negative eigenvalue is NP-hard
• On copositive matrices
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• Some NP-complete problems in quadratic and nonlinear programming
• A Global Optimization Algorithm for Concave Quadratic Programming Problems