Some Generalizations Of The Criss-Cross Method For Quadratic Programming (1992)

by Emil Klafszky , Tamás Terlaky
Citations:13 - 8 self

Active Bibliography

Edmonds Fukuda Rule And A General Recursion For Quadratic Programming – Komei Fukuda, Tamás Terlaky
9 A Survey on Pivot Rules for Linear Programming – T. Terlaky, Shuzhong Zhang - 1991
Criss-Cross Pivoting Rules – T. Terlaky
3 Basis- and Tripartition Identification for Quadratic Programming and Linear Complementarity Problems - From an interior solution to an optimal basis and viceversa – A. B. Berkelaar, B. Jansen, C. Roos, T. Terlaky - 1996
12 Linear Complementarity and Oriented Matroids – Komei Fukuda, Tamas Terlaky - 1990
Linear Programming: Pivoting on . . . – Bohdan Lubomyr Kaluzny
6 The Linear Complementarity Problem, Sufficient Matrices and the Criss-Cross Method – D. Den Hertog, C. Roos, T. Terlaky - 1990
5 The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra – Emil Klafszky, Tamás Terlaky, T. U. Miskolc - 1991
Principal Pivoting Methods For Linear Complementarity Problems, PCP-LCP – Terlaky
6 On the Finiteness of the Criss-Cross Method – Komei Fukuda, Tomomi Matsui - 1989
184 A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra – David Avis, Komei Fukuda - 1992
4 A Monotonic Build-Up Simplex Algorithm for Linear Programming – K. M. Anstreicher, T. Terlaky - 1991
18 Criss-Cross Methods: A Fresh View on Pivot Algorithms – Komei Fukuda, Tamás Terlaky - 1997
Recollections on the discovery of the reverse search technique – David Avis
On Circuit Valuation of Matroids – Kazuo Murota, Akihisa Tamura - 2000
1 Combinatorial Maximum Improvement Algorithm for LP and LCP – Komei Fukuda, Hans-Jakob Lüthi - 1995
3 A Polynomial Method of Weighted Centers for Convex Quadratic Programming – D. Den Hertog, C. Roos, C. Roos, T. Terlaky, T. Terlaky - 1991
8 Further Development on the Interior Algorithm for Convex Quadratic Programming – Yinyu Ye - 1987