Fast proximal algorithms for nonsmooth convex optimization

DOI10.1016/j.orl.2020.09.008OpenAlexW3090942500MaRDI QIDQ2661564

Adam Ouorou

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08902

zbMATH Keywords

nonsmooth optimizationconvex programmingproximal methodsNesterov accelerated gradient method

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Randomized smoothing variance reduction method for large-scale non-smooth convex optimization

Cites Work

• Unnamed Item
• A doubly stabilized bundle method for nonsmooth convex optimization
• Optimized first-order methods for smooth convex minimization
• First-order methods of smooth convex optimization with inexact oracle
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• Convergence of some algorithms for convex minimization
• Introductory lectures on convex optimization. A basic course.
• A simplified view of first order methods for optimization
• Target radius methods for nonsmooth convex optimization
• Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
• New variants of bundle methods
• Performance of first-order methods for smooth convex minimization: a novel approach
• Adaptive restart for accelerated gradient schemes
• New Proximal Point Algorithms for Convex Minimization
• Generalizing the Optimized Gradient Method for Smooth Convex Minimization
• Convergence Rates of Inertial Forward-Backward Algorithms

This page was built for publication: Fast proximal algorithms for nonsmooth convex optimization