A globally and superlinearly convergent modified SQP-filter method

DOI10.1007/s10898-007-9219-0zbMath1153.90023OpenAlexW2086857863MaRDI QIDQ933797

Ke Su

Publication date: 25 July 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9219-0

zbMATH Keywords

Sequential quadratic programmingConstrained optimizationGlobal convergenceSuperlinear convergenceKKT point

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55)

Related Items

A dwindling filter trust region algorithm for nonlinear optimization ⋮ A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities ⋮ A dwindling filter line search algorithm for nonlinear equality constrained optimization ⋮ A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization ⋮ A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization ⋮ Nonmonotone filter DQMM method for the system of nonlinear equations ⋮ Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ Some results on the filter method for nonlinear complementary problems

Cites Work

• Unnamed Item
• An improved SQP algorithm for inequality constrained optimization
• A robust sequential quadratic programming method
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• A trust region filter method for general non-linear programming
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• A modified SQP method and its global convergence
• Mathematical theory of optimization
• A modified SQP method with nonmonotone linesearch technique.
• Nonlinear programming without a penalty function.