PENNON: A code for convex nonlinear and semidefinite programming
Michal Kočvara, Michael Stingl · Optimization methods & software · 2003
We introduce a computer program PENNON for the solution of problems of convex Nonlinear and Semidefinite Programming (NLP-SDP). The algorithm used in PENNON is a generalized version of the Augmented Lagrangian method, originally introduced by Ben-Tal and Zibulevsky for convex NLP problems. We present generalization of this algorithm to convex NLP-SDP problems, as implemented in PENNON and details of its implementation. 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 optimization codes are presented. The test examples show that PENNON is particularly suitable for large sparse problems.
Cited by 297 works. doi:10.1080/1055678031000098773
Authors
References
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- AMPL : a modeling language for mathematical programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- CSDP, A C library for semidefinite programming
- Lectures on Modern Convex Optimization
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- SDPT3 — a Matlab software package for semidefinite-quadratic-linear programming, version 3.0
- SDPLIB 1.2, a library of semidefinite programming test problems
- A repository of convex quadratic programming problems