MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
From MaRDI portal
Publication:2017625
DOI10.1007/s11075-014-9864-6zbMath1330.90116OpenAlexW2053797267MaRDI QIDQ2017625
Publication date: 23 March 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9864-6
iterative methodalternating direction methodaugmented Lagrangiansymmetric positive definitelinear complementary problemsymmetric SOR
Computational methods for sparse matrices (65F50) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10) General methods in interval analysis (65G40)
Related Items
Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems ⋮ An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems ⋮ An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems ⋮ Fast modulus-based matrix splitting iteration methods for implicit complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations
- The convergence of parallel iteration algorithms for linear complementarity problems
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Multiplier and gradient methods
- On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
- Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
- A modified modulus method for symmetric positive-definite linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
- Efficient higher order implicit one-step methods for integration of stiff differential equations
- Asynchronous multisplitting relaxation methods for linear complementarity problems
- Matrix multisplitting relaxation methods for linear complementarity problems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Modified block SSOR preconditioners for symmetric positive definite linear systems
