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 interior point method, and uses line searches based on (Fletcher and Leyffer). IPOPT can be called from various modeling environments and C. IPOPT is part of the COIN-OR project.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| |
rdfs:comment
| - IPOPT(Interior Point OPTimizer、I-P-Opt と発音される)は、主双対内点法を利用した大規模(高次元)な連続最適化問題を解くライブラリである。C++で実装され、公開されているソースコードはEPLライセンスのもとで利用できる。 (ja)
- 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 interior point method, and uses line searches based on (Fletcher and Leyffer). IPOPT can be called from various modeling environments and C. IPOPT is part of the COIN-OR project. (en)
|
foaf:name
| |
foaf:homepage
| |
name
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
developer
| - Andreas Wächter, Carl Laird (en)
|
latest release date
| |
latest release version
| |
license
| |
operating system
| |
released
| |
website
| |
has abstract
| - 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 interior point method, and uses line searches based on (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 and 2nd derivative (Hessians) 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 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) [1]. 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 [2] [3]. 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. (en)
- IPOPT(Interior Point OPTimizer、I-P-Opt と発音される)は、主双対内点法を利用した大規模(高次元)な連続最適化問題を解くライブラリである。C++で実装され、公開されているソースコードはEPLライセンスのもとで利用できる。 (ja)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |