A class of smoothing methods for mathematical programs with complementarity constraints
type: Item
instance of: scholarly article
title: A class of smoothing methods for mathematical programs with complementarity constraints
zbMATH Open document ID: 1116.65074
author: Tao Yan
published in: Applied Mathematics and Computation
publication date: 2007-04-26T00:00:00Z
review text: A class of smoothing methods to solve mathematical programs with complementarity constraints is developed, and the convergence property is analyzed. The author shows that the linear independence constraint qualification holds for this class of smoothing methods under some conditions. The properties of the accumulated points of this class are analyzed, and the convergence properties are established under some conditions.
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5146975
zbMATH Keywords: mathematical programs
zbMATH Keywords: complementarity constraints
zbMATH Keywords: C-stationarity
zbMATH Keywords: M-stationarity
zbMATH Keywords: B-stationarity
zbMATH Keywords: smoothing methods
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: j.amc.2006.05.197
OpenAlex ID: W1986774669
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: A class of smoothing functions for nonlinear and mixed complementarity problems
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
cites work: Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: Q3816922
DOI: 10.1016/J.AMC.2006.05.197
description: scientific article; zbMATH DE number 5146975