A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems

References

• [1] Astorino A, Frangioni A, Fuduli A, Gorgone E (2013) A nonmonotone proximal bundle method with (potentially) continuous step decisions. SIAM J. Optim. 23(3):1784–1809.Crossref, Google Scholar
• [2] Beck A (2017) First-Order Methods in Optimization, MOS-SIAM Series on Optimization, vol. 25 (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [3] Ben-Tal A, Nemirovski A (2005) Non-Euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102(3):407–456.Crossref, Google Scholar
• [4] de Oliveira W, Solodov M (2016) A doubly stabilized bundle method for nonsmooth convex optimization. Math. Program. 156(1–2):125–159.Crossref, Google Scholar
• [5] de Oliveira W, Sagastizábal C, Lemaréchal C (2014) Convex proximal bundle methods in depth: A unified analysis for inexact oracles. Math. Program. 148(1–2):241–277.Crossref, Google Scholar
• [6] Díaz M, Grimmer B (2021) Optimal convergence rates for the proximal bundle method. Preprint, submitted May 17, https://arxiv.org/abs/2105.07874.Google Scholar
• [7] Du Y, Ruszczyński A (2017) Rate of convergence of the bundle method. J. Optim. Theory Appl. 173(3):908–922.Crossref, Google Scholar
• [8] Frangioni A (2002) Generalized bundle methods. SIAM J. Optim. 13(1):117–156.Crossref, Google Scholar
• [9] Kiwiel KC (1995) Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Program. 69(1–3):89–109.Crossref, Google Scholar
• [10] Kiwiel KC (2000) Efficiency of proximal bundle methods. J. Optim. Theory Appl. 104(3):589–603.Crossref, Google Scholar
• [11] Lan G (2012) An optimal method for stochastic composite optimization. Math. Program. 133(1):365–397.Crossref, Google Scholar
• [12] Lan G (2015) Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization. Math. Program. 149(1–2):1–45.Crossref, Google Scholar
• [13] Lemaréchal C (1975) An extension of davidon methods to non differentiable problems. Balinski ML, Wolfe P, eds. Nondifferentiable Optimization, Mathematical Programming Studies, vol. 3 (Springer, Berlin, Heidelberg), 95–109.Crossref, Google Scholar
• [14] Lemaréchal C (1978) Nonsmooth optimization and descent methods. Research Report 78-4, IIASA, Laxenburg, Austria.Google Scholar
• [15] Lemaréchal C, Nemirovski A, Nesterov Y (1995) New variants of bundle methods. Math. Program. 69(1–3):111–147.Crossref, Google Scholar
• [16] Liang J, Monteiro RDC (2021) A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes. SIAM J. Optim. 31(4):2955–2986.Crossref, Google Scholar
• [17] Mifflin R (1982) A modification and an extension of Lemaréchal’s algorithm for nonsmooth minimization. Sorensen DC, Wets RJ-B, eds. Nondifferential and Variational Techniques in Optimization, Mathematical Programming Studies, vol. 17 (Springer Verlag, Berlin, Heidelberg), 77–90.Crossref, Google Scholar
• [18] Monteiro RDC, Svaiter BF (2012) Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems. SIAM J. Optim. 22(3):914–935.Crossref, Google Scholar
• [19] Nesterov Y (2009) Primal-dual subgradient methods for convex problems. Math. Program. 120(1):221–259.Crossref, Google Scholar
• [20 Nesterov Y (2015) Universal gradient methods for convex optimization problems. Math. Program. 152(1):381–404.Crossref, Google Scholar
• [21] Ruszczyński A (2011) Nonlinear Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [22] Urruty J-BH, Lemaréchal C (1993) Convex Analysis and Minimization Algorithms I (Springer-Verlag, Berlin, Heidelberg).Crossref, Google Scholar
• [23] Urruty J-BH, Lemaréchal C (1993) Convex Analysis and Minimization Algorithms II. (Springer-Verlag, Berlin, Heidelberg).Crossref, Google Scholar
• [24] van Ackooij W, Berge V, de Oliveira W, Sagastizábal C (2017) Probabilistic optimization via approximate p-efficient points and bundle methods. Comput. Oper. Res. 77:177–193.Crossref, Google Scholar
• [25] Wolfe P (1975) A method of conjugate subgradients for minimizing nondifferentiable functions. Balinski ML, Wolfe P, eds. Nondifferentiable Optimization, Mathematical Programming Studies, vol. 3 (Springer, Berlin, Heidelberg), 145–173.Crossref, Google Scholar