Extended separating plane algorithm and NSO-solutions of pagerank problem

Abstract

The separating plane method with additional clippings and stockpiling (SPACLIP-S) for nonsmooth optimization is proposed in this paper. Both the theoretical and experimental investigations of the method showed that this method is efficient and widely applicable to nonsmooth optimization problems with convex objective functions. Computational experiments demonstrated a rather high performance of SPACLIP-S when applied to the Web page ranking problem. Web page ranking approach is widely used by search engines such as Google and Yandex to order Web pages. Page ranking problem is one of the most important problems in information retrivial due to wide range of applications. In this paper an iterative regularization method with a new penalty function for solving PageRank problem is also presented. Finally, experimental results of comparison of SPACLIP-S and other algorithms for solving test PageRank problems are provided.