Gradient-Based Optimization Algorithm for Solving Sylvester Matrix Equation
In this paper, we transform the problem of solving the Sylvester matrix equation into an optimization problem through the Kronecker product primarily. We utilize the adaptive accelerated proximal gradient and Newton accelerated proximal gradient methods to solve the constrained non-convex minimizati...
Main Authors: | Juan Zhang, Xiao Luo |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/7/1040 |
Similar Items
-
Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations
by: Kanjanaporn Tansri, et al.
Published: (2022-01-01) -
Convergence analysis of a gradient iterative algorithm with optimal convergence factor for a generalized Sylvester-transpose matrix equation
by: Nunthakarn Boonruangkan, et al.
Published: (2021-06-01) -
Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
by: Adisorn Kittisopaporn, et al.
Published: (2021-01-01) -
Developing CRS iterative methods for periodic Sylvester matrix equation
by: Linjie Chen, et al.
Published: (2019-03-01) -
Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
by: Adisorn Kittisopaporn, et al.
Published: (2021-05-01)