A feasible SQP method for nonlinear programming
The authors consider general nonlinear programming problems with both equality and inequality constraints. Existing Sequential Quadratic Methods (SQM) are surveyed. A serious drawback of the SQM consists in the necessity to solve a quadratic subproblem with inequality constraints. This fact motivated the authors to propose an algorithm, which overcomes this drawback. The proposed algorithm requires only solving linear systems or equivalently equality constrained quadratic subproblems on each iteration. Global and superlinear convergence under appropriate assumptions is proved.
- A computationally efficient feasible sequential quadratic programming algorithm
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- An improved SQP algorithm for inequality constrained optimization
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Augmented Lagrangians which are quadratic in the multiplier
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- An SQP method for general nonlinear programs using only equality constrained subproblems
- A new SQP method of feasible directions for nonlinear programming.
- Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model
- An efficient sequential quadratic programming algorithm for nonlinear programming
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A feasible filter SQP algorithm with global and local convergence
- A computationally efficient feasible sequential quadratic programming algorithm
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- The use of an SQP algorithm in slope stability analysis
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- scientific article; zbMATH DE number 4081316 (Why is no real title available?)
- scientific article; zbMATH DE number 1186923 (Why is no real title available?)
- Feedback stabilization methods for the solution of nonlinear programming problems
- scientific article; zbMATH DE number 1159542 (Why is no real title available?)
- A sub-feasible correction step for non-linear programming methods with equality constraints
- Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming
- scientific article; zbMATH DE number 938975 (Why is no real title available?)
- Line search SQP method with a flexible step acceptance procedure
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
- A feasible equality constrained SQP algorithm for nonlinear optimization
- A practical update criterion for SQP method
This page was built for publication: A feasible SQP method for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266975)
