A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
type: Item
instance of: scholarly article
title: A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
zbMATH Open document ID: 1427.90259
DOI: 10.1155/2018/5056148
author: Yu Chen
author: Zhong Wan
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: We present a new smoothing method based on a logarithm-exponential function for mathematical program with complementarity constraints (MPCC). Different from the existing smoothing methods available in the literature, we construct an approximate smooth problem of MPCC by partly smoothing the complementarity constraints. With this new method, it is proved that the Mangasarian-Fromovitz constraint qualification holds for the approximate smooth problem. Convergence of the approximate solution sequence, generated by solving a series of smooth perturbed subproblems, is investigated. Under the weaker constraint qualification MPCC-Cone-Continuity Property, it is proved that any accumulation point of the approximate solution sequence is a M-stationary point of the original MPCC. Preliminary numerical results indicate that the developed algorithm based on the partly smoothing method is efficient, particularly in comparison with the other similar ones.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7019071
describes a project that uses: MacMPEC
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/5056148
OpenAlex ID: W2887315691
Wikidata QID: Q115521984
cites work: Mathematical Programs with Equilibrium Constraints
cites work: Further investigation on feasibility of mathematical programs with equilibrium constraints
cites work: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
cites work: A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
cites work: A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
cites work: A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
cites work: Interior Methods for Mathematical Programs with Complementarity Constraints
cites work: An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
cites work: Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
cites work: Partial exact penalty for mathematical programs with equilibrium constraints
cites work: Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
cites work: Lifting mathematical programs with complementarity constraints
cites work: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
cites work: A modified relaxation scheme for mathematical programs with complementarity constraints
cites work: A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
cites work: A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
cites work: Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: A new smoothing technique for mathematical programs with equilibrium constraints
cites work: Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
cites work: Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
cites work: A log-exponential smoothing method for mathematical programs with complementarity constraints
cites work: A class of smoothing methods for mathematical programs with complementarity constraints
cites work: A new smoothing scheme for mathematical programs with complementarity constraints
cites work: A strong convergent smoothing regularization method for mathematical programs with complementarity constraints
cites work: A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
cites work: Q5589748
cites work: A Cone-Continuity Constraint Qualification and Algorithmic Consequences
cites work: An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
cites work: A new nonmonotone line search technique for unconstrained optimization
cites work: New BFGS method for unconstrained optimization problem based on modified Armijo line search
cites work: A hybrid conjugate gradient method with descent property for unconstrained optimization
cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
Recommended article: A log-exponential smoothing method for mathematical programs with complementarity constraints
Recommended article: Q4690468
Recommended article: A new smoothing scheme for mathematical programs with complementarity constraints
Recommended article: Q4986667
Recommended article: A class of smoothing methods for mathematical programs with complementarity constraints
Recommended article: A smoothing method for a mathematical program with P-matrix linear complementarity constraints
Recommended article: A smoothing Newton algorithm for mathematical programs with complementarity constraints
Recommended article: Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method
Recommended article: A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS
Recommended article: A log-exponential regularization method for a mathematical program with general vertical complementarity constraints
description: scientific article; zbMATH DE number 7019071