Fetching the paper…
Reading the bibliography…
We consider minimization of composite functions of the form $f(g(x))+h(x)$, where $f$ and $h$ are convex functions (which can be nonsmooth) and $g$ is a smooth vector mapping.
Iterative Solution of Nonlinear Equations in Several Variables
James M. Ortega and Werner C. Rheinboldt · 1970
Earlier work this paper cites.
Approximation procedures based on the method of multipliers
Dimitri P Bertsekas · 1977
Earlier work this paper cites.
On the Bertsekas’ method for minimization of composite functions
BT Poljak · 1979
Earlier work this paper cites.
First and second order conditions for a class of nondifferentiable optimization problems
Roger Fletcher and G Alistair Watson · 1980
Earlier work this paper cites.
Descent methods for composite nondifferentiable optimization problems
James V Burke · 1985
Earlier work this paper cites.
Introduction to Optimization
Boris T. Polyak · 1987
Earlier work this paper cites.
A Gauss-Newton method for convex composite optimization
James V Burke and Michael C Ferris · 1995
Earlier work this paper cites.
Nonlinear programming
Dimitri P Bertsekas · 1997
Earlier work this paper cites.
Reinforcement Learning: An Introduction
Richard S Sutton and Andrew G Barto · 1998
Earlier work this paper cites.
Optimization of conditional value-at-risk
R Tyrrell Rockafellar, Stanislav Uryasev, et al · 2000
Earlier work this paper cites.
Numerical Optimization
Jorge Nocedal and Stephen J. Wright · 2006
Earlier work this paper cites.
Modified gauss–newton scheme with worst case guarantees for global performance
Yu Nesterov · 2007
Earlier work this paper cites.
Coherent approaches to risk in optimization under uncertainty
R. Tyrrell Rockafellar · 2007
Earlier work this paper cites.
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
Coralia Cartis, Nicholas IM Gould, and Philippe L Toint · 2011
Earlier work this paper cites.
Optimal distributed online prediction using mini-batches
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao · 2012
Earlier work this paper cites.
Convex analysis and minimization algorithms I: Fundamentals
Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Regularized iterative stochastic approximation methods for stochastic variational inequality problems
J. Koshal, A. Nedić, and U. B. Shanbhag · 2013
Earlier work this paper cites.
Advances in risk-averse optimization
Andrzej Ruszczyński · 2013
Earlier work this paper cites.
Policy evaluation with temporal differences: a survey and comparison
Christoph Dann, Gerhard Neumann, and Jan Peters · 2014
Earlier work this paper cites.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Earlier work this paper cites.
A proximal method for composite minimization
Adrian S Lewis and Stephen J Wright · 2016
Cited alongside, same era.
Accelerating stochastic composition optimization
Mengdi Wang, Ji Liu, and Ethan Fang · 2016
Cited alongside, same era.
Unbiased simulation for optimizing stochastic function compositions
Jose Blanchet, Donald Goldfarb, Garud Iyengar, Fengpei Li, and Chaoxu Zhou · 2017
Cited alongside, same era.
The proximal point method revisited
Dmitriy Drusvyatskiy · 2017
Cited alongside, same era.
Extragradient method with variance reduction for stochastic variational inequalities
A. N. Iusem, A. Jofré, R. I. Oliveira, and P. Phompson · 2017
Cited alongside, same era.
Finite-sum composition optimization via variance reduced gradient descent
Xiangru Lian, Mengdi Wang, and Ji Liu · 2017
Yu Bai, John Duchi, and Song Mei · 2019
Later among the works it cites.
Composite optimization for robust blind deconvolution
Vasileios Charisopoulos, Damek Davis, Mateo Díaz, and Dmitriy Drusvyatskiy · 2019
Later among the works it cites.
DINGO: Distributed newton-type method for gradient-norm optimization
Rixon Crane and Fred Roosta · 2019
Later among the works it cites.
Momentum-based variance reduction in non-convex sgd
Ashok Cutkosky and Francesco Orabona · 2019
Later among the works it cites.
Stochastic model-based minimization of weakly convex functions
Damek Davis and Dmitriy Drusvyatskiy · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
SARAH: A novel method for machine learning problems using stochastic recursive gradient
Lam M Nguyen, Jie Liu, Katya Scheinberg, and Martin Takáč · 2017
Cited alongside, same era.
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
Mengdi Wang, Ethan X Fang, and Han Liu · 2017
Cited alongside, same era.
Fast stochastic variance reduced ADMM for stochastic composition optimization
Yue Yu and Longbo Huang · 2017
Cited alongside, same era.
Line search methods for convex-composite optimization
James V Burke and Abraham Engle · 2018
Cited alongside, same era.
James V Burke and Abraham Engle · 2018
Cited alongside, same era.
Error bounds, quadratic growth, and linear convergence of proximal methods
Dmitriy Drusvyatskiy and Adrian S Lewis · 2018
Cited alongside, same era.
Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
Damek Davis and Benjamin Grimmer · 2019
Later among the works it cites.
Efficiency of minimizing compositions of convex functions and smooth maps
Dmitriy Drusvyatskiy and Courtney Paquette · 2019
Later among the works it cites.
Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval
John C Duchi and Feng Ruan · 2019
Later among the works it cites.
Optimal finite-sum smooth non-convex optimization with SARAH
Lam M Nguyen, Marten van Dijk, Dzung T Phan, Phuong Ha Nguyen, Tsui-Wei Weng, and Jayant R Kalagnanam · 2019
Later among the works it cites.
Non-smooth non-convex Bregman minimization: Unification and new algorithms
Peter Ochs, Jalal Fadili, and Thomas Brox · 2019
Later among the works it cites.
ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization
Nhan H Pham, Lam M Nguyen, Dzung T Phan, and Quoc Tran-Dinh · 2019
Later among the works it cites.
Distributionally robust optimization: a review
Hamed Rahimian and Sanjay Mehrotra · 2019
Later among the works it cites.
SpiderBoost and momentum: Faster variance reduction algorithms
Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, and Vahid Tarokh · 2019
Later among the works it cites.
A composite randomized incremental gradient method
Junyu Zhang and Lin Xiao · 2019
Later among the works it cites.
Multi-level composite stochastic optimization via nested variance reduction
Junyu Zhang and Lin Xiao · 2019
Later among the works it cites.
A stochastic composite gradient method with incremental variance reduction
Junyu Zhang and Lin Xiao · 2019
Later among the works it cites.
Stochastic proximal linear method for structured non-convex optimization
Tamir Hazan, Shoham Sabach, and Sergey Voldman · 2020
Closest in time.
Algorithms for stochastic optimization with function or expectation constraints
Guanghui Lan and Zhiqiang Zhou · 2020
Closest in time.
A practical online method for distributionally deep robust optimization
Qi Qi, Zhishuai Guo, Yi Xu, Rong Jin, and Tianbao Yang · 2020
Closest in time.
Stochastic gauss-newton algorithms for nonconvex compositional optimization
Quoc Tran-Dinh, Nhan Pham, and Lam Nguyen · 2020
Closest in time.