This article describes a generalization of the PBM method by Ben-Tal and Zibulevsky to convex semidefinite programming problems. The algorithm used is a generalized version of the Augmented Lagrangian method. We present details of this algorithm as implemented in a new code PENNON. The code can also solve second-order conic programming (SOCP) problems, as well as problems with a mixture of SDP, SOCP and NLP constraints. Results of extensive numerical tests and comparison with other SDP codes are presented.
Keywordssemidefinite programming cone programming method of augmented Lagrangians
Unable to display preview. Download preview PDF.
- H.R.E.M. Hörnlein, M. Kočvara, and R. Werner. Material optimization: Bridging the gap between conceptual and preliminary design. Aerospace Science and Technology, 2001. In print.Google Scholar
- M. Kočvara. On the modelling and solving of the truss design problem with global stability constraints. Struct. Multidisc. Optimization, 2001. In print.Google Scholar
- H. Mittelmann. Benchmarks for optimization software. Available at http://plato.la.asu.edu/bench.html
- G. Pataki and S. Schieta. The DIMACS library of mixed semidefinite-quadratic-linear problems. Available at http://dimacs.rutgers.edu/challenges/seventh/instances
- M. Stingl. Konvexe semidefinite programmierung. Diploma Thesis, Institute of Applied Mathematics, University of Erlangen, 1999.Google Scholar