An SQP algorithm for mathematical programs with nonlinear complementarity constraints

DOI10.1007/S10483-009-0512-XzbMath1177.90381OpenAlexW2019849542MaRDI QIDQ1030407

Cong Zhang, Zhi Bin Zhu, Jin-Bao Jian

Publication date: 1 July 2009

Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10483-009-0512-x

zbMATH Keywords

global convergencemathematical programs with equilibrium constraintssuperlinear convergence rate

Mathematics Subject Classification ID

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

Related Items (2)

A trust region algorithm for solving bilevel programming problems ⋮ A generalized project metric algorithm for mathematical programs with equilibrium constraints

Cites Work

• Unnamed Item
• A new smoothing technique for mathematical programs with equilibrium constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• 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 superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints

This page was built for publication: An SQP algorithm for mathematical programs with nonlinear complementarity constraints