Fetching the paper…
Reading the bibliography…
We consider the problem of minimizing the sum of two convex functions: one is differentiable and relatively smooth with respect to a reference convex function, and the other can be nondifferentiable but simple to optimize.
Inequalities
G. Hardy, J. E. Littlewood, and G. Pólya · 1952
Earlier work this paper cites.
Optimal design in regression problems
J. Kiefer and J. Wolfowitz · 1959
Earlier work this paper cites.
The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming
L. M. Bregman · 1967
Earlier work this paper cites.
Optimal and efficient designs of experiments
C. L. Atwood · 1969
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
An iterative row-action method for interval convex programming
Y. Censor and A. Lent · 1981
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovsky and D. Yudin · 1983
Earlier work this paper cites.
A method for solving a convex programming problem with convergence rate O ( 1 / k 2 ) O(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
On an approach to the construction of optimal methods of minimization of smooth convex functions
Y. Nesterov · 1988
Earlier work this paper cites.
Why least squares and maximum entropy? an axiomatic approach to inference for linear iverse problems
I. Csiszár · 1991
Earlier work this paper cites.
Proximal minimization algorithm withd-functions
Y. Censor and S. A. Zenios · 1992
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
G. Chen and M. Teboulle · 1993
Earlier work this paper cites.
Joint and separate convexity of the Bregman distance
H. H. Bauschke and J. M. Borwein · 2001
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Cited alongside, same era.
Smooth minimization of nonsmooth functions
Y. Nesterov · 2005
Cited alongside, same era.
Interior gradient and proximal methods for convex and conic optimization
A. Auslender and M. Teboulle · 2006
Cited alongside, same era.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Adaptive restart for accelerated gradient schemes
B. O’Donoghue and E. Candès · 2015
Later among the works it cites.
A descent Lemma beyond Lipschitz gradient continuity: first-order method revisited and applications
H. H. Bauschke, J. Bolte, and M. Teboulle · 2017
Later among the works it cites.
First-Order Methods in Optimization
A. Beck · 2017
Later among the works it cites.
Perturbed Fenchel duality and first-order methods
D. H. Gutman and J. F. Peña · 2018
Closest in time.
Fastest rates for stochastic mirror descent methods
F. Hanzely and P. Richtárik · 2018
Closest in time.
Relatively smooth convex optimization by first-order methods, and applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Image deblurring with Poisson data: from cells to galaxies
M. Bertero, P. Boccacci, G. Desiderà, and G. Vicidomini · 2009
Cited alongside, same era.
Distributed algorithms via gradient descent for Fisher markets
B. Birnbaum, N. R. Devanur, and L. Xiao · 2011
Cited alongside, same era.
Libsvm: A library for support vector machines
C.-C. Chang and C.-J. Lin · 2011
Cited alongside, same era.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Cited alongside, same era.
Universal gradient methods for convex optimization problems
Y. Nesterov · 2015
Cited alongside, same era.
H. Lu, R. M. Freund, and Y. Nesterov · 2018
Closest in time.
A simplified view of first order methods for optimization
M. Teboulle · 2018
Closest in time.
Optimal complexity and certification of bregman first-order methods
R.-A. Dragomir, A. B. Taylor, A. d’Aspremont, and J. Bolte · 2019
Closest in time.
“Relative-continuity” for non-Lipschitz non-smooth convex optimization using stochastic (or deterministic) mirror descent
H. Lu · 2019
Closest in time.
A simple convergence analysis of Bregman proximal gradient algorithm
Y. Zhou, Y. Liang, and L. Shen · 2019
Closest in time.
Implementable tensor methods in unconstrained convex optimization
Y. Nesterov · 2021
Closest in time.