Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations
From MaRDI portal
Publication:380457
DOI10.3934/JIMO.2013.9.305zbMath1281.90070OpenAlexW2327805652MaRDI QIDQ380457
Publication date: 14 November 2013
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2013.9.305
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
This page was built for publication: Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations
