An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
From MaRDI portal
Recommendations
Cited in
(49)- Incremental gradient algorithms with stepsizes bounded away from zero
- Error stability properties of generalized gradient-type algorithms
- Descent methods with linesearch in the presence of perturbations
- Convergence analysis of perturbed feasible descent methods
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
- An incremental subgradient method on Riemannian manifolds
- An incremental primal-dual method for nonlinear programming with special structure
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Incrementally updated gradient methods for constrained and regularized optimization
- Accelerating deep neural network training with inconsistent stochastic gradient descent
- On the linear convergence of the stochastic gradient method with constant step-size
- A globally convergent incremental Newton method
- Incremental accelerated gradient methods for SVM classification: study of the constrained approach
- Parallel stochastic gradient algorithms for large-scale matrix completion
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems
- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
- Global convergence of the Dai-Yuan conjugate gradient method with perturbations
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- A New Class of Incremental Gradient Methods for Least Squares Problems
- String-averaging incremental stochastic subgradient algorithms
- Stochastic primal-dual coordinate method for regularized empirical risk minimization
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- A smooth inexact penalty reformulation of convex problems with linear constraints
- A scaled incremental gradient method
- Minimizing finite sums with the stochastic average gradient
- Convergence rate of incremental gradient and incremental Newton methods
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- A merit function approach to the subgradient method with averaging
- Distributed stochastic inertial-accelerated methods with delayed derivatives for nonconvex problems
- Automatic, dynamic, and nearly optimal learning rate specification via local quadratic approximation
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
- Recent Theoretical Advances in Non-Convex Optimization
- Random algorithms for convex minimization problems
- Incremental proximal methods for large scale convex optimization
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- Learning to optimize by multi-gradient for multi-objective optimization
- Simultaneous incremental gradient method for inconsistent convex optimization problem
- Deep backward and Galerkin methods for the finite state master equation
- Robust inversion, dimensionality reduction, and randomized sampling
- Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
- Effectively leveraging momentum terms in stochastic line search frameworks for fast optimization of finite-sum problems
- Optimal bailout for systemic risk: a PGO approach based on neural network
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- A stochastic variational framework for fitting and diagnosing generalized linear mixed models
This page was built for publication: An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389203)
