Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
DOI10.1007/s11228-024-00718-2MaRDI QIDQ6564758
Publication date: 1 July 2024
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
error boundlinear convergencebundle methodsproximal pointconvex optimisationderivative-free optimisationnonsmooth optimisationinexact subgradient\(\mathcal{VU}\)-algorithm
Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Nonsmooth optimization techniques on Riemannian manifolds
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Proximity control in bundle methods for convex nondifferentiable minimization
- A computational framework for derivative-free optimization of cardiovascular geometries
- A non-smooth model for signalized road network design problems
- Variable metric bundle methods: From conceptual to implementable forms
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Approximations in proximal bundle methods and decomposition of convex programs
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Finite element method for hemivariational inequalities. Theory, methods and applications
- A collection of nonsmooth Riemannian optimization problems
- Subdifferential enlargements and continuity properties of the \(\mathcal{VU}\)-decomposition in convex optimization
- The calculus of simplex gradients
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Computing proximal points of convex functions with inexact subgradients
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Subgradient and Bundle Methods for Nonsmooth Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Nonsmooth convex optimization for structured illumination microscopy image reconstruction
- Clarke Subgradients of Stratifiable Functions
- Generalized Gradients and Applications
- Monotone Operators and the Proximal Point Algorithm
- Numerical Optimization
- Variational Analysis
- The 𝒰-Lagrangian of a convex function
- Survey of Bundle Methods for Nonsmooth Optimization
- Error bounds for overdetermined and underdetermined generalized centred simplex gradients
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems
- A V U-POINT OF VIEW OF NONSMOOTH OPTIMIZATION
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Derivative-free optimization methods
- Numerical Analysis of $\mathcal{V}\mathcal{U}$-Decomposition, $\mathcal{U}$-Gradient, and $\mathcal{U}$-Hessian Approximations
- On the Subdifferentiability of Convex Functions
- Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
This page was built for publication: Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564758)
