A conjugate gradient sampling method for nonsmooth optimization
From MaRDI portal
Publication:2174178
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
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Benchmarking optimization software with performance profiles.
- Conjugate Gradient Methods with Inexact Searches
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Identifying structure of nonsmooth convex functions by the bundle technique
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonsmooth optimization via quasi-Newton methods
- On the Convergence of a New Conjugate Gradient Algorithm
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Proximal quasi-Newton methods for nondifferentiable convex optimization
Cited in
(12)- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- Auxiliary Gradient-Based Sampling Algorithms
- Greedy Sampling Using Nonlinear Optimization
- A stochastic conjugate gradient method for the approximation of functions
- Sampling Gaussian distributions in Krylov spaces with conjugate gradients
- 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 quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Prime sample scheme for almost sure convergence of a Galerkin approximation
- A gradient sampling method on algebraic varieties and application to nonsmooth low-rank optimization
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
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)
