A relaxation method for mathematical programs with vertical complementarity constraints

DOI10.3969/J.ISSN.1005-3085.2014.04.013MaRDI QIDQ5171728zbMATH OpenFDO

Authors Yan-Chao Liang, Guihua Lin

Publication date 11 February 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3085.2014.04.013

zbMATH Keywords

convergencemathematical program with vertical complementarity constraintsrelaxation method

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

• New relaxation method for mathematical programs with complementarity constraints
• A new relaxation method for mathematical programs with nonlinear complementarity constraints
• Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints
• Modified relaxation method for mathematical programs with complementarity constraints
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

Cited in

(5)

• A new relaxation method for mathematical programs with nonlinear complementarity constraints
• Obtaining tighter relaxations of mathematical programs with complementarity constraints
• Coordinate relaxation methods for multivalued complementarity problems
• Modified relaxation method for mathematical programs with complementarity constraints
• The augmented Lagrangian method for mathematical programs with vertical complementarity constraints based on inexact Scholtes regularization

This page was built for publication: A relaxation method for mathematical programs with vertical complementarity constraints

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