Linear convergence of epsilon-subgradient descent methods for a class of convex functions
From MaRDI portal
Publication:1806023
Recommendations
- Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs
- Convergence of some algorithms for convex minimization
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- Publication:4723574
- Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
Cited in
(22)- Comparing different nonsmooth minimization methods and software
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- Randomized smoothing variance reduction method for large-scale non-smooth convex optimization
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- A coordinate gradient descent method for nonsmooth separable minimization
- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
- Convergence rates of subgradient methods for quasi-convex optimization problems
- scientific article; zbMATH DE number 7733428 (Why is no real title available?)
- Weak convexity and approximate subdifferentials
- On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
- Nomonotone spectral gradient method for sparse recovery
- Scaling techniques for \(\epsilon\)-subgradient methods
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- Subgradient and bundle methods for nonsmooth optimization
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems
This page was built for publication: Linear convergence of epsilon-subgradient descent methods for a class of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806023)
