Pages that link to "Item:Q2174178"
From MaRDI portal
The following pages link to A conjugate gradient sampling method for nonsmooth optimization (Q2174178):
Displaying 10 items.
- A stochastic conjugate gradient method for the approximation of functions (Q765306) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- Prime sample scheme for almost sure convergence of a Galerkin approximation (Q1179376) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
- Sampling Gaussian distributions in Krylov spaces with conjugate gradients (Q2909297) (← links)
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3503200) (← links)
- Auxiliary Gradient-Based Sampling Algorithms (Q4962088) (← links)
- Greedy Sampling Using Nonlinear Optimization (Q4983099) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
