Abstract
The goal is to modify the known method of mirror descent (MD) in convex optimization, which having been proposed by Nemirovsky and Yudin in 1979 and generalized the standard gradient method. To start, the paper shows the idea of a new, so-called inertial MD method with the example of a deterministic optimization problem in continuous time. In particular, in the Euclidean case, the heavy ball method by Polyak is realized. It is noted that the new method does not use additional averaging of the points. Then, a discrete algorithm of inertial MD is described and the upper bound on error in objective function is proved. Finally, inertial MD randomized algorithm for finding a principal eigenvector of a given stochastic matrix (i.e., for solving a well known PageRank problem) is treated. Particular numerical example illustrates the general decrease of the error in time and corroborates theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
