Information for RPM coin-or-Ipopt-3.12.13-3.fc31.src.rpm
| ID | 439478 | |||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | coin-or-Ipopt | |||||||||||||||||||||||
| Version | 3.12.13 | |||||||||||||||||||||||
| Release | 3.fc31 | |||||||||||||||||||||||
| Epoch | ||||||||||||||||||||||||
| Arch | src | |||||||||||||||||||||||
| Summary | Interior Point OPTimizer | |||||||||||||||||||||||
| Description | Ipopt (Interior Point OPTimizer, pronounced eye-pea-Opt) is a software package for large-scale nonlinear optimization. It is designed to find (local) solutions of mathematical optimization problems of the form min f(x) x in R^n s.t. g_L <= g(x) <= g_U x_L <= x <= x_U where f(x): R^n --> R is the objective function, and g(x): R^n --> R^m are the constraint functions. The vectors g_L and g_U denote the lower and upper bounds on the constraints, and the vectors x_L and x_U are the bounds on the variables x. The functions f(x) and g(x) can be non-linear and non-convex, but should be twice continuously differentiable. Note that equality constraints can be formulated in the above formulation by setting the corresponding components of g_L and g_U to the same value. | |||||||||||||||||||||||
| Build Time | 2019-08-02 05:27:15 GMT | |||||||||||||||||||||||
| Size | 2.64 MB | |||||||||||||||||||||||
| 60a45a90fcd9c987a0716c6272800130 | ||||||||||||||||||||||||
| License | EPL-1.0 | |||||||||||||||||||||||
| Buildroot | f31-build-65909-29794 | |||||||||||||||||||||||
| Provides | No Provides | |||||||||||||||||||||||
| Obsoletes | No Obsoletes | |||||||||||||||||||||||
| Conflicts | No Conflicts | |||||||||||||||||||||||
| Requires |
|
|||||||||||||||||||||||
| Recommends | No Recommends | |||||||||||||||||||||||
| Suggests | No Suggests | |||||||||||||||||||||||
| Supplements | No Supplements | |||||||||||||||||||||||
| Enhances | No Enhances | |||||||||||||||||||||||
| Files |
|
|||||||||||||||||||||||
| Component of | No Buildroots | |||||||||||||||||||||||
