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

DOI10.1007/S12190-022-01800-4zbMATH Open1518.90074MaRDI QIDQ6138300FDOQ6138300

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

• A stochastic quasi-Newton method for large-scale optimization
• A Stochastic Approximation Method
• Robust Stochastic Approximation Approach to Stochastic Programming
• Title not available (Why is that?)
• Probability
• Accelerated, Parallel, and Proximal Coordinate Descent
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• New quasi-Newton equation and related methods for unconstrained optimization
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Convergence analysis of a modified BFGS method on convex minimizations
• Large-Scale Machine Learning with Stochastic Gradient Descent
• Minimizing finite sums with the stochastic average gradient
• Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
• IQN: An Incremental Quasi-Newton Method with Local Superlinear Convergence Rate

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)