Erratum: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Mathematical Programming (2007) 109 (413-444) DOI: 10.1007/s10107-006-0029-9);On the solution of large-scale SDP problems by the modified barrier method using iterative solvers

Mathematical Programming

Volumn 109, Issue 2-3, 2007, Pages 413-444

  Kočvara, Michal ^a,b   Stingl, Michael ^c  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^c UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

CONSTRAINED MATRIX; ITERATIVE SOLVERS; LARGE-SCALE SEMIDEFINITE OPTIMIZATION; NEWTON MATRIX;

COMPUTATIONAL METHODS;

EID: 33846697416     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0250-9     Document Type: Erratum

References (26)

1. Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM I Optim. 8, 746-768 (1998)
2. Benson, S.J., Ye, Y., Zhang, X.: Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM I Optim. 10, 443-462 (2000)
3. Borchers, B.: SDPLIB 1.2, a library of semidefinite programming test problems. Optim. Methods Soft. 11 & 12, 683-690 (1999). Available at http://www.nmt.edu/~borchers/
4. Burer, S., Monteiro, R.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Prog. (Ser. B), 95(2), 329-357 (2003)
5. Choi, C., Ye, Y.: Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. In: Working Paper, Computational Optimization Laboratory, University of Iowa, Iowa City, IA (2000)
6. Dolan, E.D., Moré, J.: Benchmarking optimization software with performance proflies. Math. Prog. 91, 201-213 (2002)
7. Fujisawa, K., Kojima, M., Nakata, K.: Exploiting sparsity in primal-dual interior-point method for semidefinite programming. Math. Prog. 79, 235-253 (1997)
8. Fukuda, M., Kojima, M., Shida, M.: Lagrangian dual interior-point methods for semidefinite programs. SIAM J. Optim. 12, 1007-1031 (2002)
9. Geiger, C., Kanzow, C.: Numerische Verfahren zur Lösung unrestringierter Optimierungsaufgaben. Springer, Berlin Heidelberg New York (1999) (In German)
10. Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361 (1996)
11. Kočvara, M., Leibfritz, F., Stingl, M., Henrion, D.: A nonlinear SDP algorithm for static output feedback problems in COMPlib. LAAS-CNRS Research Report No. 04508, LAAS, Toulouse (2004)
12. Kočvara, M., Stingl, M.: PENNON - a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18, 317-333 (2003)
13. Kočvara, M., Stingl, M.: Solving nonconvex SDP problems of structural optimization with stability control. Optim. Methods Softw. 19, 595-609 (2004)
14. Lin, C.J., Saigal, R.: An incomplete cholesky factorization for dense matrices. BIT 40, 536-558 (2000)
15. Mittelmann, H.: Benchmarks for Optimization Software; as of 26 November 2005. Available at http://plato.la.asu.edu/bench.html
16. Mittelmann, H.D.: An independent benchmarking of SDP and SOCP solvers. Math. Prog. 95, 407-430 (2003)
17. Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663-678 (1997)
18. Morales, J.L., Nocedal, J.: Automatic preconditioning by limited memory quasi-Newton updating. SIAM J. Optim. 10, 1079-1096 (2000)
19. Nocedal, J., Wright, S.: Numerical Optimization. Springer Series in Operations Research. Springer, Berlin Heidelberg New York (1999)
20. Polyak, R.: Modified barrier functions: Theory and methods. Math. Prog. 54, 177-222 (1992)
21. Stingl, M.: On the solution of nonlinear semidefinite programs by augmented Lagrangian methods. Ph.D. Thesis, Institute of Applied Mathematics II, Friedrich-Alexander University of Erlangen-Nuremberg (2005) (submitted)
22. Sturm, J.: Primal-dual interior point approach to semidefinite programming. Ph.D. Thesis, Tinbergen Institute Research Series vol. 156, Thesis Publishers, Amsterdam, The Netherlands (1997). Available at http://members. tripodnet.nl/SeDuMi/sturm/papers/ thesisSTURM.ps.gz
23. Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. SIAM J. Optim. 14, 670-698 (2003)
24. Toh, K.C., Kojima, M.: Solving some large scale semidefinite programs via the conjugate residual method. SIAM J. Optim. 12, 669-691 (2002)
25. Trick, M., Chvátal, V., Cook, W., Johnson, D., McGeoch, C., Trajan, R.: The second DIMACS implementation challenge: NP hard problems: Maximum clique, graph coloring, and satisfiability. Technical Report, Rutgers University. Available at http://dimacs.rutgers.edu/Challenges/
26. Zhang, S.L., Nakata, K., Kojima, M.: Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming. Appl. Numer. Math. 41, 235-245 (2002)