An asynchronous proximal bundle method
From MaRDI portal
Publication:6665397
DOI10.1007/S10107-024-02088-XMaRDI QIDQ6665397FDOQ6665397
Authors: Frank Fischer
Publication date: 17 January 2025
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Proximity control in bundle methods for convex nondifferentiable minimization
- Variable metric bundle methods: From conceptual to implementable forms
- New variants of bundle methods
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- The omnipresence of Lagrange
- Incremental-like bundle methods with application to energy planning
- Dynamic bundle methods
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Incremental Bundle Methods using Upper Models
- Optimal Convergence Rates for the Proximal Bundle Method
- Asynchronous level bundle methods
- A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions
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)