A new algorithm for solving the general quadratic programming problem

DOI10.1007/BF00429750zbMath0844.90062OpenAlexW1995138983MaRDI QIDQ1908926

Reiner Horst, Nguyen Van Thoai

Publication date: 7 March 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationbranch and boundsimplicial subdivision

Mathematics Subject Classification ID

Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Decomposition approach for the global minimization of biconcave functions over polytopes ⋮ A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ Duality bound method for the general quadratic programming problem with quadratic constraints ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ A global optimization algorithm using linear relaxation ⋮ Decomposition methods for solving nonconvex quadratic programs via branch and bound

Cites Work

• Constrained global optimization: algorithms and applications
• An algorithm for indefinite quadratic programming with convex constraints
• Unconstrained and constrained global optimization of polynomial functions in one variable
• A finite algorithm for solving general quadratic problems
• Introduction to global optimization
• A Successive Underestimation Method for Concave Minimization Problems

This page was built for publication: A new algorithm for solving the general quadratic programming problem