Gradient sampling algorithm for subsmooth functions
From MaRDI portal
Cites work
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A space quantization method for numerical integration
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Approximating Subdifferentials by Random Sampling of Gradients
- Bi-level strategies in semi-infinite programming.
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Derivative-free optimization methods
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Foundations of bilevel programming
- Foundations of quantization for probability distributions
- Functional analysis, calculus of variations and optimal control
- Generalized optimistic methods for convex-concave saddle point problems
- Gradient sampling methods for nonsmooth optimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3805870 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Introduction to global optimization.
- Lectures on convex optimization
- Markov Chains and Stochastic Stability
- Methods of descent for nondifferentiable optimization
- Modern nonconvex nondifferentiable optimization
- Nonconvex robust optimization for problems with constraints
- Nonlinear robust optimization via sequential convex bilevel programming
- Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
- Nonsmooth optimization via quasi-Newton methods
- Nonsmooth variants of Powell's BFGS convergence theorem
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical probability. An introduction with applications to finance
- On the differentiability check in gradient sampling methods
- Optimization of lipschitz continuous functions
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Quantifying distributional model risk via optimal transport
- Robust optimization for unconstrained simulation-based problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Smoothing methods for nonsmooth, nonconvex minimization
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic model-based minimization of weakly convex functions
- Subgradient methods for saddle-point problems
- Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization
- Variational Analysis
This page was built for publication: Gradient sampling algorithm for subsmooth functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349298)
