On a General Class of Interior-Point Algorithms for Semidefinite Programming With Polynomial Complexity and Superlinear Convergence
Methods and Applications of Analysis
doi 10.4310/maa.1999.v6.n4.a8
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 1999
Authors
Publisher
International Press of Boston