PENNON – A Code for Convex Nonlinear and Semidefinite Programming

  • Michal Kočvara
  • Michael Stingl
    • Categories Convex Optimization, Mechanical Engineering, Semi-definite Programming Short URL: https://optimization-online.org/?p=9229

    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.

    Citation

    Report, Institute of Applied Mathematics, University of Erlangen, Martensstr.~3, 91058 Erlangen, Germany April 2002

    Article

    Download

    View PENNON - A Code for Convex Nonlinear and Semidefinite Programming