A feasible SQP method for nonlinear programming
From MaRDI portal
Publication:2266975
DOI10.1016/j.amc.2009.11.045zbMath1185.65103MaRDI QIDQ2266975
Zhenjie Geng, Wei-Dong Zhang, Zhi Bin Zhu
Publication date: 26 February 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.11.045
global convergence; superlinear convergence; SQP method; active set strategies; nonlinear programing
Related Items
Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model, An improved sequential quadratic programming algorithm for solving general nonlinear programming problems, A feasible filter SQP algorithm with global and local convergence
Cites Work
- Unnamed Item
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Augmented Lagrangians which are quadratic in the multiplier
- An SQP method for general nonlinear programs using only equality constrained subproblems
- An improved SQP algorithm for inequality constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
