An asynchronous proximal bundle method

DOI10.1007/S10107-024-02088-XMaRDI QIDQ6665397zbMATH OpenFDO

Authors Frank Fischer

Publication date 17 January 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02088-X

zbMATH Keywords

convex optimizationparallel programmingproximal bundle methodsasynchronous algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 2084780 (Why is no real title available?)
• A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions
• Asynchronous level bundle methods
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
• Dynamic bundle methods
• Incremental bundle methods using upper models
• Incremental-like bundle methods with application to energy planning
• New variants of bundle methods
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Optimal Convergence Rates for the Proximal Bundle Method
• Proximity control in bundle methods for convex nondifferentiable minimization
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The omnipresence of Lagrange
• Variable metric bundle methods: From conceptual to implementable forms

This page was built for publication: An asynchronous proximal bundle method

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