Subsampled first-order optimization methods with applications in imaging
type: Item
instance of: scholarly article
title: Subsampled first-order optimization methods with applications in imaging
zbMATH Open document ID: 1548.90392
DOI: 10.1007/978-3-030-98661-2_78
author: Stefania Bellavia
author: Tommaso Bianconcini
author: Nataša Krejić
author: Benedetta Morini
publication date: 2024-09-16T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7914335
zbMATH Keywords: finite-sum minimization
zbMATH Keywords: first-order methods
zbMATH Keywords: stochastic gradient
zbMATH Keywords: neural networks
zbMATH Keywords: convolutional neural networks
zbMATH Keywords: image classification
MaRDI profile type: MaRDI publication profile
cites work: Neural Networks and Deep Learning
cites work: A Scaled Stochastic Approximation Algorithm
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Two-Point Step Size Gradient Methods
cites work: Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
cites work: Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
cites work: Subsampled inexact Newton methods for minimizing large sums of convex functions
cites work: Inexact restoration with subsampled trust-region methods for finite-sum minimization
cites work: An investigation of Newton-Sketch and subsampled Newton methods
cites work: Gradient Convergence in Gradient methods with Errors
cites work: Q5483032
cites work: On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors
cites work: Exact and inexact subsampled Newton methods for optimization
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: A stochastic quasi-Newton method for large-scale optimization
cites work: Sample size selection in optimization methods for machine learning
cites work: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
cites work: Stochastic optimization using a trust-region method and random models
cites work: Accelerated Stochastic Approximation
cites work: Hybrid deterministic-stochastic methods for data fitting
cites work: Q5270493
cites work: The elements of statistical learning. Data mining, inference, and prediction
cites work: Stochastic Estimation of the Maximum of a Regression Function
cites work: A gradient method for unconstrained optimization in noisy environment
cites work: Descent direction method with line search for unconstrained optimization in noisy environment
cites work: Numerical Optimization
cites work: Inexact restoration approach for minimization with inexact evaluation of the objective function
cites work: Line search methods with variable sample size for unconstrained optimization
cites work: Nonmonotone line search methods with variable sample size
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: On the behavior of the gradient norm in the steepest descent method
cites work: A Stochastic Line Search Method with Expected Complexity Analysis
cites work: Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
cites work: Efficient sample sizes in stochastic nonlinear programming
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: Q3408861
cites work: Sub-sampled Newton methods
cites work: A Stochastic Approximation Method
cites work: Learning representations by back-propagating errors
cites work: Minimizing finite sums with the stochastic average gradient
cites work: Introduction to Stochastic Search and Optimization
cites work: Q4611648
cites work: Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
cites work: An Introduction to Matrix Concentration Inequalities
cites work: On stochastic gradient and subgradient methods with adaptive steplength sequences
cites work: New stochastic approximation algorithms with adaptive step sizes
cites work: Newton-type methods for non-convex optimization under inexact Hessian information
description: scientific article; zbMATH DE number 7914335