Machine learning algorithms of relaxation subgradient method with space extension

DOI10.1007/978-3-030-77876-7_32MaRDI QIDQ2117655zbMATH OpenOpenAlexFDO

Authors Vladimir N. Krutikov, Vladimir V. Meshechkin, Elena S. Kagan, Lev A. Kazakovtsev

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-77876-7_32

zbMATH Keywords

relaxationsubgradient methodsspace extension

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Sublinear optimization for machine learning
• scientific article; zbMATH DE number 2000794
• scientific article; zbMATH DE number 1215260
• Alternating direction method of multipliers for machine learning
• A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
• Optimization problems for machine learning: a survey
• Non-convex optimization for machine learning
• scientific article; zbMATH DE number 4057291
• A Douglas-Rachford method for sparse extreme learning machine

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 3953655 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3559294 (Why is no real title available?)
• scientific article; zbMATH DE number 1983465 (Why is no real title available?)
• scientific article; zbMATH DE number 2000794 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Approximate level method for nonsmooth convex minimization
• Method of conjugate subgradients with constrained memory
• Minimization of unsmooth functionals
• New variants of bundle methods
• Nondifferentiable optimization and polynomial problems
• 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
• Universal method for stochastic composite optimization problems

Cited in

(4)

• Sublinear optimization for machine learning
• scientific article; zbMATH DE number 7656028 (Why is no real title available?)
• On the convergence rate of the subgradient method with metric variation and its applications in neural network approximation schemes
• scientific article; zbMATH DE number 2000794 (Why is no real title available?)

This page was built for publication: Machine learning algorithms of relaxation subgradient method with space extension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117655)