Superlinear convergence of a smooth approximation method for mathematical programs with nonlinear complementarity constraints
From MaRDI portal
Publication:3170064
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
Cited in
(5)- Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- A smoothing Newton algorithm 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)