# coin-or/Ipopt

COIN-OR Interior Point Optimizer IPOPT

Repository: https://github.com/coin-or/Ipopt
Canonical: https://ross.abutalabs.com/products/ipopt
Homepage: https://coin-or.github.io/Ipopt
Language: C++
License: EPL-2.0
License Family: copyleft
Last push: 2026-08-26T12:55:33+00:00

## Health v2 (maintenance only)
Score: 70/100 (v2, computed 2026-09-02T17:46:02.011165+00:00)
- activity 99, release rhythm 17, longevity 100
- inputs: {"age_days": 2774, "days_push": 7, "days_rel": 399, "gap_med": 113.5, "n_releases_24m": 3}
- flags: none
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 1778, forks 317 (observed 2026-08-28T04:05:35.192777+00:00)

## What it is
Ipopt (Interior Point OPTimizer) is an open-source C++ software package for large-scale nonlinear optimization of continuous problems with bounds and general constraints. It can be linked as a library from C++, C, Fortran, or Java, used via an AMPL solver executable, or accessed through an R interface.

## Use cases
- solve large-scale nonlinear programming problems with constraints
- find local optima of nonconvex twice-differentiable objective functions
- optimize engineering design problems with variable bounds and equality constraints
- embed a nonlinear solver into C++/Fortran/Java applications
- solve NLP models from AMPL or R
- perform interior-point optimization for trajectory or process optimization

## When to choose
- you need a mature, well-maintained open-source NLP solver with permissive commercial use (EPL)
- your problem is smooth (twice continuously differentiable) with nonlinear constraints and bounds
- you need to link a solver library into your own C++, C, Fortran, or Java code
- you want a proven interior-point method for large-scale continuous optimization

## When to avoid
- your problem is purely linear or quadratic where specialized LP/QP solvers are faster
- your functions are non-differentiable, discontinuous, or involve integer variables (mixed-integer problems)
- you need a global optimum rather than a local solution
- you need a pure-Python or pure-Julia solver without native dependencies

## Facets
- artifact type: library
- maturity: stable
- function: math, sdk, cli
- domain: mathematics, performance
- platform: windows, cpp, cross-platform
- tags: nonlinear-optimization, interior-point-method, nlp-solver, coin-or, mathematical-optimization, constrained-optimization, algorithms, scientific-computing, linux, macos

## Member repositories
- coin-or/Ipopt (main) score 70

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:05:35.192777+00:00.
- Health v2: computed from the inputs above; adoption is never an input.
- Inferred fields (summary, facets, guidance): AI-extracted, prompt v1, taxonomy v1, on 2026-08-30T03:25:09.675942+00:00, confidence not recorded.
  - readme: https://github.com/coin-or/Ipopt (fetched 2026-08-28T04:05:35.192777+00:00, sha 9a72a6026695)
  - homepage: https://coin-or.github.io/Ipopt (fetched 2026-08-29T11:03:19.239877+00:00, sha adfc02f8be79)
- Data as of 2026-08-30T08:39:29.467469+00:00.