Superlinear convergence of a smooth approximation method for mathematical programs with nonlinear complementarity constraints
DOI10.4208/NMTMA.2010.33.6zbMATH Open1240.90372OpenAlexW3143388478MaRDI QIDQ3170064FDOQ3170064
Publication date: 29 September 2011
Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/nmtma.2010.33.6
super-linear convergencemathematical programsnonlinear complementarity constraintsaggregation technique
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (4)
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A smoothing Newton algorithm for mathematical programs with complementarity constraints
- Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis
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 👍 👎
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints 👍 👎
- A smoothing Newton algorithm for mathematical programs with complementarity constraints 👍 👎
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints 👍 👎
This page was built for publication: Superlinear convergence of a smooth approximation method 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 Q3170064)
