Complexity and numerical experiments of a new adaptive generic proximal bundle method

DOI10.1016/J.ORL.2026.107481MaRDI QIDQ7327304zbMATH OpenFDO

Authors Vincent Guigues, Renato D. C. Monteiro, Benoît Tran, Adriana W. Henarejos

Publication date 9 September 2026

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

Full work available at URL https://doi.org/10.1016/J.ORL.2026.107481

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A doubly stabilized bundle method for nonsmooth convex optimization
• 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 unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems
• An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems
• An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
• Average curvature FISTA for nonconvex smooth composite optimization problems
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
• Composite proximal bundle method
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• New limited memory bundle method for large-scale nonsmooth optimization
• New variants of bundle methods
• Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Proximity control in bundle methods for convex nondifferentiable minimization
• Universal gradient methods for convex optimization problems

This page was built for publication: Complexity and numerical experiments of a new adaptive generic proximal bundle method

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