Information Technology and Systems 2015
An IITP RAS Interdisciplinary Conference & School
September, 7-11, Olympic Village, Sochi, Russia
ISBN: 978-5-901158-28-9

Russian | English










Troitskiy variant


Wednesday, September 9
14:30 - 15:30
Flagman 3
Session: Optimization and TransportData Science
Chair: Ph.D. Vladimir Spokoiny

Alexander Derendyaev
Traffic Speed Estimation By Mobile Operator Data Downoad paper
Abstract: A method for estimating the dynamics of urban traffic velocity with the data from the mobile operator is considered. A model allowing to calculate the approximate speed on road sections and to estimate congestion of these sections is proposed. The method is implemented on the GIS platform GeoTime 3. Experimental re-sults for the road network of Moscow city and Moscow region are discussed.

Alexey Bedrintsev, Vladimir Chepyzhov
Design Space Description Using Extremal Ellipsoids Downoad paper
Abstract: Problems of data set description and outliers detection are solved by constructing optimal ellipsoid. Optimization problems are formulated as convex programming problems using linear matrix inequalities. Proposed method is compared with similar known before methods in terms of two criteria: volume of ellipsoid and the number of points in train data set that lie beyond the ellipsoid.

Pavel Dvurechensky, Alexander Gasnikov
Stochastic Intermediate Gradient Method: Convex and Strongly Convex Cases Downoad paper
Abstract: In this paper we introduce new methods for convex optimization problems with inexact stochastic oracle. First method is an extension of the intermediate gradient method proposed by Devolder, Glineur and Nesterov for problems with inexact oracle. Our new method can be applied to the problems with composite structure, stochastic inexact oracle and allows using non-Euclidean setup. We prove estimates for mean rate of convergence and probabilities of large deviations from this rate. Also we introduce two modifications of this method for strongly convex problems. For the first modification we prove mean rate of convergence estimates and for the second we prove estimates for large deviations from the mean rate of convergence. All the rates give the complexity estimates for proposed methods which up to multiplicative constant coincide with lower complexity bound for the considered class of convex composite optimization problems with stochastic inexact oracle.