Showing papers on "Semidefinite programming published in 1980"
24 citations
TL;DR: In this article, it is suggested to replace A by B′B, where B is allowed to vary freely, subject possibly to BX = 0, subject to AX = 0.
8 citations
Posted Content•
TL;DR: In this paper, the ellipsoidal method for solving linear programs due to Khachian and Shor is shown to process linear complementarity problems with positive semidefinite matrix.
Abstract: The recent ellipsoidal method for solving linear programs due to Khachian and Shor is shown to process linear complementarity problems with positive semidefinite matrix. Suitable modifications of all lemmas are presented and it is shown that the algorithm operates in polynomial time of the same order as that required for linear programming. Thus quadratic programming problems are solvable in polynomial time.
1 citations