Extended separating plane algorithm and NSO-solutions of pagerank problem

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