Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
From MaRDI portal
Publication:4017642
DOI10.1137/0801009zbMath0777.90070OpenAlexW2011925679MaRDI QIDQ4017642
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/59264
convergence of iteratesinexact subproblem solutioninexact block Jacobi methodsymmetric monotone linear complementarity problemsymmetric regular matrix splitting algorithm
Quadratic programming (90C20) 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
On the convergence of iterative methods for symmetric linear complementarity problems, Inexact multisplitting methods for linear complementarity problems, On linear convergence of iterative methods for the variational inequality problem, Descent methods with linesearch in the presence of perturbations, A modified damped Newton method for linear complementarity problems, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, Parallel algorithm for support vector machines training and quadratic optimization problems, Convergence analysis of perturbed feasible descent methods, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, A modified modulus method for symmetric positive-definite linear complementarity problems, An inexact NE/SQP method for solving the nonlinear complementarity problem, Bounded perturbation resilience of projected scaled gradient methods, Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results, Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks, Error bounds and convergence analysis of feasible descent methods: A general approach, Gauss-Seidel method for least-distance problems
