A note on the convergence of deterministic gradient sampling in nonsmooth optimization
From MaRDI portal
Recommendations
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- A subgradient method for unconstrained nonconvex nonsmooth optimization
Cites work
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Approximating Subdifferentials by Random Sampling of Gradients
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Nonsmooth optimization via quasi-Newton methods
- Optimization of lipschitz continuous functions
- Proximity Maps for Convex Sets
- Semismooth and Semiconvex Functions in Constrained Optimization
Cited in
(3)
This page was built for publication: A note on the convergence of deterministic gradient sampling in nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498411)
