ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2305.14161
  4. Cited By
Revisiting Subgradient Method: Complexity and Convergence Beyond
  Lipschitz Continuity

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity

23 May 2023
Xiao Li
Lei Zhao
Daoli Zhu
Anthony Man-Cho So
ArXivPDFHTML

Papers citing "Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity"

2 / 2 papers shown
Title
Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
Wenzhi Gao
Qi Deng
22
1
0
25 Jan 2024
A Unified Analysis for the Subgradient Methods Minimizing Composite
  Nonconvex, Nonsmooth and Non-Lipschitz Functions
A Unified Analysis for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
Daoli Zhu
Lei Zhao
Shuzhong Zhang
11
2
0
30 Aug 2023
1