Randomized block proximal method with locally Lipschitz continuous gradient

Documenti analoghi

• Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
  di: Latafat, Puya, et al.
  Pubblicazione: (2023)
• Nonmonotone subgradient methods based on a local descent lemma
  di: Aragón-Artacho, Francisco J., et al.
  Pubblicazione: (2025)
• On the convergence of proximal gradient methods for convex simple bilevel optimization
  di: Latafat, Puya, et al.
  Pubblicazione: (2023)
• Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
  di: Deng, Kangkang, et al.
  Pubblicazione: (2024)
• Adaptive proximal gradient methods are universal without approximation
  di: Oikonomidis, Konstantinos A., et al.
  Pubblicazione: (2024)