A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.

MaRDI QIDQ2746550zbMATH OpenFDO

Authors Jinbao Jian

Publication date 2001

Published in Acta Mathematica Scientia. Series A. (Chinese Edition) (Search for Journal in Brave)

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55)

Recommendations

• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A simple feasible SQP algorithm for inequality constrained optimization

Cited in

(19)

• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
• The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence
• An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• scientific article; zbMATH DE number 1932419 (Why is no real title available?)
• A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization
• scientific article; zbMATH DE number 2197961 (Why is no real title available?)
• Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
• A quadratically approximate framework for constrained optimization, global and local convergence

This page was built for publication: A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.

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