Fetching the paper…
Reading the bibliography…
Structured problems arise in many applications.
A method for solving the convex programming problem with convergence rate o (1/kˆ 2)
Y. E. Nesterov · 1983
Earlier work this paper cites.
Mean-variance analysis in portfolio choice and capital markets
H. M. Markowitz · 1987
Earlier work this paper cites.
Neyman-pearson classification, convexity and stochastic constraints
P. Rigollet and X. Tong · 2011
Earlier work this paper cites.
Portfolio selection [reprint of J. Finance 7
H. Markowitz · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2013
Earlier work this paper cites.
Linear coupling: An ultimate unification of gradient and mirror descent
Z. Allen-Zhu and L. Orecchia · 2014
Earlier work this paper cites.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Earlier work this paper cites.
A proximal stochastic gradient method with progressive variance reduction
L. Xiao and T. Zhang · 2014
Earlier work this paper cites.
A universal catalyst for first-order optimization
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Earlier work this paper cites.
Optimal black-box reductions between optimization objectives
Z. Allen-Zhu and E. Hazan · 2016
Earlier work this paper cites.
A simple practical accelerated method for finite sums
A. Defazio · 2016
Cited alongside, same era.
Tight complexity bounds for optimizing composite objectives
B. E. Woodworth and N. Srebro · 2016
Cited alongside, same era.
Katyusha: The first direct acceleration of stochastic gradient methods
Z. Allen-Zhu · 2017
Cited alongside, same era.
Finite-sum Composition Optimization via Variance Reduced Gradient Descent
X. Lian, M. Wang, and J. Liu · 2017
Cited alongside, same era.
Variance reduced methods for non-convex composition optimization
L. Liu, J. Liu, and D. Tao · 2017
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. Le Roux, and F. Bach · 2017
Asvrg: Accelerated proximal svrg
F. Shang, L. Jiao, K. Zhou, J. Cheng, Y. Ren, and Y. Jin · 2018
Later among the works it cites.
Multilevel stochastic gradient methods for nested composition optimization
S. Yang, M. Wang, and E. X. Fang · 2019
Closest in time.
A composite randomized incremental gradient method
J. Zhang and L. Xiao · 2019
Closest in time.
Multi-level composite stochastic optimization via nested variance reduction
J. Zhang and L. Xiao · 2019
Closest in time.
Momentum with variance reduction for nonconvex composition optimization
Z. Chen and Y. Zhou · 2020
Closest in time.
A single timescale stochastic approximation method for nested stochastic optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
M. Wang, E. X. Fang, and H. Liu · 2017
Cited alongside, same era.
Accelerating stochastic composition optimization
M. Wang, J. Liu, and E. X. Fang · 2017
Cited alongside, same era.
Fast stochastic variance reduced admm for stochastic composition optimization
Y. Yu and L. Huang · 2017
Cited alongside, same era.
Fairness Constraints: Mechanisms for Fair Classification
M. B. Zafar, I. Valera, M. G. Rogriguez, and K. P. Gummadi · 2017
Cited alongside, same era.
Accelerated Method for Stochastic Composition Optimization With Nonsmooth Regularization
Z. Huo, B. Gu, J. Liu, and H. Huang · 2018
Cited alongside, same era.
S. Ghadimi, A. Ruszczynski, and M. Wang · 2020
Closest in time.
First-order and Stochastic Optimization Methods for Machine Learning
G. Lan · 2020
Closest in time.
Improved sample complexity for stochastic compositional variance reduced gradient
T. Lin, C. Fan, M. Wang, and M. I. Jordan · 2020
Closest in time.
Stochastic Gauss-Newton algorithms for nonconvex compositional optimization
Q. Tran-Dinh, N. Pham, and L. Nguyen · 2020
Closest in time.
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
J. Zhang and L. Xiao · 2020
Closest in time.
Iteration complexity of inexact augmented lagrangian methods for constrained convex programming
Y. Xu · 2021
Closest in time.