On the differentiability check in gradient sampling methods
From MaRDI portal
(Redirected from Publication:2829571)
Recommendations
- Non-asymptotic guarantees for sampling by stochastic gradient descent
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- From Optimization to Sampling Through Gradient Flows
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- Approximating Subdifferentials by Random Sampling of Gradients
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Auxiliary Gradient-Based Sampling Algorithms
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Sampling Gaussian distributions in Krylov spaces with conjugate gradients
Cites work
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Approximating Subdifferentials by Random Sampling of Gradients
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Methods of descent for nondifferentiable optimization
- Nonsmooth optimization via quasi-Newton methods
- Optimizing condition numbers
Cited in
(11)- An efficient descent method for locally Lipschitz multiobjective optimization problems
- A new sequential optimality condition for constrained nonsmooth optimization
- On the local convergence analysis of the gradient sampling method for finite max-functions
- A fast gradient and function sampling method for finite-max functions
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- An adaptive gradient sampling algorithm for non-smooth optimization
- Nonsmooth spectral gradient methods for unconstrained optimization
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- Auxiliary Gradient-Based Sampling Algorithms
This page was built for publication: On the differentiability check in gradient sampling methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829571)
