Fetching the paper…
Reading the bibliography…
This paper presents a proximal bundle (PB) framework based on a generic bundle update scheme for solving the hybrid convex composite optimization (HCCO) problem and establishes a common iteration-complexity bound for any variant belonging to it.
An extension of davidon methods to non differentiable problems
C. Lemaréchal · 1975
Earlier work this paper cites.
A method of conjugate subgradients for minimizing nondifferentiable functions
P. Wolfe · 1975
Earlier work this paper cites.
Nonsmooth optimization and descent methods
C. Lemaréchal · 1978
Earlier work this paper cites.
A modification and an extension of Lemaréchal’s algorithm for nonsmooth minimization
R. Mifflin · 1982
Earlier work this paper cites.
Convex analysis and minimization algorithms I
J.-B. H. Urruty and C. Lemaréchal · 1993
Earlier work this paper cites.
Convex analysis and minimization algorithms II
J.-B. H. Urruty and C. Lemaréchal · 1993
Earlier work this paper cites.
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
K. C. Kiwiel · 1995
Earlier work this paper cites.
New variants of bundle methods
C. Lemaréchal, A. Nemirovski, and Y. Nesterov · 1995
Earlier work this paper cites.
Efficiency of proximal bundle methods
K. C. Kiwiel · 2000
Earlier work this paper cites.
Generalized bundle methods
A. Frangioni · 2002
Cited alongside, same era.
Non-euclidean restricted memory level method for large-scale convex optimization
A. Ben-Tal and A. Nemirovski · 2005
Cited alongside, same era.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Cited alongside, same era.
Nonlinear optimization
A. Ruszczyński · 2011
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2012
Cited alongside, same era.
Iteration-complexity of a newton proximal extragradient method for monotone variational inequalities and inclusion problems
R. D. C. Monteiro and B. F. Svaiter · 2012
Cited alongside, same era.
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
G. Lan · 2015
Later among the works it cites.
Universal gradient methods for convex optimization problems
Y. Nesterov · 2015
Later among the works it cites.
A doubly stabilized bundle method for nonsmooth convex optimization
W. de Oliveira and M. Solodov · 2016
Later among the works it cites.
First-order methods in optimization
A. Beck · 2017
Later among the works it cites.
Rate of convergence of the bundle method
Y. Du and A. Ruszczyński · 2017
Later among the works it cites.
Probabilistic optimization via approximate p-efficient points and bundle methods
W. van Ackooij, V. Berge, W. de Oliveira, and C. Sagastizábal · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A nonmonotone proximal bundle method with (potentially) continuous step decisions
A. Astorino, A. Frangioni, A. Fuduli, and E. Gorgone · 2013
Cited alongside, same era.
Convex proximal bundle methods in depth: a unified analysis for inexact oracles
W. de Oliveira, C. Sagastizábal, and C. Lemaréchal · 2014
Cited alongside, same era.
M. Díaz and B. Grimmer · 2021
Closest in time.
A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes
J. Liang and R. D. C. Monteiro · 2021
Closest in time.