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. 1608.03487
  4. Cited By
A Richer Theory of Convex Constrained Optimization with Reduced
  Projections and Improved Rates
v1v2 (latest)

A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates

11 August 2016
Tianbao Yang
Qihang Lin
Lijun Zhang
ArXiv (abs)PDFHTML

Papers citing "A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates"

14 / 14 papers shown
Title
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/ε)
Yi Tian Xu
Yan Yan
Qihang Lin
Tianbao Yang
77
25
0
13 Jul 2016
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its
  applications to linear convergence of first-order methods
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
Guoyin Li
Ting Kei Pong
146
295
0
09 Feb 2016
A Light Touch for Heavily Constrained SGD
A Light Touch for Heavily Constrained SGD
Andrew Cotter
Maya R. Gupta
Jan Pfeifer
30
25
0
15 Dec 2015
A Unified Approach to Error Bounds for Structured Convex Optimization
  Problems
A Unified Approach to Error Bounds for Structured Convex Optimization Problems
Zirui Zhou
Anthony Man-Cho So
63
184
0
11 Dec 2015
RSG: Beating Subgradient Method without Smoothness and Strong Convexity
RSG: Beating Subgradient Method without Smoothness and Strong Convexity
Tianbao Yang
Qihang Lin
77
85
0
09 Dec 2015
SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly
  Convex Composite Objectives
SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
Aaron Defazio
Francis R. Bach
Simon Lacoste-Julien
ODL
135
1,828
0
01 Jul 2014
Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets
Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets
Dan Garber
Elad Hazan
109
196
0
05 Jun 2014
Non-Asymptotic Convergence Analysis of Inexact Gradient Methods for
  Machine Learning Without Strong Convexity
Non-Asymptotic Convergence Analysis of Inexact Gradient Methods for Machine Learning Without Strong Convexity
Anthony Man-Cho So
95
41
0
31 Aug 2013
Optimal Stochastic Strongly Convex Optimization with a Logarithmic
  Number of Projections
Optimal Stochastic Strongly Convex Optimization with a Logarithmic Number of Projections
Jianhui Chen
Tianbao Yang
Qihang Lin
Lijun Zhang
Yi-Ju Chang
53
9
0
19 Apr 2013
O(logT) Projections for Stochastic Optimization of Smooth and Strongly
  Convex Functions
O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions
Lijun Zhang
Tianbao Yang
Rong Jin
Xiaofei He
90
29
0
02 Apr 2013
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
153
576
0
08 Dec 2012
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
Simon Lacoste-Julien
Martin Jaggi
Mark Schmidt
Patrick A. Pletscher
135
366
0
19 Jul 2012
Projection-free Online Learning
Projection-free Online Learning
Elad Hazan
Satyen Kale
107
248
0
18 Jun 2012
Making Gradient Descent Optimal for Strongly Convex Stochastic
  Optimization
Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization
Alexander Rakhlin
Ohad Shamir
Karthik Sridharan
169
768
0
26 Sep 2011
1