Pages that link to "Item:Q3169111"

The following pages link to Randomized Methods for Linear Constraints: Convergence Rates and Conditioning (Q3169111):

Displaying 50 items.

• Parallel coordinate descent methods for big data optimization (Q263212) (← links)
• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• Greedy and randomized versions of the multiplicative Schwarz method (Q445816) (← links)
• A stochastic Kaczmarz algorithm for network tomography (Q462380) (← links)
• Two-subspace projection method for coherent overdetermined systems (Q485132) (← links)
• Randomized block Kaczmarz method with projection for solving least squares (Q491121) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• Schwarz iterative methods: infinite space splittings (Q530579) (← links)
• Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
• Block Kaczmarz method with inequalities (Q890093) (← links)
• On the relation between the randomized extended Kaczmarz algorithm and coordinate descent (Q906948) (← links)
• Metric subregularity and the proximal point method (Q1034588) (← links)
• Linear convergence of the randomized sparse Kaczmarz method (Q1717238) (← links)
• Almost sure convergence of the Kaczmarz algorithm with random measurements (Q1934652) (← links)
• A geometric probability randomized Kaczmarz method for large scale linear systems (Q1995943) (← links)
• On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
• New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
• A new randomized Gauss-Seidel method for solving linear least-squares problems (Q2021500) (← links)
• Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
• On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
• Randomized double and triple Kaczmarz for solving extended normal equations (Q2041936) (← links)
• On the regularization effect of stochastic gradient descent applied to least-squares (Q2055514) (← links)
• On the generally randomized extended Gauss-Seidel method (Q2058411) (← links)
• On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem (Q2060942) (← links)
• Gauss-Seidel method with oblique direction (Q2063282) (← links)
• On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems (Q2066187) (← links)
• On relaxed greedy randomized iterative methods for the solution of factorized linear systems (Q2083243) (← links)
• Cyclic coordinate descent in the Hölder smooth setting (Q2084003) (← links)
• Quantum relaxed row and column iteration methods based on block-encoding (Q2101221) (← links)
• On a fast deterministic block Kaczmarz method for solving large-scale linear systems (Q2116037) (← links)
• A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems (Q2127524) (← links)
• Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
• Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
• On greedy randomized average block Kaczmarz method for solving large linear systems (Q2146339) (← links)
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
• On the relaxed greedy deterministic row and column iterative methods (Q2161834) (← links)
• A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
• Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem (Q2176283) (← links)
• A greedy block Kaczmarz algorithm for solving large-scale linear systems (Q2176512) (← links)
• On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631) (← links)
• A note on convergence rate of randomized Kaczmarz method (Q2198192) (← links)
• Optimization for deep learning: an overview (Q2218095) (← links)
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
• On convergence rate of the randomized Gauss-Seidel method (Q2228499) (← links)
• An extended row and column method for solving linear systems on a quantum computer (Q2239636) (← links)
• A doubly stochastic block Gauss-Seidel algorithm for solving linear equations (Q2243348) (← links)
• A refinement of an iterative orthogonal projection method (Q2279843) (← links)
• On the error estimate of the randomized double block Kaczmarz method (Q2287617) (← links)
• Projected randomized Kaczmarz methods (Q2297173) (← links)
• Variant of greedy randomized Kaczmarz for ridge regression (Q2311776) (← links)