Developer(s)Andreas Wächter, Carl Laird
Initial releaseAugust 26, 2005 (2005-08-26)
Stable release
3.14.12[1] / April 5, 2023 (2023-04-05)
Operating systemUNIX, Linux, macOS, Microsoft Windows
LicenseEclipse Public License
Websitegithub.com/coin-or/Ipopt

IPOPT, short for "Interior Point OPTimizer, pronounced I-P-Opt", is a software library for large scale nonlinear optimization of continuous systems. It is written in Fortran and C and is released under the EPL (formerly CPL). IPOPT implements a primal-dual interior point method, and uses line searches based on Filter methods (Fletcher and Leyffer). IPOPT can be called from various modeling environments and C.

IPOPT is part of the COIN-OR project.

IPOPT is designed to exploit 1st derivative (gradient) and 2nd derivative (Hessian) information if provided (usually via automatic differentiation routines in modeling environments such as AMPL). If no Hessians are provided, IPOPT will approximate them using a quasi-Newton methods, specifically a BFGS update.

IPOPT was originally developed[2] by Ph.D. student Andreas Wächter and Prof. Lorenz T. Biegler of the Department of Chemical Engineering at Carnegie Mellon University. Their work was recognized with the INFORMS Computing Society Prize in 2009.

Arvind Raghunathan later created an extension to IPOPT for Mathematical programming with equilibrium constraints (MPEC).[3] This version of IPOPT is generally known as IPOPT-C (with the 'C' standing for 'complementarity'). While in theory any mixed-integer program can be recast as an MPEC, it may or may not be solvable with IPOPT-C. Solution of MINLPs (Mixed-Integer Nonlinear Programs) using IPOPT is still being explored.[4][5]

Carl Laird and Andreas Wächter are the developers of IPOPT 3.0, which is a re-implementation of IPOPT in C++. Wächter and Laird were awarded the 2011 J. H. Wilkinson Prize for Numerical Software for this development.

See also

References

  1. ↑ "Github release page". GitHub.
  2. ↑ Wächter, Andreas; Biegler, Lorenz T. (2006). "On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming" (PDF). Mathematical Programming. 106: 25–57. doi:10.1007/s10107-004-0559-y. S2CID 14183894.
  3. ↑ Raghunathan, Arvind U.; Biegler, Lorenz T. (2005). "An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCS)". SIAM Journal on Optimization. 15 (3): 720–750. doi:10.1137/S1052623403429081.
  4. ↑ "CMU-IBM Open Source MINLP Project". Archived from the original on 2006-06-22.
  5. ↑ "Bonmin". 27 October 2023.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.