Residual norm steepest descent based iterative algorithms for Sylvester tensor equations
Authors
Abstract:
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and its modified version for solving the mentioned Sylvester tensor equation without setting the restriction of the existence of a unique solution. Numerical experiments are reported which confirm the validity of the presented results.
similar resources
residual norm steepest descent based iterative algorithms for sylvester tensor equations
consider the following consistent sylvester tensor equation[mathscr{x}times_1 a +mathscr{x}times_2 b+mathscr{x}times_3 c=mathscr{d},]where the matrices $a,b, c$ and the tensor $mathscr{d}$ are given and $mathscr{x}$ is the unknown tensor. the current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
full textFinite iterative algorithms for extended Sylvester-conjugate matrix equations
An iterative algorithm is presented for solving the extended Sylvester-conjugate matrix equation. By this iterativemethod, the solvability of thematrix equation can be determined automatically. When the matrix equation is consistent, a solution can be obtained within finite iteration steps for any initial values in the absence of round-off errors. The algorithm is also generalized to solve a mo...
full textIterative algorithms based on the hybrid steepest descent method for the split feasibility problem
In this paper, we introduce two iterative algorithms based on the hybrid steepest descent method for solving the split feasibility problem. We establish results on the strong convergence of the sequences generated by the proposed algorithms to a solution of the split feasibility problem, which is a solution of a certain variational inequality. In particular, the minimum norm solution of the spl...
full textAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
full textDoubly Degenerate Diiusion Equations as Steepest Descent
For p 2 (1; 1) and n > 0 we consider the scalar doubly degenerate diiusion equation @ t s ? div(jrs n j p?2 rs n) = 0 in (0; 1) (1) with no{{ux boundary conditions. We argue that this evolution problem can be understood as steepest descent of the convex functional sign(m ? 1) Z s m ; provided m := n + p ? 2 p ? 1 > 0 ; (2) w. r. t. the Wasserstein metric of order p on the space of probability d...
full textSteepest Descent
The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and dis...
full textMy Resources
Journal title
volume 2 issue 2
pages 115- 131
publication date 2015-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023