We present a line-search interior-point algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices and instead uses iterative linear system solvers. Inexact step computations are supported in order to save computational expense during each iteration. The algorithm is an interior-point approach derived from the inexact Newton method for equality constrained optimization described by Curtis, Nocedal, and Wächter in [9], with additional functionality for handling inequality constraints. The algorithm is shown to be globally convergent under standard assumptions. Numerical results are presented on partial differential equation constrained model problems.
By: Frank E. Curtis; Olaf Schenk; Andreas Waechter
Published in: RC24736 in 2009
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .