An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration

Documenti analoghi

• Computing Bouligand stationary points efficiently in low-rank optimization
  di: Olikier, Guillaume, et al.
  Pubblicazione: (2024)
• Low-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points
  di: Olikier, Guillaume, et al.
  Pubblicazione: (2022)
• Projected gradient descent accumulates at Bouligand stationary points
  di: Olikier, Guillaume, et al.
  Pubblicazione: (2024)
• A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
  di: Monteiro, Renato D. C., et al.
  Pubblicazione: (2024)
• Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
  di: Deng, Kangkang, et al.
  Pubblicazione: (2025)