A conjugate gradient sampling method for nonsmooth optimization
From MaRDI portal
Publication:2174178
DOI10.1007/S10288-019-00404-2zbMATH Open1442.90183OpenAlexW2942831104WikidataQ127912115 ScholiaQ127912115MaRDI QIDQ2174178FDOQ2174178
M. Shaeiri, Nezam Mahdavi-Amiri
Publication date: 21 April 2020
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-019-00404-2
Recommendations
- An adaptive gradient sampling algorithm for non-smooth optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- On the Convergence of a New Conjugate Gradient Algorithm
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Nonsmooth optimization via quasi-Newton methods
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Optimization of lipschitz continuous functions
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Conjugate Gradient Methods with Inexact Searches
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
- An adaptive gradient sampling algorithm for non-smooth optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
Cited In (9)
- Sampling Gaussian distributions in Krylov spaces with conjugate gradients
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Greedy Sampling Using Nonlinear Optimization
- 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 stochastic conjugate gradient method for the approximation of functions
- Prime sample scheme for almost sure convergence of a Galerkin approximation
- Auxiliary Gradient-Based Sampling Algorithms
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
Uses Software
This page was built for publication: A conjugate gradient sampling method for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174178)
