scientific article; zbMATH DE number 7572479
From MaRDI portal
Publication:5096506
Yiyuan Cheng, Xingxing Zha, Yongquan Zhang
Publication date: 17 August 2022
Full work available at URL: http://121.43.60.238/sxwlxbA/EN/abstract/abstract16510.shtml
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Generalized linear models (logistic models) (62J12) Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20)
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Subgradient methods for huge-scale optimization problems
- An optimal method for stochastic composite optimization
- Pegasos: primal estimated sub-gradient solver for SVM
- Iteration-complexity of first-order penalty methods for convex programming
- Incrementally updated gradient methods for constrained and regularized optimization
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Acceleration of Stochastic Approximation by Averaging
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- A Stochastic Approximation Method
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
This page was built for publication:
