Pages that link to "Item:Q5237308"
From MaRDI portal
The following pages link to Convergence Rate of Incremental Gradient and Incremental Newton Methods (Q5237308):
Displaying 13 items.
- Rate of convergence of a generalization of Newton's method (Q1321393) (← links)
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization (Q2047203) (← links)
- Accelerating incremental gradient optimization with curvature information (Q2181597) (← links)
- Why random reshuffling beats stochastic gradient descent (Q2227529) (← links)
- A globally convergent incremental Newton method (Q2349125) (← links)
- (Q3692733) (← links)
- Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate (Q4641666) (← links)
- (Q5053196) (← links)
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms (Q5266533) (← links)
- Convergence rate of the gradient descent method with dilatation of the space (Q5655196) (← links)
- Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator (Q6126596) (← links)
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem (Q6586914) (← links)