Flighted transport models occupy a special place among the problems of mathematical programming. With granular approach to their solution, describing the elementary acts of administrative activity, there arises the problem of the extremum of algorithmic functions on the set of algorithmic...

A new nonmonotone algorithm is proposed and analyzed for unconstrained nonlinear optimization. The nonmonotone techniques applied in this algorithm are based on the estimate sequence proposed by Nesterov (Introductory Lectures on Convex Optimization: A Basic Course, <CitationRef CitationID="CR13">2004</CitationRef>) for convex...</citationref>

In this paper, we develop new methods for approximating dominant eigenvector of column-stochastic matrices. We analyze the Google matrix, and present an averaging scheme with linear rate of convergence in terms of 1-norm distance. For extending this convergence result onto general case, we...