A type of efficient feasible SQP algorithms for inequality constrained optimization
From MaRDI portal
Publication:846474
DOI10.1016/j.amc.2009.10.055zbMath1192.65078OpenAlexW2054346894MaRDI QIDQ846474
Publication date: 9 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.10.055
global convergencesuperlinear convergenceinequality constrained optimizationsuccessive quadratic programming (SQP)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
An improved sequential quadratic programming algorithm for solving general nonlinear programming problems, A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient feasible SQP algorithm for inequality constrained optimization
- Test examples for nonlinear programming codes
- 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 Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A note on quasi-newton formulae for sparse second derivative matrices
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
