A superlinear convergent smooth SQP algorithm for mathematical programs with nonlinear equilibrium constraints
From MaRDI portal
Publication:2860397
zbMATH Open1289.90221MaRDI QIDQ2860397FDOQ2860397
Authors: Fujian Duan, Ling Tan, Zhibin Zhu 
Publication date: 19 November 2013
Published in: Mathematica Applicata (Search for Journal in Brave)
Recommendations
- A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
- 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
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (6)
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints
- Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
This page was built for publication: A superlinear convergent smooth SQP algorithm for mathematical programs with nonlinear equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860397)
