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.17323
  4. Cited By
Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization

31 December 2024
Benjamin Grimmer
Danlin Li
ArXivPDFHTML

Papers citing "Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization"

3 / 3 papers shown
Title
Gauges and Accelerated Optimization over Smooth and/or Strongly Convex
  Sets
Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
Ning Liu
Benjamin Grimmer
43
4
0
09 Mar 2023
A simpler approach to obtaining an O(1/t) convergence rate for the
  projected stochastic subgradient method
A simpler approach to obtaining an O(1/t) convergence rate for the projected stochastic subgradient method
Simon Lacoste-Julien
Mark W. Schmidt
Francis R. Bach
126
259
0
10 Dec 2012
Stochastic Gradient Descent for Non-smooth Optimization: Convergence
  Results and Optimal Averaging Schemes
Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes
Ohad Shamir
Tong Zhang
101
570
0
08 Dec 2012
1