On the differentiability check in gradient sampling methods

DOI10.1080/10556788.2016.1178262zbMath1354.65122MaRDI QIDQ2829571

Lucas E. A. Simões, Elias Salomão Helou, Sandra Augusta Santos

Publication date: 8 November 2016

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1178262

zbMATH Keywords

algorithm; convergence; nonsmooth optimization; nonconvex optimization; nonmonotone line search; numerical result; gradient sampling; differentiability check

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

Related Items

A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, On the local convergence analysis of the gradient sampling method for finite max-functions, Nonsmooth spectral gradient methods for unconstrained optimization, A fast gradient and function sampling method for finite-max functions, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, An efficient descent method for locally Lipschitz multiobjective optimization problems, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems

Cites Work

• Unnamed Item
• Nonsmooth optimization via quasi-Newton methods
• Methods of descent for nondifferentiable optimization
• An adaptive gradient sampling algorithm for non-smooth optimization
• A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• Optimizing Condition Numbers
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• Approximating Subdifferentials by Random Sampling of Gradients