Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
From MaRDI portal
Publication:3503200
DOI10.1137/050639673zbMath1149.65043MaRDI QIDQ3503200
Publication date: 22 May 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://rcin.org.pl/dlibra/docmetadata?showContent=true&id=139664
convergence; nonsmooth optimization; subgradient; nonconvex; generalized gradient; gradient sampling
Related Items
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 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, A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles, Manifold Sampling for $\ell_1$ Nonconvex Optimization, Essentials of numerical nonsmooth optimization, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Nonsmooth optimization via quasi-Newton methods, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, An adaptive competitive penalty method for nonsmooth constrained optimization, Smoothing methods for nonsmooth, nonconvex minimization, 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, 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, Convergence of the gradient sampling algorithm on directionally Lipschitz functions, A conjugate gradient sampling method for nonsmooth optimization, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, On the differentiability check in gradient sampling methods, An adaptive gradient sampling algorithm for non-smooth optimization, A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds, A new trust region method for nonsmooth nonconvex optimization, An extension of the quasi-Newton method for minimizing locally Lipschitz functions
