Interior path following primal-dual algorithms. part II: Convex quadratic programming

Publisher Website

1 May 1989

journal article
Published by Springer Nature in Mathematical Programming

Vol. 44 (1-3) , 43-66
https://doi.org/10.1007/bf01587076

Abstract

No abstract available

Keywords

This publication has 2 references indexed in Scilit:

A polynomial-time algorithm for a class of linear complementarity problems
Mathematical Programming, 1989
A new polynomial-time algorithm for linear programming
Combinatorica, 1984