Abstract

Iterative gradient descent algorithms to solve algebraic linear equations are well known in the literature. These algorithms can be interpreted as dynamical closed loop control systems, where the step sizes are the control variables that can be optimally calculated by the Liapunov Control Functions (CLF) and Liapunov Optimizing Control (LOC) methods. In this paper matrix versions of gradient descent algorithms are deduced, including an unpublished matrix form of the Barzilai-Borwein algorithm. The step sizes (control variables) are also calculated by CLF/LOC. The main utility of these matrix algorithms is in image deblurring in the cases where the matrix that represents the blurring process is too large to be stored in the memory of the majority of conventional computational systems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.