Single-loop Projection-free and Projected Gradient-based Algorithms for Nonconvex-concave Saddle Point Problems with Bilevel Structure

Documenti analoghi

• Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
  di: Ahmadi, Mohammad Mahdi, et al.
  Pubblicazione: (2025)
• Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
  di: Melcher, Cody, et al.
  Pubblicazione: (2025)
• Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
  di: Abolfazli, Nazanin, et al.
  Pubblicazione: (2025)
• On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
  di: Cao, Jincheng, et al.
  Pubblicazione: (2025)
• A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
  di: Hamedani, Erfan Yazdandoost, et al.
  Pubblicazione: (2019)