Multiple Scale Methods For Optimization Of Discretized Continuous Functions
This paper presents a multiscale optimization framework for Lipschitz continuous functions that accelerates convergence and reduces computational costs by solving coarse-grid problems to warm-start fine-grid iterations, achieving provably tighter error bounds and significant speedups in applications like probability density estimation.