4 papers
Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm
Susan Ghaderi, Alireza Kabgani, Yves Moreau +1
We study sampling from posterior distributions with nonsmooth composite potentials, a setting in which proximal-based Langevin methods are theoretically appealing but in practice l…
(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
Susan Ghaderi, Morteza Rahimi, Yves Moreau +1
This paper addresses the unconstrained minimization of smooth convex functions whose gradients are locally Holder continuous. Building on these results, we analyze the Scaled Gradi…
Minimizing Smooth Kurdyka-Łojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity
Masoud Ahookhosh, Susan Ghaderi, Alireza Kabgani +1
This paper introduces a generalized descent algorithm (DEAL) for minimizing smooth nonconvex functions. If the objective function is nonsmooth, a smoothing technique (e.g., forward…
Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
Morteza Rahimi, Susan Ghaderi, Yves Moreau +1
This paper is devoted to the class of paraconvex functions and presents some of its fundamental properties, characterization, and examples that can be used for their recognition an…