Inexact subgradient methods for semialgebraic functions
From MaRDI portal
Cites work
- Algorithms for stochastic optimization with function or expectation constraints
- Analysis of recursive stochastic algorithms
- Asymptotic Behavior of a Markovian Stochastic Algorithm with Constant Step
- Asymptotic bias of stochastic gradient search
- Clarke Subgradients of Stratifiable Functions
- Compressed sensing
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Constant step stochastic approximations involving differential inclusions: stability, long-run convergence and applications
- Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
- Error stability properties of generalized gradient-type algorithms
- From error bounds to the complexity of first-order descent methods for convex functions
- Handbook of computational statistics. Concepts and methods.
- scientific article; zbMATH DE number 3675226 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 41285 (Why is no real title available?)
- scientific article; zbMATH DE number 1160037 (Why is no real title available?)
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- scientific article; zbMATH DE number 2143180 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6936843 (Why is no real title available?)
- Infinite dimensional analysis. A hitchhiker's guide.
- Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
- Lyapunov stability of the subgradient method with constant step size
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- Online sequential optimization with biased gradients: theory and applications to censored demand
- Openness, Hölder metric regularity, and Hölder continuity properties of semialgebraic set-valued maps
- Optimization and nonsmooth analysis
- Perturbations of set-valued dynamical systems, with applications to game theory
- Proximal splitting methods in signal processing
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Recursive algorithms, urn processes and chaining number of chain recurrent sets
- Robust optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Stochastic approximation beyond gradient for signal processing and machine learning
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- Stochastic Approximations and Differential Inclusions
- Stochastic approximations with constant step size and differential inclusions
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
- stochastic quasigradient methods and their application to system optimization†
- Stochastic subgradient method converges on tame functions
- Subgradient Sampling for Nonsmooth Nonconvex Minimization
- Survey of Bundle Methods for Nonsmooth Optimization
- The effect of deterministic noise in subgradient methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
This page was built for publication: Inexact subgradient methods for semialgebraic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349065)
