On the local convergence analysis of the gradient sampling method for finite max-functions
From MaRDI portal
Publication:1682976
DOI10.1007/S10957-017-1160-XzbMath1386.90148OpenAlexW2751333275MaRDI QIDQ1682976
Lucas E. A. Simões, Elias Salomão Helou, Sandra Augusta Santos
Publication date: 6 December 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1160-x
Related Items (8)
A gradient sampling method based on ideal direction for solving nonsmooth optimization problems ⋮ A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ A fast gradient and function sampling method for finite-max functions ⋮ An adaptive gradient sampling algorithm for non-smooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \(\mathcal{VU}\)-algorithm for convex minimization
- On the differentiability check in gradient sampling methods
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
- Optimization of lipschitz continuous functions
- Stabilization via Nonsmooth, Nonconvex Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
This page was built for publication: On the local convergence analysis of the gradient sampling method for finite max-functions
