On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints

DOI10.1080/02331930410001661208zbMath1109.90074OpenAlexW2025573991MaRDI QIDQ4656057

Xinmin Hu

Publication date: 8 March 2005

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930410001661208

zbMATH Keywords

Nonlinear ProgrammingLinear Independence Constraint Qualification

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

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

This page was built for publication: On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints