On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Publication:2490321
DOI10.1007/s10107-004-0559-yzbMath1134.90542OpenAlexW2123871098WikidataQ56221738 ScholiaQ56221738MaRDI QIDQ2490321
Andreas Wächter, Lorenz T. Biegler
Publication date: 2 May 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0559-y
Nonlinear programmingNonconvex constrained optimizationLine searchInterior-point methodBarrier methodFilter method
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interior-point algorithm for nonconvex nonlinear programming
- Failure of global convergence for a class of interior point methods for nonlinear programming
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Numerical Optimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Trust Region Methods
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Interior Methods for Nonlinear Optimization
- A globally convergent primal-dual interior point method for constrained optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- CUTEr and SifDec
- A trust region method based on interior point techniques for nonlinear programming.
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
This page was built for publication: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming