Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization

Guanghui Lan

Type: Article

Publication Date: 2013-12-28

Citations: 73

DOI: https://doi.org/10.1007/s10107-013-0737-x

View Publication

Download PDF

Locations

Mathematical Programming - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Bundle-Level Type Methods Uniformly Optimal for Smooth and Nonsmooth Convex Optimization	2013	Guanghui Lan
+ PDF Chat	Modified Accelerated Bundle-Level Methods and Their Application in Two-Stage Stochastic Programming	2020	Chunming Tang Bo He Zhenzhen Wang
+ PDF Chat	Fast Bundle-Level Type Methods for Unconstrained and Ball-Constrained Convex Optimization	2014	Yunmei Chen Guanghui Lan Yuyuan Ouyang Wei Zhang
+	Fast Bundle-Level Type Methods for unconstrained and ball-constrained convex optimization	2014	Yunmei Chen Guanghui Lan Yuyuan Ouyang Wei Zhang
+	Level bundle methods for oracles with on-demand accuracy	2013	Welington de Oliveira Claudia Sagastizábal
+ PDF Chat	Accelerated bundle level methods with inexact oracle	2017	Zhang Wei CHEN YunMei
+	Level bundle-like algorithms for convex optimization	2013	Yunier Bello-Cruz Welington de Oliveira
+ PDF Chat	The Proximal Bundle Algorithm Under a Frank-Wolfe Perspective: an Improved Complexity Analysis	2024	David Fersztand Xu Andy Sun
+ PDF Chat	Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization	2024	Qi Deng Guanghui Lan Zhenwei Lin
+ PDF Chat	Primal-dual proximal bundle and conditional gradient methods for convex problems	2024	Jiaming Liang
+ PDF Chat	Optimal Tensor Methods in Smooth Convex and Uniformly Convex Optimization	2019	Alexander Gasnikov Pavel Dvurechensky Eduard Gorbunov Evgeniya Vorontsova Daniil Selikhanovych César A. Uribe
+ PDF Chat	Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities	1995	Krzysztof C. Kiwiel
+	A multi-step doubly stabilized bundle method for nonsmooth convex optimization	2020	Chunming Tang Shuai Liu Jinbao Jian Xiaomei Ou
+	Towards Unified Acceleration of High-Order Algorithms under Hölder Continuity and Uniform Convexity.	2019	Chaobing Song Yi Ma
+ PDF Chat	A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes	2020	Jiaming Liang Renato D. C. Monteiro
+	A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes	2020	Jiaming Liang Renato D. C. Monteiro
+ PDF Chat	Optimal Convergence Rates for the Proximal Bundle Method	2023	Mateo Díaz Benjamin Grimmer
+	Unified Acceleration of High-Order Algorithms under Hölder Continuity and Uniform Convexity	2019	Chaobing Song Yong Jiang Yi Ma
+	Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization	2020	Yunmei Chen Xiaojing Ye Wei Zhang
+	Proximal bundle algorithms for nonsmooth convex optimization via fast gradient smooth methods	2020	Adam Ouorou

Works That Cite This (65)

Action	Title	Year	Authors
+ PDF Chat	Optimal subgradient methods: computational properties for large-scale linear inverse problems	2018	Masoud Ahookhosh
+	A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems	2019	Qian Liu Yuqing Xu Yang Zhou
+ PDF Chat	Optimal Convergence Rates for the Proximal Bundle Method	2023	Mateo Díaz Benjamin Grimmer
+	Fast bundle-level methods for unconstrained and ball-constrained convex optimization	2019	Yunmei Chen Guanghui Lan Yuyuan Ouyang Wei Zhang
+ PDF Chat	Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	2024	Naoki Marumo Akiko Takeda
+	Inexact Model: A Framework for Optimization and Variational Inequalities	2019	Fedor Stonyakin Alexander Gasnikov Alexander Tyurin Dmitry Pasechnyuk Artem Agafonov Pavel Dvurechensky Darina Dvinskikh Alexey Kroshnin Victorya Piskunova
+	Inexact proximal stochastic second-order methods for nonconvex composite optimization	2020	Xiao Wang Hongchao Zhang
+ PDF Chat	Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization	2015	Cong D. Dang Guanghui Lan
+	Level bundle-like algorithms for convex optimization	2013	Yunier Bello-Cruz Welington de Oliveira
+ PDF Chat	Accelerated first-order methods for hyperbolic programming	2017	James Renegar

Works Cited by This (35)

Action	Title	Year	Authors
+	An extension of davidon methods to non differentiable problems	1975	Claude Lemaréchal
+	Primal-dual subgradient methods for minimizing uniformly convex functions	2014	Anatoli B. Juditsky Yuri Nesterov
+	Lectures on Modern Convex Optimization	2001	Aharon Ben‐Tal Arkadi Nemirovski
+ PDF Chat	A proximal method for composite minimization	2015	Adrian S. Lewis Stephen J. Wright
+	Approximate Level Method for Nonsmooth Convex Minimization	2011	Peter Richtárik
+	Newton's method for convex programming and Tchebycheff approximation	1959	E. W. Cheney A. A. Goldstein
+	Interior Gradient and Proximal Methods for Convex and Conic Optimization	2006	A. Auslender Marc Teboulle
+	Optimal methods of smooth convex minimization	1985	Arkadi Nemirovski Yu. E. Nesterov
+	Robust Stochastic Approximation Approach to Stochastic Programming	2009	Arkadi Nemirovski Anatoli Juditsky Guanghui Lan Alexander Shapiro
+ PDF Chat	Non-euclidean restricted memory level method for large-scale convex optimization	2004	Aharon Ben‐Tal Arkadi Nemirovski