A feasible filter SQP algorithm with global and local convergence
From MaRDI portal
Publication:2511102
DOI10.1007/s12190-012-0549-9zbMath1295.90083OpenAlexW2037494238MaRDI QIDQ2511102
Meiling Liu, Pu, Dingguo, Xue-Qian Li
Publication date: 5 August 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-012-0549-9
Related Items
Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations ⋮ A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization
Uses Software
Cites Work
- Unnamed Item
- A kind of nonmonotone filter method for nonlinear complementarity problem
- A filter SQP algorithm without a feasibility restoration phase
- Sequential penalty quadratic programming filter methods for nonlinear programming
- A globally convergent method for nonlinear programming
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A robust sequential quadratic programming method
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- A feasible SQP method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A Second Derivative SQP Method: Global Convergence
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- Global Convergence of Filter Methods for Nonlinear Programming
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- CUTEr and SifDec
- A Filter-Trust-Region Method for Unconstrained Optimization
- A modified SQP method and its global convergence
- Nonlinear programming without a penalty function.
