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. 1607.03815
  4. Cited By
Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than
  $O(1/ε)$

Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than O(1/ε)O(1/ε)O(1/ε)

13 July 2016
Yi Tian Xu
Yan Yan
Qihang Lin
Tianbao Yang
ArXivPDFHTML

Papers citing "Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/ε)$"

5 / 5 papers shown
Title
A Simple Stochastic Variance Reduced Algorithm with Fast Convergence
  Rates
A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates
Kaiwen Zhou
Fanhua Shang
James Cheng
14
74
0
28 Jun 2018
Adaptive Accelerated Gradient Converging Methods under Holderian Error
  Bound Condition
Adaptive Accelerated Gradient Converging Methods under Holderian Error Bound Condition
Mingrui Liu
Tianbao Yang
31
15
0
23 Nov 2016
A Richer Theory of Convex Constrained Optimization with Reduced
  Projections and Improved Rates
A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates
Tianbao Yang
Qihang Lin
Lijun Zhang
19
25
0
11 Aug 2016
Accelerate Stochastic Subgradient Method by Leveraging Local Growth
  Condition
Accelerate Stochastic Subgradient Method by Leveraging Local Growth Condition
Yi Tian Xu
Qihang Lin
Tianbao Yang
28
11
0
04 Jul 2016
RSG: Beating Subgradient Method without Smoothness and Strong Convexity
RSG: Beating Subgradient Method without Smoothness and Strong Convexity
Tianbao Yang
Qihang Lin
22
84
0
09 Dec 2015
1