An efficient sequential quadratic programming algorithm for nonlinear programming

DOI10.1016/j.cam.2004.07.001zbMath1058.90078OpenAlexW2004199889MaRDI QIDQ1765487

Zhi Bin Zhu

Publication date: 23 February 2005

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2004.07.001

zbMATH Keywords

Sequential quadratic programmingSuperlinear convergence rateGlobal convergenceSQP algorithmInequality constrained optimizationFeasible directionsMethod of feasible direction

Mathematics Subject Classification ID

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

Related Items (9)

A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ An efficient feasible SQP algorithm for inequality constrained optimization ⋮ A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ Spatiotemporal vaccine allocation policies for epidemics with behavioral feedback dynamics ⋮ An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization ⋮ A new class of interval projection neural networks for solving interval quadratic program ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• A generalization of the norm-relaxed method of feasible directions
• A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
• 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 successive quadratic programming algorithm with global and superlinear convergence properties
• 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 surperlinearly convergent algorithm for constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers
• A superlinearly convergent method of feasible directions.

This page was built for publication: An efficient sequential quadratic programming algorithm for nonlinear programming