Optimization on a finer scale: bounded local subgradient variation perspective
From MaRDI portal
Cites work
- ``Efficient subgradient methods for general convex optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Error bounds in mathematical programming
- First-order methods of smooth convex optimization with inexact oracle
- Foundations of Data Science
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 447275 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Lower bounds for finding stationary points II: first-order methods
- Lower bounds for parallel and randomized convex optimization
- Modern nonconvex nondifferentiable optimization
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- Nonsmooth optimization and its applications. Based on the workshop ``Nonsmooth Optimization and its Applications, Bonn, Germany, May 15--19, 2017
- On functions of bounded mean oscillation
- On lower complexity bounds for large-scale smooth convex optimization
- On optimal universal first-order methods for minimizing heterogeneous sums
- On parallel complexity of nonsmooth convex optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximité et dualité dans un espace hilbertien
- Radial subgradient method
- Random gradient-free minimization of convex functions
- Randomized smoothing for stochastic optimization
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Sur les expressions asymptotiques de certaines fonctions, définies par les équations différentielles linéaires du second ordre, et leurs applications au problème du développement d'une fonction arbitraire en séries procédant suivant lesdites fonct
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- The approximate duality gap technique: a unified theory of first-order methods
- The cost of nonconvexity in deterministic nonsmooth optimization
- Universal gradient methods for convex optimization problems
- Universal method for stochastic composite optimization problems
- Über partielle und totale Differenzierbarkeit von Funktionen mehrerer Variablen und über die Transformation der Doppelintegrale. I, II.
This page was built for publication: Optimization on a finer scale: bounded local subgradient variation perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846087)
