Machine learning algorithms of relaxation subgradient method with space extension
From MaRDI portal
Publication:2117655
DOI10.1007/978-3-030-77876-7_32zbMath1489.90120OpenAlexW3170092489MaRDI QIDQ2117655
Elena S. Kagan, Vladimir V. Meshechkin, Lev A. Kazakovtsev, Vladimir N. Krutikov
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_32
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate level method for nonsmooth convex minimization
- Method of conjugate subgradients with constrained memory
- Nondifferentiable optimization and polynomial problems
- Universal method for stochastic composite optimization problems
- New variants of bundle methods
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
- Online Learning and Online Convex Optimization
- The conjugate gradient method in extremal problems
- Minimization of unsmooth functionals
This page was built for publication: Machine learning algorithms of relaxation subgradient method with space extension
