Open Access
October, 2018 A Modified Newton Method for Multilinear PageRank
Pei-Chang Guo, Shi-Chen Gao, Xiao-Xia Guo
Taiwanese J. Math. 22(5): 1161-1171 (October, 2018). DOI: 10.11650/tjm/180303

Abstract

When studying the multilinear PageRank problem, a system of polynomial equations needs to be solved. In this paper, we propose a modified Newton method and develop a monotone convergence theory for a third-order tensor when $\alpha \lt 1/2$. In this parameter regime, the sequence of vectors produced by the Newton-like method is monotonically increasing and converges to the solution. When $\alpha \gt 1/2$ we present an always-stochastic modified Newton iteration. Numerical results illustrate the effectiveness of this method.

Citation

Download Citation

Pei-Chang Guo. Shi-Chen Gao. Xiao-Xia Guo. "A Modified Newton Method for Multilinear PageRank." Taiwanese J. Math. 22 (5) 1161 - 1171, October, 2018. https://doi.org/10.11650/tjm/180303

Information

Received: 10 August 2017; Revised: 9 December 2017; Accepted: 15 March 2018; Published: October, 2018
First available in Project Euclid: 23 March 2018

zbMATH: 06965414
MathSciNet: MR3859371
Digital Object Identifier: 10.11650/tjm/180303

Subjects:
Primary: 65F30 , 65H10

Keywords: monotone convergence , multilinear PageRank , Newton-like method , tensor

Rights: Copyright © 2018 The Mathematical Society of the Republic of China

Vol.22 • No. 5 • October, 2018
Back to Top