Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
From MaRDI portal
Publication:3503200
DOI10.1137/050639673zbMath1149.65043OpenAlexW2071634839MaRDI 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
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, A gradient sampling method based on ideal direction for solving nonsmooth optimization problems, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, A new trust region method for nonsmooth nonconvex optimization, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization, Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components, A conjugate gradient sampling method for nonsmooth optimization, Nonsmooth optimization via quasi-Newton methods, An extension of the quasi-Newton method for minimizing locally Lipschitz functions, On the local convergence analysis of the gradient sampling method for finite max-functions, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, Multifidelity Robust Controller Design with Gradient Sampling, A gradient sampling algorithm for stratified maps with applications to topological data analysis, An effective nonsmooth optimization algorithm for locally Lipschitz functions, A hierarchy of spectral relaxations for polynomial optimization, Nonsmooth spectral gradient methods for unconstrained optimization, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, A new nonmonotone line search method for nonsmooth nonconvex optimization, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds, Stochastic absolute value equations, A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, An adaptive competitive penalty method for nonsmooth constrained optimization, A fast gradient and function sampling method for finite-max functions, Numerical investigation of Crouzeix's conjecture, Smoothing methods for nonsmooth, nonconvex minimization, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, Essentials of numerical nonsmooth optimization, On the differentiability check in gradient sampling methods, Convergence of the gradient sampling algorithm on directionally Lipschitz 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, Manifold Sampling for $\ell_1$ Nonconvex Optimization, Weak subgradient method for solving nonsmooth nonconvex optimization problems, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Essentials of numerical nonsmooth optimization, An adaptive gradient sampling algorithm for non-smooth optimization, A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles, An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
