Pages that link to "Item:Q4641660"

The following pages link to Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660):

Displaying 20 items.

• Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems (Q2046311) (← links)
• Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization (Q2047203) (← links)
• Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
• Accelerating incremental gradient optimization with curvature information (Q2181597) (← links)
• Linear convergence of cyclic SAGA (Q2193004) (← links)
• Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
• An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems (Q2226322) (← links)
• Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
• Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
• Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate (Q4641666) (← links)
• Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
• On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis (Q5107212) (← links)
• A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm (Q5220423) (← links)
• Convergence Rate of Incremental Gradient and Incremental Newton Methods (Q5237308) (← links)
• Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems (Q5865360) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• An asynchronous subgradient-proximal method for solving additive convex optimization problems (Q6093360) (← links)
• A distributed proximal gradient method with time-varying delays for solving additive convex optimizations (Q6110428) (← links)
• Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator (Q6126596) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)