An efficient feasible SQP algorithm for inequality constrained optimization

DOI10.1016/j.nonrwa.2008.01.001zbMath1167.90652OpenAlexW2121700601MaRDI QIDQ837710

Jin-Bao Jian, Zhi Bin Zhu

Publication date: 20 August 2009

Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nonrwa.2008.01.001

zbMATH Keywords

global convergencesuperlinear convergenceinequality constrained optimizationSQP methodsystem of linear equations

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (11)

A type of efficient feasible SQP algorithms for inequality constrained optimization ⋮ A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ Application of the sequential parametric convex approximation method to the design of robust trusses ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization ⋮ Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization

Cites Work

• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• Test example for nonlinear programming codes
• An improved SQP algorithm for inequality constrained optimization
• An efficient sequential quadratic programming algorithm for nonlinear programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• A sequential quadratic programming method for potentially infeasible mathematical programs
• A Strategy for Global Convergence in a 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

This page was built for publication: An efficient feasible SQP algorithm for inequality constrained optimization