On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem

DOI10.1137/0329057zbMath0734.90101OpenAlexW2029084473WikidataQ60530403 ScholiaQ60530403MaRDI QIDQ3363081

Zhi-Quan Luo, Paul Tseng

Publication date: 1991

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0329057

zbMATH Keywords

convergencelinear complementaritymatrix splittingconvex quadratic programsymmetric positive semidefinitepoint successive overrelaxation

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (20)

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ Improved convergence theorems of multisplitting methods for the linear complementarity problem ⋮ On the convergence of iterative methods for symmetric linear complementarity problems ⋮ Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines ⋮ A multisplitting method for symmetric linear complementarity problems ⋮ Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization ⋮ Modified AOR methods for linear complementarity problem ⋮ A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Data ⋮ Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem ⋮ Why Do Similarity Matching Objectives Lead to Hebbian/Anti-Hebbian Networks? ⋮ An inexact NE/SQP method for solving the nonlinear complementarity problem ⋮ A multiplicative multisplitting method for solving the linear complementarity problem ⋮ A splitting method for quadratic programming problem ⋮ Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results ⋮ A preconditioned multisplitting and Schwarz method for linear complementarity problem ⋮ Error bounds and convergence analysis of feasible descent methods: A general approach ⋮ Unnamed Item ⋮ The adventures of a simple algorithm ⋮ Descent methods for convex essentially smooth minimization ⋮ On the convergence of the coordinate descent method for convex differentiable minimization

This page was built for publication: On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem