Komei Fukuda, Tamás Terlaky  Home/Search
Context
Related
| cas.mcmaster.ca/~terlaky/fi...fukuda.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cas.mcmaster.ca/~terlaky/files... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A general framework of nite algorithms is presented here for quadratic programming. This algorithm is a direct generalization of Van der Heyden's algorithm for the linear complementarity problem and Jensen's `relaxed recursive algorithm', which was proposed for solution of Oriented Matroid programming problems. The validity of this algorithm is proved the same way as the finiteness of the criss-cross method is proved. The second part of this paper contains a generalization of Edmonds-Fukuda... (Update)
Active bibliography (related documents): More All
4.6: Some Generalizations of the Criss-Cross Method for Quadratic .. - Klafszky, Terlaky (1990) (Correct)
1.3: A Survey on Pivot Rules for Linear Programming - Terlaky, Zhang (1991) (Correct)
1.1: Linear Complementarity and Oriented Matroids - Fukuda, Terlaky (1990) (Correct)
Similar documents based on text: More All
0.4: New Variants Of Finite Criss-Cross Pivot Algorithms For Linear.. - Zhang (1997) (Correct)
0.4: The Linear Complementarity Problem, Sufficient Matrices.. - den Hertog, Roos.. (1990) (Correct)
0.3: Solving Inequalities and Proving Farkas's Lemma Made Easy - Avis, Kaluzny (2003) (Correct)
BibTeX entry: (Update)
@misc{ fukuda-edmonds,
author = "Komei Fukuda and Tam\'as Terlaky",
title = "Edmonds Fukuda Rule And A General Recursion For Quadratic Programming",
url = "citeseer.ist.psu.edu/326758.html" }
Citations (may not include all citations):276 Linear Programming and extensions (context) - Dantzig - 1963
45 Bimatrix equilibrium points and mathematical programming (context) - Lemke - 1965
40 Complementary pivot theory of mathematical programming (context) - Cottle, Dantzig - 1968
14 Linear Complementarity and Oriented Matroids - Fukuda, Terlaky
12 Some generalizations of the criss-cross method for quadratic.. - Klafszky, Terlaky
12 Oriented matroid programming (context) - Fukuda - 1982
12 Linear and quadratic programming in oriented matroids (context) - Todd - 1985
11 Complementarity in Oriented Matroids (context) - Todd - 1984
11 The simplex method for quadratic programming (context) - Wolfe - 1959
10 Some generalizations of the criss-cross method for the linea.. (context) - Klafszky, Terlaky - 1989
8 Least index resolution of degeneracy in linear complementari.. (context) - Chang - 1979
8 The criss-cross method for solving linear programming proble.. (context) - Zionts - 1969
6 Duality theory of linear programs: A constructive approach w.. (context) - Balinski, Tucker - 1969
5 On quadratic programming (context) - Beale - 1969
5 The principal pivoting method of quadratic programming (context) - Cottle
5 Principal pivotal transforms of square matrices (context) - Tucker - 1963
4 On l p programming (context) - Terlaky - 1985
4 Least index resolution of degeneracy in quadratic programmin.. (context) - Chang, Cottle - 1980
3 A variable dimension algorithm for the linear complementarit.. (context) - Van der Heyden - 1980
3 A new algorithm for quadratic programming (context) - Terlaky - 1987
3 Equivalence of some quadratic programming algorithms (context) - Best - 1984
3 The symmetric formulation of the simplex method for quadrati.. (context) - Van de, Whinston - 1969
3 The general quadratic optimization problem (context) - Keller - 1973
2 A dual quadratic programming algorithm (context) - Ritter - 1984
2 A nite criss-cross method for oriented matroids (context) - Terlaky - 1987
2 A combinatorial approach to convex quadratic programming (context) - Parsons - 1966
2 New nite pivoting rules for the simplex method (context) - Bland - 1977
2 On Terlaky path in the umbrella graph of a linear programmin.. (context) - Roos
1 A comformal elimination free algorithm for oriented matroid .. (context) - Wang - 1987
1 A combinatorial abstaraction of linear programming (context) - Bland - 1977
1 A convergent criss-ross method (context) - Terlaky - 1985
1 Symmetry and positive deniteness in oriented matroids (context) - Morris, Todd
1 Colouring and duality in combinatorial structures (context) - Jensen - 1985
1 Note on a Bard-type scheme for solving the complementarity p.. (context) - Murthy - 1974
1 the feasibility of the Edmonds-Fukuda pivoting rule (context) - Clausen - 1987
Documents on the same site (http://www.cas.mcmaster.ca/~terlaky/files/): More
A Potential Reduction Method for a Class of Smooth.. - den Hertog, Roos.. (1990) (Correct)
The Finite Criss-Cross Method for Hyperbolic Programming - Illes, Szirmai, Terlaky (1996) (Correct)
Criss-Cross Pivoting Rules - Terlaky (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC