A randomized block Douglas-Rachford method for solving linear matrix equation
From MaRDI portal
Publication:6592872
DOI10.1007/s10092-024-00599-9zbMATH Open1547.65041MaRDI QIDQ6592872
Publication date: 26 August 2024
Published in: Calcolo (Search for Journal in Brave)
image restorationNesterov-type momentumPolyak's momentumrandomized block Douglas-Rachford methodtensor product surface fitting
Computing methodologies for image processing (68U10) Matrix equations and identities (15A24) Numerical methods for matrix equations (65F45)
Cites Work
- Unnamed Item
- Unnamed Item
- On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
- Convex constrained optimization for large-scale generalized Sylvester equations
- Convergence of a randomized Douglas-Rachford method for linear system
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- The relaxed gradient-based iterative algorithms for a class of generalized coupled Sylvester-conjugate matrix equations
- On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations
- The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\)
- Reduced-rank gradient-based algorithms for generalized coupled Sylvester matrix equations and its applications
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Iterative algorithms for discrete-time periodic Sylvester matrix equations and its application in antilinear periodic system
- Developing Kaczmarz method for solving Sylvester matrix equations
- Shift-splitting iteration methods for a class of large sparse linear matrix equations
- On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\)
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- Stationary splitting iterative methods for the matrix equation \(AXB=C\)
- On global Hessenberg based methods for solving Sylvester matrix equations
- Some relaxed iteration methods for solving matrix equation \(AXB=C\)
- Two-step AOR iteration method for the linear matrix equation \(AXB=C\)
- A cyclic Douglas-Rachford iteration scheme
- Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations
- First-order and stochastic optimization methods for machine learning
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations
- New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- Randomized algorithms for total least squares problems
- Computational Methods for Linear Matrix Equations
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Surrounding the solution of a linear system of equations from all sides
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- An accelerated Jacobi-gradient based iterative algorithm for solving sylvester matrix equations
- Gradient based iterative algorithms for solving a class of matrix equations
- A Modified HSS Iteration Method for Solving the Complex Linear Matrix Equation AXB = C
- Some methods of speeding up the convergence of iteration methods
- A matrix LSQR iterative method to solve matrix equationAXB=C
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
This page was built for publication: A randomized block Douglas-Rachford method for solving linear matrix equation