A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
DOI10.1007/S10957-020-01740-8zbMATH Open1467.90042OpenAlexW3081934664MaRDI QIDQ831368FDOQ831368
Authors: Morteza Maleknia, M. 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
Recommendations
- An adaptive gradient sampling algorithm for non-smooth optimization
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A conjugate gradient sampling method for nonsmooth optimization
- On the local convergence analysis of the gradient sampling method for finite max-functions
subdifferentialArmijo line searchgradient samplingsteepest descent directionnonsmooth and nonconvex optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Convex Analysis
- Methods of descent for nondifferentiable optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- 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
Cited In (9)
- 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
- 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 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
- A note on the convergence of deterministic gradient sampling in nonsmooth optimization
- A conjugate gradient sampling method for nonsmooth optimization
Uses Software
This page was built for publication: A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831368)
