A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints

MaRDI QIDQ3193979zbMATH OpenFDO

Authors Fenghua Chen, S. G. Li

Publication date 28 October 2015

zbMATH Keywords

global convergencenonlinear complementarityprogram with equilibrium constraintsQP-free algorithmsuperlinear convergence

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(13)

• An SQP algorithm for mathematical programs with nonlinear complementarity constraints
• QPCOMP: A quadratic programming based solver for mixed complementarity problems
• A global QP-free algorithm for mathematical programs with complementarity constraints
• A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
• Newton-type method for a class of mathematical programs with complementarity constraints
• A superlinear convergent smooth SQP algorithm for mathematical programs with nonlinear equilibrium constraints
• A strong global convergent QP-free algorithm for mathematical programming with nonlinear complementary constraints
• A conjugate gradient projection algorithm for mathematical programs with equilibrium constraints
• A project variable metric algorithm for mathematical programs with equilibrium constraints
• A globally convergent QP-free algorithm for optimization with nonlinear complementarity constraints
• A generalized strongly sub-feasible algorithm for mathematical programs with nonlinear complementarity constraints
• A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
• A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints

This page was built for publication: A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints

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