A type of efficient feasible SQP algorithms for inequality constrained optimization

DOI10.1016/J.AMC.2009.10.055MaRDI QIDQ846474zbMATH OpenOpenAlexFDO

Authors Zhong Jin, Yuqing Wang

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

zbMATH Keywords

global convergencesuperlinear convergenceinequality constrained optimizationsuccessive quadratic programming (SQP)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)

Recommendations

• An efficient feasible SQP algorithm for inequality constrained optimization
• A simple feasible SQP algorithm for inequality constrained optimization
• An improved SQP algorithm for inequality constrained optimization
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
• A variant of feasible descent SQP method for inequality constrained optimization
• A feasible equality constrained SQP algorithm for nonlinear optimization
• A feasible SQP descent method for inequality constrained optimization problems and its convergence
• A SQP method for inequality constrained optimization.
• An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization
• An Inexact SQP Method for Equality Constrained Optimization

Cites work

• scientific article; zbMATH DE number 3643051 (Why is no real title available?)
• scientific article; zbMATH DE number 780774 (Why is no real title available?)
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A computationally efficient feasible sequential quadratic programming algorithm
• A note on quasi-newton formulae for sparse second derivative matrices
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• An efficient feasible SQP algorithm for inequality constrained optimization
• An improved SQP algorithm for inequality constrained optimization
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Test examples for nonlinear programming codes

Cited in

(14)

• An efficient feasible SQP algorithm for inequality constrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
• scientific article; zbMATH DE number 5671377 (Why is no real title available?)
• An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization
• A simple feasible SQP algorithm for inequality constrained optimization
• A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems

This page was built for publication: A type of efficient feasible SQP algorithms for inequality constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846474)