An iterative method based on ADMM for solving generalized Sylvester matrix equations
From MaRDI portal
Publication:2676138
The generalized Sylvester matrix equation is \(AXB+CXD=E,\) with \(A\) and \(C,\) \( B\) and \(D\), and \(E\) being matrices of sizes \(m\times n\), \(r\times p\) and \( m\times p\), respectively;\ accordingly, the unknown matrix \(X\) is of size \( n\times r\). The authors assume that \(A\) and \(C\) (\(B\) and \(D\)) are full column (row, respectively) rank. In the solution method they propose, submatrix equations of the type \(AXB=E_{1}\) and \(CXD=E_{2}\) are considered. An equation of the type \(AXB=F\) is reformulated as the optimization problem consisting in minimizing \(\frac{1}{2}\left\Vert ZB-X\right\Vert ^{2}\) subject to \(AX-Z=0\). Then, an alternating direction augmented Lagrangian method, using the decomposition \(f(X)+g(Z)\) of the objective function given by \(f(X):=0\) and \(g(Z):=\frac{1}{2}\left\Vert ZB-X\right\Vert ^{2}\), is proposed. A convergence theorem is proved and numerical examples are presented.
Recommendations
- An iterative algorithm for solving the generalized Sylvester-conjugate matrix equation
- The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations
- The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
- Iterative procedure for the solution of Sylvester generalized matrix equation
- Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations
- An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
- Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
- Gradient-based iterative algorithms for generalized coupled Sylvester-conjugate matrix equations
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices
Cites work
- A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- Accelerated Smith iterative algorithms for coupled Lyapunov matrix equations
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- An iterative algorithm for generalized Hamiltonian solution of a class of generalized coupled Sylvester-conjugate matrix equations
- An iterative algorithm for solving a class of generalized coupled Sylvester-transpose matrix equations over bisymmetric or skew-anti-symmetric matrices
- Block-s-step Krylov iterative methods
- Consensus-based distributed support vector machines
- Cramer's rule for a system of quaternion matrix equations with applications
- Distributed Computation of Linear Matrix Equations: An Optimization Perspective
- Distributed constraint optimization problems and applications: a survey
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Finite iterative solutions to periodic Sylvester matrix equations
- Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems
- Gradient based approach for generalized discrete-time periodic coupled Sylvester matrix equations
- scientific article; zbMATH DE number 2031025 (Why is no real title available?)
- scientific article; zbMATH DE number 2098307 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Iterative least-squares solutions of coupled sylvester matrix equations
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Matrix form of the CGS method for solving general coupled matrix equations
- Modified Lagrangians in convex programming and their generalizations
- Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
- On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
- On the ADI method for Sylvester equations
- On the Sylvester-like matrix equation AX+f(X)B=C
- Proximal splitting methods in signal processing
- Some open problems in matrix theory arising in linear systems and control
- The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
- The BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equations
- The double-step scale splitting method for solving complex Sylvester matrix equation
Cited in
(18)- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- A symmetric preserving iterative method for generalized Sylvester equation
- An efficient method for solving generalized Sylverster equation minimization problem under the nuclear and spectral norm
- The unified frame of alternating direction method of multipliers for three classes of matrix equations arising in control theory
- Alternating direction methods for solving a class of Sylvester-like matrix equations
- Alternating direction method for a class of Sylvester matrix equations with linear matrix inequality constraint
- The Alternating Direction Methods for Solving the Sylvester-Type Matrix Equation<br> <em>AXb + CX<sup>⊤</sup>D = E<sup>*</sup></em>
- Generalized conjugate direction algorithm for solving general coupled Sylvester matrix equations
- Nonlinear function activated GNN versus ZNN for online solution of general linear matrix equations
- An improved gradient neural network for solving periodic Sylvester matrix equations
- Cyclic gradient based iterative algorithm for a class of generalized coupled Sylvester-conjugate matrix equations
- Iterative algorithm to the generalized coupled Sylvester-transpose matrix equations with application in robust and minimum norm observer design of linear systems
- Iterative methods for the generalized Sylvester quaternion matrix equations using the ADMM approach
- An iterative method for solving Itô Lyapunov matrix equations associated with Itô-type stochastic systems
- Reduced biquaternion elastic net and its application
- Scaled alternating multiplier method for solving the matrix equation AXB + CXD = E
- Optimization methods for solving matrix equations
- Dimension reduction for optimal design problems with Kronecker product structure
This page was built for publication: An iterative method based on ADMM for solving generalized Sylvester matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676138)
