An inexact parallel splitting augmented Lagrangian method for large system of linear equations
From MaRDI portal
(Redirected from Publication:972939)
The authors propose a new iterative method for solving systems of linear equations -- the inexact parallel splitting augmented Lagrangian method. This method decomposes the cost of computational loads to each of the processors which participate in solving the problem and at the same time it can avoid the inverse matrix operator such that the complexity of each iteration is \({\mathcal{O}}(n^2)\) in theory and practice.
Recommendations
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- The parallel multisplitting TOR (MTOR) method for linear systems
- Convergence analysis of the parallel multisplitting psd method
- scientific article; zbMATH DE number 27980
- A new criterion for an inexact parallel splitting augmented Lagrangian method
Cites work
- A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS
- A class of parallel decomposition-type relaxation methods for large sparse systems of linear equations
- A general framework of contraction methods for monotone variational inequalities
- A new method for a class of linear variational inequalities
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- A Unified Proof for the Convergence of Jacobi and Gauss–Seidel Methods
- Accelerated Overrelaxation Method
- Application of the alternating direction method of multipliers to separable convex programming problems
- Convergence conditions for splitting iteration methods for non-Hermitian linear systems
- Convergence of parallel multisplitting iterative methods for M-matrices
- Convergence of relaxed parallel multisplitting methods
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- Models of asynchronous parallel matrix multisplitting relaxed iterations
- New convergence results for alternating methods
- Numerical Linear Algebra
- On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
- On the convergence of additive and multiplicative splitting iterations for systems of linear equations
- On the convergence of parallel nonstationary multisplitting iteration methods.
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Solution and applications of a class of general linear variational inequalities
Cited in
(6)- A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization
- Minimal residual based iterative methods and its parallel implementation for sparse linear systems
- Prediction-correction matrix splitting iteration algorithm for a class of large and sparse linear systems
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Communication protocols for options and results in a distributed optimization environment
- A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
This page was built for publication: An inexact parallel splitting augmented Lagrangian method for large system of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972939)
