Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Efficient Numerical Methods to Solve Spa...

Anikin, Anton...

Free

Share this content

Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank by Anikin, Anton ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	30-08-2015
Summary	In this paper, we propose three methods to solve the PageRank problem for the transition matrices with both row and column sparsity. Our methods reduce the PageRank problem to the convex optimization problem over the simplex. The first algorithm is based on the gradient descent in L1 norm instead of the Euclidean one. The second algorithm extends the Frank-Wolfe to support sparse gradient updates. The third algorithm stands for the mirror descent algorithm with a randomized projection. We proof converges rates for these methods for sparse problems as well as numerical experiments support their effectiveness.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.00
Total read	-
URL	https://arxiv.org/abs/1508.07607

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Anikin, Anton. Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank. N.A. August 30, 2015. Accessed August 16, 2025. https://online.provdatabase.com/cite/18927

APA 7th EditionReferences

Anikin, Anton. (2015). Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank. N.A. https://online.provdatabase.com/cite/18927

Chicago 17th EditionReferences

Anikin, Anton. Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank. N.A. 2015. https://online.provdatabase.com/cite/18927

HarvardReferences

Anikin, Anton. (2015). Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18927. (Accessed 16 August 2025).

Harvard AustraliaReferences

Anikin, Anton, 2015, Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank, N.A, viewed 16 August 2025, <https://online.provdatabase.com/cite/18927>

MLA 9th EditionWorks Cited

Anikin, Anton. Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/18927.

Share this eBook