On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q112880240, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rate of the randomized Kaczmarz method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On greedy randomized coordinate descent methods for solving large linear least‐squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Theoretical Estimate for the Convergence Rate of the Maximal Weighted Residual Kaczmarz Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Methods for Linear Constraints: Convergence Rates and Conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variant of greedy randomized Kaczmarz for ridge regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity analysis of randomized block-coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random block coordinate descent methods for linearly constrained optimization over networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized Kaczmarz algorithm with exponential convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy Kaczmarz algorithm for the solution of very large linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Extended Kaczmarz for Solving Least Squares / rank
 
Normal rank

Latest revision as of 07:25, 23 July 2024

scientific article
Language Label Description Also known as
English
On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
scientific article

    Statements

    On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (English)
    0 references
    0 references
    0 references
    17 August 2020
    0 references
    linear least-squares problem
    0 references
    greedy randomized coordinate descent
    0 references
    relaxation technique
    0 references
    0 references

    Identifiers