A new algorithm for quadratic programming
From MaRDI portal
Publication:1097172
DOI10.1016/S0377-2217(87)80152-2zbMath0634.90053MaRDI QIDQ1097172
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
linear equation systems; simplex method; pivoting; criss-cross method; feasible point active-set method
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
49J35: Existence of solutions for minimax problems
Related Items
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, New variants of the criss-cross method for linearly constrained convex quadratic programming
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