Version 2 (modified by claird, 14 years ago) (diff)

Minor text changes

Success Stories and Active Work of Ipopt Users

This section is intended for people to describe their successes using Ipopt. Ipopt has been a COIN-OR open-source project since 2002 with a number of active users and contributors. While there have been many successes in this time, this Wiki has only been available since the release of Ipopt 3.0 (Aug. 26th, 2005). Please feel free to contribute successes, past or present, and for any version of Ipopt.

If you are using Ipopt, please add some comments about your application to the Wiki page. We are all eager to hear about Ipopt, its Applications, and its Users.

Solution of Almost Separable Problems with Few Common Variables

Submitted by Carl Laird, Co-author of Ipopt 3.0.0. There are a number of optimization problems that can be cast into a form that has an almost separable structure with few common variables (Optimal Design Under Uncertainty). The linear system that is solved at each iteration of Ipopt inherits this problem structure and decomposition techniques exist for efficient solution of these large NLPs. My primary interest in contributing to the new C++ version of Ipopt was to help build an object-oriented optimization tool that could be easily modified for the solution of large structured problems.

Currently, I have implemented a CompositeNLP that allows the building of a large almost separable problem and I am working on the decomposition technique (both serial and parallel version).

Solution of Mixed Integer Nonlinear Programs

Ongoing research project involving IBM and Carnegie Mellon University. A joint project has been started to develop open-source solvers for mixed integer nonlinear programs (MINLPs). Ipopt 3.0 is the primary NLP solver currently used in this development. To see more details about this project, see CMU-IBM Open Source MINLP Project