A new algorithm for solving the general quadratic programming problem

DOI10.1007/BF00429750MaRDI QIDQ1908926zbMATH OpenOpenAlexFDO

Authors 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

branch and boundglobal optimizationsimplicial subdivision

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4037611
• A new algorithm for quadratic programming
• scientific article; zbMATH DE number 4172744
• scientific article; zbMATH DE number 3943565
• A new successive quadratic programming algorithm
• An algorithm for solving quadratic programming problems
• A new algorithm for concave quadratic programming
• A New Algorithm for Solving Strictly Convex Quadratic Programs
• scientific article; zbMATH DE number 3848975
• A new accelerating method for solving quadratic programming

Cites work

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

Cited in

(20)

• Generalization of Murty's direct algorithm to linear and convex quadratic programming
• New theoretical results on recursive quadratic programming algorithms
• A generalized problem of quadratic programming
• Decomposition approach for the global minimization of biconcave functions over polytopes
• A new algorithm for quadratic integer programming problems with cardinality constraint
• A global optimization algorithm using linear relaxation
• General complementary pivot algorithm of quadratic programming and application in securities investment
• A continuous approch for globally solving linearly constrained quadratic
• scientific article; zbMATH DE number 7234393 (Why is no real title available?)
• scientific article; zbMATH DE number 3908174 (Why is no real title available?)
• scientific article; zbMATH DE number 3920200 (Why is no real title available?)
• scientific article; zbMATH DE number 3943565 (Why is no real title available?)
• scientific article; zbMATH DE number 4037611 (Why is no real title available?)
• scientific article; zbMATH DE number 1215253 (Why is no real title available?)
• Linear complementarity procedures in quadratic programming
• Duality bound method for the general quadratic programming problem with quadratic constraints
• A new algorithm for the general quadratic programming problems with box constraints
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• A computational comparison of some branch and bound methods for indefinite quadratic programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908926)