Sub-sampled Newton methods
type: Item
instance of: scholarly article
title: Sub-sampled Newton methods
zbMATH Open document ID: 1412.49059
author: Farbod Roosta-Khorasani
author: Michael W. Mahoney
published in: Mathematical Programming. Series A. Series B
publication date: 2019-04-24T00:00:00Z
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 7047593
zbMATH Keywords: Newton-type methods
zbMATH Keywords: local and global convergence
zbMATH Keywords: sub-sampling
MaRDI profile type: Publication
full work available at URL: s10107-018-1346-5
OpenAlex ID: W2900789157
cites work: Q4637040
cites work: An investigation of Newton-Sketch and subsampled Newton methods
cites work: Q3151174
cites work: Q3102800
cites work: Exact and inexact subsampled Newton methods for optimization
cites work: Q4821526
cites work: On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning
cites work: Sample size selection in optimization methods for machine learning
cites work: An inexact successive quadratic approximation method for L-1 regularized optimization
cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
cites work: Uniform Sampling for Matrix Approximation
cites work: Trust Region Methods
cites work: Inexact Newton Methods
cites work: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
cites work: Choosing the Forcing Terms in an Inexact Newton Method
cites work: Hybrid deterministic-stochastic methods for data fitting
cites work: Some bounds on the complexity of gradients, Jacobians, and Hessians
cites work: Pseudoinversus and conjugate gradients
cites work: Q3881429
cites work: Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds
cites work: Proximal Newton-Type Methods for Minimizing Composite Functions
cites work: Randomized Algorithms for Matrices and Data
cites work: Q3998435
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Cubic regularization of Newton method and its global performance
cites work: Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
cites work: Stochastic Algorithms for Inverse Problems Involving PDEs and many Measurements
cites work: Assessing Stochastic Algorithms for Large Scale Nonlinear Least Squares Problems Using Extremal Probabilities of Linear Combinations of Gamma Random Variables
cites work: IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
cites work: User-friendly tail bounds for sums of random matrices
cites work: Subsampled Hessian Newton Methods for Supervised Learning
DOI: 10.1007/S10107-018-1346-5
description: scientific article; zbMATH DE number 7047593