Solving semidefinite-quadratic-linear programs using SDPT3 R. H. TütüncüK. C. TohM. J. Todd Pages: 189 - 217
Avoiding numerical cancellation in the interior point method for solving semidefinite programs Jos F. Sturm Pages: 219 - 247
On implementing a primal-dual interior-point method for conic quadratic optimization E.D. AndersenC. RoosT. Terlaky Pages: 249 - 277
Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming Hande Y. BensonRobert J. Vanderbei Pages: 279 - 302
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results Kazuhide NakataKatsuki FujisawaKazuo Murota Pages: 303 - 327
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization Samuel BurerRenato D.C. Monteiro Pages: 329 - 357
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs Samuel BurerRenato D.C. MonteiroYin Zhang Pages: 359 - 379