## Edmonds Fukuda Rule And A General Recursion For Quadratic Programming

### BibTeX

@MISC{Fukuda_edmondsfukuda,

author = {Komei Fukuda and Tamás Terlaky},

title = {Edmonds Fukuda Rule And A General Recursion For Quadratic Programming},

year = {}

}

### OpenURL

### 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 pivoting rule for quadratic programming. This generalization can be considered as a finite version of Van de Panne - Whinston algorithm and so it is a simplex method for quadratic programming. These algorithms uses general combinatorial type ideas, so the same methods can be applied for oriented matroids as well. The generalization of these methods for oriented matroids is a subject of another paper.