3 problems

Consider the nonconvex-component setting for incremental gradient descent, with random reshuffling (RR) as the permutation-based stochastic optimization method. Robust convergence…

Let $n$ be the number of component functions and $T$ the number of epochs. Random reshuffling (RR) is an optimization method that processes the component functions in a fresh rando…

Let $N$ be a positive integer and consider products of an arbitrary number $N$ of matrices. Non-commutative arithmetic-geometric mean inequality conjecture. The conjecture asserts…