A new algorithm for quadratic programming

DOI10.1016/S0377-2217(87)80152-2zbMath0634.90053OpenAlexW2091806189MaRDI QIDQ1097172

Tamás Terlaky

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(87)80152-2

zbMATH Keywords

linear equation systemssimplex methodpivotingcriss-cross methodfeasible point active-set method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Existence of solutions for minimax problems (49J35)

Related Items (4)

New variants of the criss-cross method for linearly constrained convex quadratic programming ⋮ Some generalizations of the criss-cross method for quadratic programming ⋮ Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids ⋮ Pivot rules for linear programming: A survey on recent theoretical developments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\ell_ p\) programming
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method
• A quadratic programming algorithm
• Variants of the Hungarian method for solving linear programming problems
• Some Empirical Tests of the Criss-Cross Method

This page was built for publication: A new algorithm for quadratic programming