Distinguished Visiting Professor Arkadi Nemirovski

General Information

Prof. Nemirovski's second and third degrees (Moscow University) were in Functional Analysis; his Russian D.Sc. degree (Kiev Institute of Cybernetic) was on Complexity and efficient algorithms in Convex Programming. During his Russian period, he occupied research positions in Moscow Research institutions; since his alya in 1993, he is at the Faculty of Industrial Engineering at Technion. Prof. Nemirovski has held visiting positions at INRIA, France, and at Technion.

Research Summary

Prof. Nemirovski's research work is mainly in the area of Convex Programming, with emphasis on investigating complexity and on design of theoretically optimal algorithms. He was among the first to develop Information-Based Complexity Theory of Convex Optimization, with such byproducts as the Ellipsoid method (Nemirovski and Yudin, 1976) underlying the majority of modern results on efficient solvability of well-structured convex programs, e.g., on polynomial solvability of Linear Programming (Khachiyan, 1979). Prof. Nemirovski is also involved in research in Nonparametric Statistics, with emphasis on theoretically efficient robust methods for restoring noisy signals and 2D images. The focus of Prof. Nemirovski's work in recent years is in the theory and algorithmic implementation of interior point polynomial time methods for Convex Optimization; these methods are thought to be the most promising tool for large-scale convex programs. Jointly with Yu. Nesterov, he developed general theory of polynomial time interior point methods along with applications of the theory to Quadratic Quadratically Constrained, Semidefinite, Geometric Programming, etc. He participates in several projects aimed to implement the interior point algorithms in Structural Design and Robust Control. Part of these projects are carried out in the Optimization Laboratory of the Faculty.

Prof. Nemirovski is currently Associated Editor of the journal Mathematics of Operations Research. He received Fulkerson Prize from the Mathematical Programming Society and the American Mathematical Society for developing the Ellipsoid algorithm (1982; jointly with L.Khachiyan and D. Yudin) and Dantzig Prize from the Mathematical Programming Society and the American Society for Industrial and Applied Mathematics for his contributions to the area of Convex Optimization (1991; jointly with M. Grotschel).

Current Research Projects

• Interior point polynomial time methods for Semidefinite Programming with applications to Robust Control

• Optimal design of engineering structures

• Image processing with applications to Tomography

Selected Publications