Pages that link to "Item:Q2414900"

The following pages link to Linear convergence of first order methods for non-strongly convex optimization (Q2414900):

Displaying 40 items.

• A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations (Q5020146) (← links)
• Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
• Exact gradient methods with memory (Q5058416) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• An Iterative Reduction FISTA Algorithm for Large-Scale LASSO (Q5088796) (← links)
• Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization (Q5097013) (← links)
• Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
• First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
• (Q5149264) (← links)
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization (Q5162590) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity (Q5231668) (← links)
• Accelerate stochastic subgradient method by leveraging local growth condition (Q5236746) (← links)
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
• Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity (Q6038639) (← links)
• A speed restart scheme for a dynamics with Hessian-driven damping (Q6086152) (← links)
• Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• A new Lagrangian-based first-order method for nonconvex constrained optimization (Q6106553) (← links)
• A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization (Q6116244) (← links)
• FISTA is an automatic geometrically optimized algorithm for strongly convex functions (Q6120847) (← links)
• Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
• A strict complementarity approach to error bound and sensitivity of solution of conic programs (Q6164955) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
• Variance reduced moving balls approximation method for smooth constrained minimization problems (Q6542460) (← links)
• Mini-batch stochastic subgradient for functional constrained optimization (Q6565290) (← links)
• Subgradient regularized multivariate convex regression at scale (Q6573015) (← links)
• MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization (Q6587341) (← links)
• Consensus-based optimization methods converge globally (Q6601205) (← links)
• Interpolation conditions for linear operators and applications to performance estimation problems (Q6601207) (← links)
• Distributed accelerated gradient methods with restart under quadratic growth condition (Q6607027) (← links)
• Acceleration and restart for the randomized Bregman-Kaczmarz method (Q6615435) (← 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)
• Lipschitz continuity of the metric projection operator and convergence of gradient methods (Q6639676) (← links)
• Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems (Q6644990) (← links)
• Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)