Sequential quadratic programming with a flexible step acceptance strategy
From MaRDI portal
Publication:693514
DOI10.1016/j.apm.2011.11.014zbMath1252.90090MaRDI QIDQ693514
Publication date: 7 December 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.11.014
90C30: Nonlinear programming
90C20: Quadratic programming
90C55: Methods of successive quadratic programming type
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A modified QP-free feasible method
- A filter SQP algorithm without a feasibility restoration phase
- Sequential penalty quadratic programming filter methods for nonlinear programming
- Global convergence of a robust filter SQP algorithm
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- On the superlinear local convergence of a filter-SQP method
- A non-monotone line search multidimensional filter-SQP method for general nonlinear programming
- Global Convergence of Filter Methods for Nonlinear Programming
- Exact penalty functions in nonlinear programming
- Algorithms for nonlinear constraints that use lagrangian functions
- A Globally Convergent Filter Method for Nonlinear Programming
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- 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
- An Exact Potential Method for Constrained Maxima
- Nonlinear programming without a penalty function.