T.D.Parsons, "A combinatorial approach to convex quadratic programming", Pronceton University, Ph.D. Thesis, 1966. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Edmonds Fukuda Rule And A General Recursion For Quadratic.. - Fukuda, Terlaky (Correct)
....the relationships among these algorithms were examined by Best [3] To review the extended literature of QP and LCP is a tremendous job and it is not the aim of this paper. Combinatorial behaviour of QP and LCP was considered already in the early years of mathematical programming (see e.g. Parsons [21]. Some combinatorial type problems as circling were recognised and solved by Cottle and Dantzig [10] A lexicographic rule was used to prevent circling. Least index resolution of LP [4,5] was adapted rst for QP by Chang and Cottle [6,7] They have proved that the Dantzig Cottle [10] Lemke [18] ....
T.D.Parsons, "A combinatorial approach to convex quadratic programming", Pronceton University, Ph.D. Thesis, 1966.
Some Generalizations of the Criss-Cross Method for Quadratic .. - Klafszky, Terlaky (1990) (2 citations) (Correct)
....[26] principal pivot transformation. Later, several other variants were discovered [10] 18] 22] 27] and the relation between these methods was examined [3] To review this extended literature is not the aim of the present paper. The combinatorial behavior of the LCP was examined by Parsons [17]. It is well known that combinatorial type problems (e.g. cycling) may occur if LCP is solved by simplex type methods. This problem and the solution by using lexicography was mentioned first by Cottle and Dantzig [8] The new results of linear programming (LP ) 4] 5] namely least index ....
T.D. Parsons, "A combinatorial approach to convex quadratic programming", Princeton University, Ph.D. Thesis, 1966.
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