Pages that link to "Item:Q2752037"

The following pages link to Convergence rate of incremental subgradient algorithms (Q2752037):

Displaying 49 items.

• A stochastic quasi-Newton method for large-scale optimization (Q121136) (← links)
• New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
• Subgradient methods for huge-scale optimization problems (Q403646) (← links)
• On stochastic gradient and subgradient methods with adaptive steplength sequences (Q445032) (← links)
• Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
• Distributed stochastic subgradient projection algorithms for convex optimization (Q620442) (← links)
• Incremental proximal methods for large scale convex optimization (Q644913) (← links)
• Discrete-time gradient flows and law of large numbers in Alexandrov spaces (Q745561) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• Strong law of large numbers for the \(L^1\)-Karcher mean (Q785879) (← links)
• Subgradient methods for saddle-point problems (Q1035898) (← links)
• Incremental gradient algorithms with stepsizes bounded away from zero (Q1273418) (← links)
• An incremental subgradient method on Riemannian manifolds (Q1752648) (← links)
• An optimal randomized incremental gradient method (Q1785198) (← links)
• Modified Fejér sequences and applications (Q1790672) (← links)
• The effect of deterministic noise in subgradient methods (Q1960191) (← links)
• Analysis of biased stochastic gradient descent using sequential semidefinite programs (Q2020610) (← links)
• Randomized smoothing variance reduction method for large-scale non-smooth convex optimization (Q2033403) (← links)
• Inexact first-order primal-dual algorithms (Q2181598) (← links)
• Bridging the gap between constant step size stochastic gradient descent and Markov chains (Q2196224) (← links)
• Why random reshuffling beats stochastic gradient descent (Q2227529) (← links)
• Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
• Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
• Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
• A globally convergent incremental Newton method (Q2349125) (← links)
• Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
• A subgradient method with non-monotone line search (Q2696908) (← links)
• Incremental subgradient methods for nondifferentiable optimization (Q2784405) (← links)
• Stochastic first-order methods with random constraint projection (Q2796796) (← links)
• Hybrid deterministic-stochastic methods for data fitting (Q2909270) (← links)
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems (Q3586129) (← links)
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094) (← links)
• A robust multi-batch L-BFGS method for machine learning (Q4972551) (← links)
• Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
• Subgradient method with feasible inexact projections for constrained convex optimization problems (Q5045169) (← links)
• (Q5053196) (← links)
• Rate of convergence of the Nesterov accelerated gradient method in the subcritical case <i>α</i> ≤ 3 (Q5107904) (← links)
• Analysis of the BFGS Method with Errors (Q5210518) (← links)
• Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
• Path-based incremental target level algorithm on Riemannian manifolds (Q5221271) (← links)
• Convergence Rate of Incremental Gradient and Incremental Newton Methods (Q5237308) (← links)
• On the Convergence Rate of Incremental Aggregated Gradient Algorithms (Q5266533) (← links)
• Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs (Q5857298) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
• A trust region method for noisy unconstrained optimization (Q6052069) (← links)
• A review of decentralized optimization focused on information flows of decomposition algorithms (Q6164389) (← links)
• Stochastic algorithms with geometric step decay converge linearly on sharp functions (Q6608032) (← links)
• Strong law of large numbers for generalized operator means (Q6633103) (← links)