Extended separating plane algorithm and NSO-solutions of PageRank problem

DOI10.1007/978-3-319-44914-2_43zbMATH Open1392.90109OpenAlexW2557746186MaRDI QIDQ3133243FDOQ3133243

Evgeniya A. Vorontsova

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_43

Recommendations

• Regularization-based solution of the PageRank problem for large matrices
• Synthesis of cutting and separating planes in a nonsmooth optimization method
• Perron vector optimization applied to search engines
• Efficient numerical methods to solve sparse linear equations with application to PageRank
• An improved approach to the PageRank problems

zbMATH Keywords

nonsmooth convex optimizationsubgradient methodsPageRank problemblack-box minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10)

Cited In (3)

• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• Weak and Strong Compatibility in Data Fitting Problems Under Interval Uncertainty
• Maximum compatibility method for data fitting under interval uncertainty

This page was built for publication: Extended separating plane algorithm and NSO-solutions of PageRank problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133243)