Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
From MaRDI portal
Recommendations
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A conjugate gradient sampling method for nonsmooth optimization
- Subgradient Sampling for Nonsmooth Nonconvex Minimization
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- Non-asymptotic guarantees for sampling by stochastic gradient descent
- An adaptive gradient sampling algorithm for non-smooth optimization
- Convergence rates for the stochastic gradient descent method for non-convex objective functions
- A subgradient method based on gradient sampling for solving convex optimization problems
- On the local convergence analysis of the gradient sampling method for finite max-functions
Cited in
(65)- On the local convergence analysis of the gradient sampling method for finite max-functions
- Nonsmooth spectral gradient methods for unconstrained optimization
- A fast gradient and function sampling method for finite-max functions
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Numerical investigation of Crouzeix's conjecture
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- A conjugate gradient sampling method for nonsmooth optimization
- Non-asymptotic guarantees for sampling by stochastic gradient descent
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- Stochastic absolute value equations
- On the differentiability check in gradient sampling methods
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A new trust region method for nonsmooth nonconvex optimization
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- Nonsmooth optimization via quasi-Newton methods
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A new sequential optimality condition for constrained nonsmooth optimization
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- A gradient sampling method on algebraic varieties and application to nonsmooth low-rank optimization
- A splitting bundle approach for non-smooth non-convex minimization
- An adaptive competitive penalty method for nonsmooth constrained optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Manifold sampling for _1 nonconvex optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Essentials of numerical nonsmooth optimization
- Essentials of numerical nonsmooth optimization
- Multifidelity Robust Controller Design with Gradient Sampling
- Sharp global convergence guarantees for iterative nonconvex optimization with random data
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- A hierarchy of spectral relaxations for polynomial optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- A note on the convergence of deterministic gradient sampling in nonsmooth optimization
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems
- Inexact reduced gradient methods in nonconvex optimization
- Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- Bundle trust region algorithm based on linear subproblem
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- A constraint dissolving approach for nonsmooth optimization over the Stiefel manifold
- Smoothing methods for nonsmooth, nonconvex minimization
- Zeroth-order gradient and quasi-Newton methods for nonsmooth nonconvex stochastic optimization
- Structured nonsmooth optimization using functional encoding and branching information
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
This page was built for publication: Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503200)
