A simple feasible SQP algorithm for inequality constrained optimization

DOI10.1016/j.amc.2006.04.073zbMath1111.65057OpenAlexW2146283958MaRDI QIDQ858743

Zhi Bin Zhu

Publication date: 11 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.073

zbMATH Keywords

global convergencesuperlinear convergencesequential quadratic programming methodsnonlinear constrained minimization

Mathematics Subject Classification ID

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

Related Items (4)

A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ Joint optimization of condition-based maintenance and production lot-sizing ⋮ On the comparative optimal analysis and synthesis of four-bar function generating mechanism using different heuristic methods ⋮ A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control

Cites Work

• Unnamed Item
• Test examples for nonlinear programming codes
• A globally convergent method for nonlinear programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Exact penalty function algorithm with simple updating of the penalty parameter
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A sequential quadratic programming method for potentially infeasible mathematical programs
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• 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
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• A superlinearly convergent method of feasible directions.

This page was built for publication: A simple feasible SQP algorithm for inequality constrained optimization