Skip to main navigation
Skip to search
Skip to main content
KAUST FACULTY PORTAL Home
Home
Profiles
Research units
Research output
Press/Media
Prizes
Courses
Equipment
Student theses
Datasets
Search by expertise, name or affiliation
Coordinate descent with arbitrary sampling I: algorithms and complexity†
Zheng Qu,
Peter Richtárik
Research output
:
Contribution to journal
›
Article
›
peer-review
51
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Coordinate descent with arbitrary sampling I: algorithms and complexity†'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Arbitrary Sampling
100%
Coordinate Descent
100%
Coordinate Descent Method
66%
Importance Sampling
33%
Regularizer
33%
Complexity Analysis
33%
Arbitrary Distribution
33%
Gradient Descent
33%
Iterative Update
33%
Complexity Bounds
33%
Convex Function
33%
Parallel Coordinate Descent
33%
Randomized Coordinate Descent
33%
Randomized Methods
33%
Deterministic Method
33%
Flexible Algorithms
33%
Mathematics
Importance Sampling
100%
Arbitrary Distribution
100%
Parallel Coordinate
100%
Random Subset
100%
Convex Function
100%
Computer Science
Gradient Descent
100%
Complexity Analysis
100%
Convex Function
100%
Importance Sampling
100%