A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
From MaRDI portal
Publication:831368
DOI10.1007/S10957-020-01740-8zbMath1467.90042OpenAlexW3081934664MaRDI QIDQ831368
Morteza Maleknia, Mostafa Shamsi
Publication date: 11 May 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01740-8
subdifferentialArmijo line searchgradient samplingsteepest descent directionnonsmooth and nonconvex optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (4)
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ A Gradient Sampling method based on Ideal direction for solving nonsmooth nonconvex optimization problems: convergence analysis and numerical experiments ⋮ Modified gradient sampling algorithm for nonsmooth semi-infinite programming ⋮ An adaptive gradient sampling algorithm for non-smooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Methods of descent for nondifferentiable optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Introduction to Nonsmooth Optimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Multicriteria Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Convex Analysis
- Benchmarking optimization software with performance profiles.
This page was built for publication: A gradient sampling method based on ideal direction for solving nonsmooth optimization problems