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.


References in zbMATH (referenced in 686 articles )

Showing results 1 to 20 of 686.
Sorted by year (citations)

1 2 3 ... 33 34 35 next

  1. Adjé, Assalé: Quadratic maximization of reachable values of affine systems with diagonalizable matrix (2021)
  2. Aftalion, Amandine; Trélat, Emmanuel: Pace and motor control optimization for a runner (2021)
  3. Aghaee, Mahya; Hager, William W.: The switch point algorithm (2021)
  4. Ali, Zulfiqar; Ma, Weiyin: Isogeometric collocation method with intuitive derivative constraints for PDE-based analysis-suitable parameterizations (2021)
  5. Al Sayed, Abdelkader; Bogosel, Beniamin; Henrot, Antoine; Nacry, Florent: Maximization of the Steklov eigenvalues with a diameter constraint (2021)
  6. Arvind U. Raghunathan, Devesh K. Jha, Diego Romeres: PYROBOCOP : Python-based Robotic Control & Optimization Package for Manipulation and Collision Avoidance (2021) arXiv
  7. Berahas, Albert S.; Curtis, Frank E.; Robinson, Daniel; Zhou, Baoyu: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization (2021)
  8. Berthold, Timo; Witzig, Jakob: Conflict analysis for MINLP (2021)
  9. Bollhöfer, Matthias; Schenk, Olaf; Verbosio, Fabio: A high performance level-block approximate LU factorization preconditioner algorithm (2021)
  10. Bonart, Henning; Kahle, Christian: Optimal control of sliding droplets using the contact angle distribution (2021)
  11. Borges, Pedro; Sagastizábal, Claudia; Solodov, Mikhail: Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games (2021)
  12. Dandurand, Brian C.; Kim, Kibaek; Leyffer, Sven: A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems (2021)
  13. Ding Ma, Dominique Orban, Michael A. Saunders: A Julia implementation of Algorithm NCL for constrained optimization (2021) arXiv
  14. Ek, David; Forsgren, Anders: Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (2021)
  15. Erfani, Shervan; Babolian, Esmail; Javadi, Shahnam: New fractional pseudospectral methods with accurate convergence rates for fractional differential equations (2021)
  16. Fernandez, Felipe; Lewicki, James P.; Tortorelli, Daniel A.: Optimal toolpath design of additive manufactured composite cylindrical structures (2021)
  17. Haeser, Gabriel; Hinder, Oliver; Ye, Yinyu: On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (2021)
  18. Harwood, Stuart M.: Analysis of the alternating direction method of multipliers for nonconvex problems (2021)
  19. Hermans, Ben; Pipeleers, Goele; Patrinos, Panagiotis (Panos): A penalty method for nonlinear programs with set exclusion constraints (2021)
  20. Hinz, Jochen; Jaeschke, Andrzej; Möller, Matthias; Vuik, Cornelis: The role of PDE-based parameterization techniques in gradient-based IGA shape optimization applications (2021)

1 2 3 ... 33 34 35 next