Ipopt
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 from 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 nonlinear and nonconvex, 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. Ipopt is part of the COIN-OR Initiative.
Keywords for this software
References in zbMATH (referenced in 466 articles )
Showing results 1 to 20 of 466.
Sorted by year (- Gugat, Martin; Hante, Falk M.: On the Turnpike phenomenon for optimal boundary control problems with hyperbolic systems (2019)
- Liuzzi, G.; Locatelli, M.; Piccialli, Veronica: A new branch-and-bound algorithm for standard quadratic programming problems (2019)
- Wang, Tong; Lima, Ricardo M.; Giraldi, Loïc; Knio, Omar M.: Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (2019)
- Yu, Qinxiao; Fang, Kan; Zhu, Ning; Ma, Shoufeng: A matheuristic approach to the orienteering problem with service time dependent profits (2019)
- Amaioua, Nadir; Audet, Charles; Conn, Andrew R.; Le Digabel, Sébastien: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (2018)
- Arreckx, Sylvain; Orban, Dominique: A regularized factorization-free method for equality-constrained optimization (2018)
- Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
- Bertsimas, Dimitris; Gupta, Vishal; Kallus, Nathan: Robust sample average approximation (2018)
- Cabrera G., Guillermo; Ehrgott, Matthias; Mason, Andrew J.; Raith, Andrea: A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy (2018)
- Cafieri, Sonia; Cellier, Loïc; Messine, Frédéric; Omheni, Riadh: Combination of optimal control approaches for aircraft conflict avoidance via velocity regulation (2018)
- Cafieri, Sonia; D’Ambrosio, Claudia: Feasibility pump for aircraft deconfliction with speed regulation (2018)
- Cai, W.; Singham, D. I.: A principal-agent problem with heterogeneous demand distributions for a carbon capture and storage system (2018)
- Carrizosa, Emilio; Guerrero, Vanesa; Romero Morales, Dolores: On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps (2018)
- Charkhgard, Hadi; Savelsbergh, Martin; Talebian, Masoud: A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (2018)
- Conti, Sergio; Rumpf, Martin; Schultz, Rüdiger; Tölkes, Sascha: Stochastic dominance constraints in elastic shape optimization (2018)
- Cots, Olivier; Gergaud, Joseph; Goubinat, Damien: Direct and indirect methods in optimal control with state constraints and the climbing trajectory of an aircraft (2018)
- Curtis, Frank E.; Wächter, Andreas; Zavala, Victor M.: A sequential algorithm for solving nonlinear optimization problems with chance constraints (2018)
- de Pinho, Maria do Rosário; Maurer, Helmut; Zidani, Hasnaa: Optimal control of normalized SIMR models with vaccination and treatment (2018)
- Duarte, Belmiro P. M.; Sagnol, Guillaume; Wong, Weng Kee: An algorithm based on semidefinite programming for finding minimax optimal designs (2018)
- Duarte, Belmiro P. M.; Wong, Weng Kee; Dette, Holger: Adaptive grid semidefinite programming for finding optimal designs (2018)