Contents Online
Methods and Applications of Analysis
Volume 6 (1999)
Number 4
On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
Pages: 549 – 570
DOI: https://dx.doi.org/10.4310/MAA.1999.v6.n4.a8
Authors
Published 1 January 1999