A modified stochastic quasi-Newton algorithm for summing functions problem in machine learning

DOI10.1007/S12190-022-01800-4MaRDI QIDQ6138300zbMATH OpenFDO

Authors Xiaoxuan Chen, Haishan Feng

Publication date 5 September 2023

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

machine learningmini-batch settingSQN method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites work

• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• A Stochastic Approximation Method
• A stochastic quasi-Newton method for large-scale optimization
• Accelerated, parallel, and proximal coordinate descent
• Convergence analysis of a modified BFGS method on convex minimizations
• IQN: an incremental quasi-Newton method with local superlinear convergence rate
• Large-scale machine learning with stochastic gradient descent
• Minimizing finite sums with the stochastic average gradient
• New quasi-Newton equation and related methods for unconstrained optimization
• Probability. Theory and examples.
• Robust Stochastic Approximation Approach to Stochastic Programming
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization

Cited in

(1)

• A quasi-Newton approach to nonsmooth convex optimization problems in machine learning

This page was built for publication: A modified stochastic quasi-Newton algorithm for summing functions problem in machine learning

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