An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
DOI10.1007/s11075-017-0405-yzbMath1402.90192OpenAlexW2751441143MaRDI QIDQ1652800
Publication date: 16 July 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0405-y
iterative methodslinear complementarity problemsalternating direction methodalternating direction implicitaugmented Lagrangiansymmetric positive definite
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 (5)
Cites Work
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- On the solution of large, structured linear complementarity problems: the block partitioned case
- On a problem of the theory of lubrication governed by a variational inequality
- 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
- On linear convergence of iterative methods for the variational inequality problem
- MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- 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
- Minkowski matrices.
- Asynchronous multisplitting relaxation methods for linear complementarity problems
- Matrix multisplitting relaxation methods for linear complementarity problems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems