On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints
From MaRDI portal
Publication:4656057
DOI10.1080/02331930410001661208zbMath1109.90074MaRDI QIDQ4656057
Publication date: 8 March 2005
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930410001661208
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A log-exponential smoothing method for mathematical programs with complementarity constraints, A smoothing method for zero--one constrained extremum problems
Cites Work
- A smoothing method for mathematical programs with equilibrium constraints
- Practical bilevel optimization. Algorithms and applications
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A special newton-type optimization method
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Some Noninterior Continuation Methods for Linear Complementarity Problems