| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
|
Burer, Samuel
|
|
2003
|
95 |
2 |
p. 359-379
|
article
|
| 2 |
An independent benchmarking of SDP and SOCP solvers
|
Mittelmann, H.D.
|
|
2003
|
95 |
2 |
p. 407-430
|
article
|
| 3 |
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
|
Burer, Samuel
|
|
2003
|
95 |
2 |
p. 329-357
|
article
|
| 4 |
Avoiding numerical cancellation in the interior point method for solving semidefinite programs
|
Sturm, Jos F.
|
|
2003
|
95 |
2 |
p. 219-247
|
article
|
| 5 |
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results
|
Nakata, Kazuhide
|
|
2003
|
95 |
2 |
p. 303-327
|
article
|
| 6 |
Foreword
|
Pataki, Gábor
|
|
2003
|
95 |
2 |
p. 187-188
|
article
|
| 7 |
Numerical evaluation of SBmethod
|
Helmberg, C.
|
|
2003
|
95 |
2 |
p. 381-406
|
article
|
| 8 |
On implementing a primal-dual interior-point method for conic quadratic optimization
|
Andersen, E.D.
|
|
2003
|
95 |
2 |
p. 249-277
|
article
|
| 9 |
Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming
|
Benson, Hande Y.
|
|
2003
|
95 |
2 |
p. 279-302
|
article
|
| 10 |
Solving semidefinite-quadratic-linear programs using SDPT3
|
Tütüncü, R. H.
|
|
2003
|
95 |
2 |
p. 189-217
|
article
|
Journal description