A globally convergent QP-free algorithm for optimization with nonlinear complementarity constraints

MaRDI QIDQ5256961zbMATH OpenFDO

Authors Renshuai Huang, Jian-Ling Li, Jinbao Jian

Publication date 29 June 2015

zbMATH Keywords

convergencenonlinear complementarity constraintsQP-free algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A global QP-free algorithm for mathematical programs with complementarity constraints
• A strong global convergent QP-free algorithm for mathematical programming with nonlinear complementary constraints
• A globally convergent SQP algorithm for mathematical programs with nonlinear complementarity constraints
• A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints
• An SQP algorithm for mathematical programs with nonlinear complementarity constraints

Cited in

(3)

• A global QP-free algorithm for mathematical programs with complementarity constraints
• A strong global convergent QP-free algorithm for mathematical programming with nonlinear complementary constraints
• scientific article; zbMATH DE number 3848110 (Why is no real title available?)

This page was built for publication: A globally convergent QP-free algorithm for optimization with nonlinear complementarity constraints

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