Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
From MaRDI portal
Publication:5478749
DOI10.1080/01630560600657323zbMath1136.90479OpenAlexW1973656227MaRDI QIDQ5478749
Publication date: 13 July 2006
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560600657323
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (4)
Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints ⋮ A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS ⋮ A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
Cites Work
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Bilevel and multilevel programming: A bibliography review
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Network design problem with congestion effects: A case of bilevel programming
- On Optimization Problems with Variational Inequality Constraints
- Mathematical Programs with Equilibrium Constraints
This page was built for publication: Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints