A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems

DOI10.1287/MOOR.2023.1372zbMATH Open1544.65102MaRDI QIDQ6563017FDOQ6563017

Authors: Jiaming Liang, Renato D. C. Monteiro 

Publication date: 27 June 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Recommendations

• A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
• A single cut proximal bundle method for stochastic convex composite optimization
• A hybrid bundle method for nonsmooth convex optimization
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles

zbMATH Keywords

proximal bundle methoditeration-complexityuniversal methodhybrid convex composite optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (1)

• A single cut proximal bundle method for stochastic convex composite optimization

This page was built for publication: A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems

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