Pages that link to "Item:Q2354453"
From MaRDI portal
The following pages link to On efficient randomized algorithms for finding the PageRank vector (Q2354453):
Displaying 4 items.
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints (Q1683173) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities (Q6552619) (← links)
