Pages that link to "Item:Q1675251"

The following pages link to From error bounds to the complexity of first-order descent methods for convex functions (Q1675251):

Displaying 26 items.

• Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems (Q6136656) (← links)
• On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds (Q6151598) (← links)
• Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis (Q6158000) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)
• Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (Q6168888) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• On optimal universal first-order methods for minimizing heterogeneous sums (Q6191975) (← links)
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
• Stochastic differential equations for modeling first order optimization methods (Q6490316) (← links)
• Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
• Single-projection procedure for infinite dimensional convex optimization problems (Q6542543) (← links)
• The level-set subdifferential error bound via Moreau envelopes (Q6561484) (← links)
• A subgradient method with constant step-size for \(\ell_1\)-composite optimization (Q6564822) (← links)
• Optimal convergence rate of inertial gradient system with flat geometries and perturbations (Q6569359) (← links)
• Subgradient regularized multivariate convex regression at scale (Q6573015) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
• Consensus-based optimization methods converge globally (Q6601205) (← links)
• Distributed accelerated gradient methods with restart under quadratic growth condition (Q6607027) (← links)
• Parameter-free FISTA by adaptive restart and backtracking (Q6622751) (← links)
• The exact worst-case convergence rate of the alternating direction method of multipliers (Q6634526) (← links)
• Strong convergence of the composition of firmly nonexpansive mappings (Q6635810) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
• Variance reduction techniques for stochastic proximal point algorithms (Q6644264) (← links)
• Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems (Q6644990) (← links)
• Kurdyka-Łojasiewicz exponent via Hadamard parametrization (Q6663111) (← links)