A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems
type: Item
instance of: scholarly article
title: A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems
zbMATH Open document ID: 1461.90150
author: Ajie Chu
author: Shouqiang Du
author: Yixiao Su
published in: Algorithms
publication date: 2019-03-26T00:00:00Z
review text: Summary: In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjugate gradient method for solving the nonlinear nonsmooth complementarity problems. The line search which we used guarantees the descent of the method. Under suitable conditions, the new smoothing conjugate gradient method is proved globally convergent. Finally, preliminary numerical experiments show that the new method is efficient.
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K15
zbMATH DE Number: 7042308
zbMATH Keywords: smoothing Fischer-Burmeister function
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: nonlinear nonsmooth complementarity problems
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a8041195
OpenAlex ID: W2210190271
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: A semismooth equation approach to the solution of nonlinear complementarity problems
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: A new path-following algorithm for nonlinear \(P_*\) complementarity problems
cites work: A combined homotopy interior point method for the linear complementarity problem
cites work: An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions
cites work: Merit functions for complementarity and related problems: a survey
cites work: A family of NCP functions and a descent method for the nonlinear complementarity problem
cites work: A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
cites work: A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
cites work: Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
cites work: A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
cites work: A penalized Fischer-Burmeister NCP-function
cites work: A new class of semismooth Newton-type methods for nonlinear complementarity problems
cites work: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
cites work: Jacobian Smoothing Methods for Nonlinear Complementarity Problems
cites work: Smooth Approximations to Nonlinear Complementarity Problems
cites work: Optimization and nonsmooth analysis
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: A special newton-type optimization method
cites work: An efficient hybrid conjugate gradient method for unconstrained optimization
cites work: Conjugate gradient methods with Armijo-type line searches.
cites work: Smoothing method for minimax problems
cites work: New limited memory bundle method for large-scale nonsmooth optimization
DOI: 10.3390/A8041195
description: scientific article; zbMATH DE number 7042308