A self-adaptive trust region method for the extended linear complementarity problems
type: Item
instance of: scholarly article
title: A self-adaptive trust region method for the extended linear complementarity problems
zbMATH Open document ID: 1212.65239
author: Zhensheng Yu
author: Qiang Li
published in: Applications of Mathematics
publication date: 2010-09-10T00:00:00Z
full work available at URL: https://eudml.org/doc/37807
full work available at URL: http://hdl.handle.net/10338.dmlcz/140349
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5782601
zbMATH Keywords: extended linear complementarity
zbMATH Keywords: global convergence
zbMATH Keywords: local superlinear convergence
zbMATH Keywords: trust region algorithm
MaRDI profile type: Publication
OpenAlex ID: W2058684439
cites work: On the solution of the extended linear complementarity problem
cites work: Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
cites work: Q3996569
cites work: A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
cites work: A special newton-type optimization method
cites work: Q4257419
cites work: Reducing a monotone horizontal LCP to an LCP
cites work: On the extended linear complementarity problem
cites work: Generalized Linear Complementarity Problems
cites work: Q4709691
cites work: A Trust Region Method for Solving Generalized Complementarity Problems
cites work: Q4252824
cites work: On a semismooth least squares formulation of complementarity problems with gap reduction
cites work: Jacobian Smoothing Methods for Nonlinear Complementarity Problems
cites work: The Extended Linear Complementarity Problem
cites work: Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A nonsmooth version of Newton's method
cites work: Automatic Determination of an Initial Trust Region in Nonlinear Programming
cites work: Some optimization reformulations of the extended linear complementarity problem
cites work: Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
cites work: A smoothing Gauss-Newton method for the generalized HLCP
cites work: Global \(s\)-type error bound for the extended linear complementarity problem and applications.
cites work: An adaptive trust region method and its convergence
cites work: A smoothing Levenberg-Marquardt method for NCP
DOI: 10.1007/S10492-009-0004-X
description: scientific article; zbMATH DE number 5782601