Fast proximal algorithms based on Chebychev centers for nonsmooth optimization

DOI10.1007/S10479-025-07015-7MaRDI QIDQ7317445zbMATH OpenFDO

Authors Adam Ouorou

Publication date 24 August 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-025-07015-7

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• A central cutting plane algorithm for the convex programming problem
• A descent algorithm for nonsmooth convex optimization
• A doubly stabilized bundle method for nonsmooth convex optimization
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A nonmonotone proximal bundle method with (potentially) continuous step decisions
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• An aggregate subgradient method for nonsmooth convex minimization
• Convergence of some algorithms for convex minimization
• Convex Analysis
• Fast proximal algorithms for nonsmooth convex optimization
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 2084780 (Why is no real title available?)
• Lectures on convex optimization
• Monotone Operators and the Proximal Point Algorithm
• New Proximal Point Algorithms for Convex Minimization
• Newton's method for convex programming and Tschebyscheff approximation
• On improvements to the analytic center cutting plane method
• Optimized first-order methods for smooth convex minimization
• Performance of first-order methods for smooth convex minimization: a novel approach
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• Proximity control in bundle methods for convex nondifferentiable minimization
• Standard bundle methods: untrusted models and duality
• Target radius methods for nonsmooth convex optimization
• The Cutting-Plane Method for Solving Convex Programs
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: Fast proximal algorithms based on Chebychev centers for nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317445)