A filter algorithm with inexact line search
From MaRDI portal
Publication:1954692
DOI10.1155/2012/349178zbMath1264.90161OpenAlexW2059550728WikidataQ58911474 ScholiaQ58911474MaRDI QIDQ1954692
Qinmin Wu, Meiling Liu, Xue-Qian Li
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/349178
Related Items
Uses Software
Cites Work
- Unnamed Item
- A nonmonotone filter trust region method for nonlinear constrained optimization
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A derivative-free filter method for solving nonlinear complementarity problems
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Global Convergence of Filter Methods for Nonlinear Programming
- Numerical Optimization
- CUTE
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- A Filter-Trust-Region Method for Unconstrained Optimization
- Nonlinear programming without a penalty function.