Near-linear convergence of the Random Osborne algorithm for Matrix Balancing

We revisit Matrix Balancing, a pre-conditioning task used ubiquitously for computing eigenvalues and matrix exponentials. Since 1960, Osborne’s algorithm has been the practitioners’ algorithm of choice, and is now implemented in most numerical software packages. However, the theoretical properties o...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 198; no. 1; pp. 363 - 397
Main Authors:	Altschuler, Jason M., Parrilo, Pablo A.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023 Springer
Subjects:	Algorithms Analysis Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical 65F50 Random Osborne Convex optimization Near-linear time 90C25 Osborne’s algorithm Coordinate descent 65F08 Matrix Balancing
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!