Fetching the paper…
Reading the bibliography…
This paper establishes the iteration-complexity of proximal bundle methods for solving hybrid (i.e., a blend of smooth and nonsmooth) weakly convex composite optimization (HWC-CO) problems.
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.
A modification and an extension of Lemaréchal’s algorithm for nonsmooth minimization
R. Mifflin · 1982
Earlier work this paper cites.
Nonsmooth optimization: analysis and algorithms with applications to optimal control
M. M. Makela and P. Neittaanmaki · 1992
Earlier work this paper cites.
Convergence of some algorithms for convex minimization
Rafael Correa and Claude 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.
Efficiency of proximal bundle methods
K. C. Kiwiel · 2000
Earlier work this paper cites.
Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
J. Vlček and L. Lukšan · 2001
Earlier work this paper cites.
Generalized bundle methods
A. Frangioni · 2002
Earlier work this paper cites.
On fréchet subdifferentials
A Ya Kruger · 2003
Cited alongside, same era.
Minimizing nonconvex nonsmooth functions via cutting planes and proximity control
A. Fuduli, M. Gaudioso, and G. Giallombardo · 2004
Cited alongside, same era.
Methods of descent for nondifferentiable optimization
K. C. Kiwiel · 2006
Cited alongside, same era.
A proximity control algorithm to minimize nonsmooth and nonconvex functions
D. Noll, O. Prot, and A. Rondepierre · 2008
Cited alongside, same era.
Computing proximal points of nonconvex functions
W. Hare and C. Sagastizábal · 2009
Cited alongside, same era.
A redistributed proximal bundle method for nonconvex optimization
W. Hare and C. Sagastizábal · 2010
Cited alongside, same era.
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.
Stochastic model-based minimization of weakly convex functions
D. Davis and D. Drusvyatskiy · 2019
Later among the works it cites.
Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
D. Davis and B. Grimmer · 2019
Later among the works it cites.
Efficiency of minimizing compositions of convex functions and smooth maps
D. Drusvyatskiy and C. Paquette · 2019
Later among the works it cites.
A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes
J. Liang and R. D. C. Monteiro · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nonlinear optimization
A. Ruszczyński · 2011
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.
A proximal bundle method for nonsmooth nonconvex functions with inexact information
W. Hare, C. Sagastizábal, and M. Solodov · 2016
Cited alongside, same era.
A unified analysis of descent sequences in weakly convex optimization, including convergence rates for bundle methods
F. Atenas, C. Sagastizábal, P. JS Silva, and M. Solodov · 2023
Closest in time.
Optimal convergence rates for the proximal bundle method
M. Díaz and B. Grimmer · 2023
Closest in time.
A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems
J. Liang and R. D. C. Monteiro · 2024
Closest in time.