A modified SQP-filter method and its global convergence
From MaRDI portal
Publication:990647
DOI10.1016/j.amc.2007.04.014zbMath1193.90215OpenAlexW2056420916MaRDI QIDQ990647
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.014
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55)
Related Items
Global convergence of a nonmonotone filter method for equality constrained optimization ⋮ A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics ⋮ A trust region SQP-filter method for nonlinear second-order cone programming ⋮ An SQP-filter method for inequality constrained optimization and its global convergence ⋮ Improved filter-SQP algorithm with active set for constrained minimax problems
Cites Work
- Unnamed Item
- An improved SQP algorithm for inequality constrained optimization
- A robust sequential quadratic programming method
- A note on quasi-newton formulae for sparse second derivative matrices
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- A modified SQP method and its global convergence
- A modified SQP method with nonmonotone linesearch technique.
- Nonlinear programming without a penalty function.