Smooth SQP algorithm for mathematical programs with implicit complementarity constraints

MaRDI QIDQ3500455zbMATH OpenFDO

Authors Zhong Wan, Shuzi Zhou

Publication date 3 June 2008

zbMATH Keywords

Clarke generalized Jacobianimplicit complementarity problemoptimization with equilibrium constraintssequential quadratical programming

Mathematics Subject Classification ID

Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Linear-quadratic optimal control problems (49N10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• An SQP algorithm for mathematical programs with nonlinear complementarity constraints
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• A globally convergent SQP algorithm for mathematical programs with nonlinear complementarity constraints
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints

Cited in

(3)

• A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
• An implicit formulation of mathematical program with complementarity constraints for application to robust structural optimization
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints

This page was built for publication: Smooth \(SQP\) algorithm for mathematical programs with implicit complementarity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500455)