A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
type: Item
instance of: scholarly article
title: A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
zbMATH Open document ID: 1459.90210
DOI: 10.1155/2020/7986351
author: Xiaoqin Jiang
author: He Huang
published in: Mathematical Problems in Engineering
publication date: 2020-07-23T00:00:00Z
review text: Summary: In this paper, we present a smoothing Newton method for solving the monotone weighted complementarity problem (WCP). In each iteration of our method, the iterative direction is achieved by solving a system of linear equations and the iterative step length is achieved by adopting a line search. A feature of the line search criteria used in this paper is that monotone and nonmonotone line search are mixed used. The proposed method is new even when the WCP reduces to the standard complementarity problem. Particularly, the proposed method is proved to possess the global convergence under a weak assumption. The preliminary experimental results show the effectiveness and robustness of the proposed method for solving the concerned WCP.
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7224402
describes a project that uses: SCCP
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/7986351
OpenAlex ID: W3039511976
cites work: Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
cites work: Q4003375
cites work: Interior-point algorithms for a generalization of linear programming and weighted centring
cites work: Sufficient weighted complementarity problems
cites work: A smoothing Newton algorithm for weighted linear complementarity problem
cites work: A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
cites work: The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Tensor complementarity problems. I: Basic theory
cites work: Tensor complementarity problems. II: Solution methods
cites work: Tensor complementarity problems. III: Applications
cites work: Solvability of two classes of tensor complementarity problems
cites work: On NCP-functions
cites work: Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
cites work: Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
cites work: On smoothing methods for the \(P_{0}\) matrix linear complementarity problem
cites work: A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
cites work: Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
cites work: Improved smoothing-type methods for the solution of linear programs
cites work: A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
cites work: Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
cites work: Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
cites work: Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
cites work: A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
cites work: Non-interior continuation methods for solving semidefinite complementarity problems
cites work: Non-interior continuation method for solving the monotone semidefinite complementarity problem
cites work: A smoothing-type algorithm for solving system of inequalities
cites work: A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
cites work: Smoothing algorithms for complementarity problems over symmetric cones
cites work: A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
cites work: A smoothing Newton algorithm for mathematical programs with complementarity constraints
cites work: A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
cites work: A smoothing-type algorithm for absolute value equations
cites work: Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
cites work: Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
cites work: A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
cites work: A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
cites work: A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
cites work: An improvement of adaptive cubic regularization method for unconstrained optimization problems
cites work: Correction of trust region method with a new modified Newton method
cites work: An extended nonmonotone line search technique for large-scale unconstrained optimization
cites work: A new nonmonotone spectral residual method for nonsmooth nonlinear equations
cites work: A new nonmonotone line search technique for unconstrained optimization
cites work: A Weighted-Path-Following Method for Monotone Horizontal Linear Complementarity Problem
cites work: Corrector-predictor methods for sufficient linear complementarity problems
cites work: A two-step improved Newton method to solve convex unconstrained optimization problems
cites work: Q4625416
cites work: Q4963427
description: scientific article; zbMATH DE number 7224402