Arkadi Nemirovski
This biography of a living person needs additional citations for verification. (February 2012) (Learn how and when to remove this template message)

Arkadi Nemirovski  

Born 
Moscow, Russia 
March 14, 1947
Alma mater 
Moscow State University (M.Sc 1970 & Ph.D 1973) Kiev Institute of Cybernetics 
Known for 
Ellipsoid method Robust optimization Interior point method 
Awards 
Fulkerson Prize (1982) Dantzig Prize (1991)^{[1]} John von Neumann Theory Prize (2003)^{[2]} 
Scientific career  
Institutions 
Georgia Institute of Technology Technion – Israel Institute of Technology 
Arkadi Nemirovski (born March 14, 1947) is a professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology.^{[3]} He has been a leader in continuous optimization and is best known for his work on the ellipsoid method, modern interiorpoint methods and robust optimization.^{[4]}
Biography
Arkadi Nemirovski earned the Ph.D. in Mathematics (1974) from Moscow State University and the Doctor of Sciences in Mathematics (1990) from the Institute of Cybernetics of the Ukrainian Academy of Sciences, Kiev. He has won three prestigious prizes: Fulkerson, Dantzig, and von Neumann (2003).^{[5]} He was elected to the U.S. National Academy of Engineering (NAE) in 2017 "for the development of efficient algorithms for largescale convex optimization problems." ^{[6]}
Academic work
His work with Yurii Nesterov in the 1994 book^{[7]} is the first to point out that interior point method can solve convex optimization problems, and the first to make a systematic study of semidefinite programming (SDP). Also in this book, they introduced the selfconcordant functions which are useful in the analysis of Newton's method.^{[8]}
Books
 coauthored with Yurii Nesterov: InteriorPoint Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics. 1994. ISBN 9780898715156.
 coauthored with A. BenTal: Lectures on Modern Convex Optimization. Society for Industrial and Applied Mathematics. 2001. ISBN 9780898714913.^{[9]}
 coauthored with A. BenTal and L. El Ghaoui: Robust Optimization. Princeton University Press. 2009. ISBN 9780691143682.
References
 ^ "The George B. Dantzig Prize". 1991. Retrieved December 12, 2014.
 ^ "Arkadi Nemirovski 2003 John von Neumann Theory Prize: Winner(s)". 2003. Retrieved December 10, 2014.
 ^ "Brief CV of Arkadi Nemirovski". 2009. Retrieved December 12, 2014.
 ^ "Arkadi Nemirovski awarded an Honorary DMath Degree". 2009. Retrieved December 12, 2014.
 ^ "Arkadi Nemirovski, Ph.D. – ISyE"
 ^ [1]
 ^ Nesterov, Yurii; Arkadii, Nemirovskii (1995). InteriorPoint Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics. ISBN 0898715156.
 ^ Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. ISBN 9780521833783. Retrieved October 15, 2011.
 ^ Tseng, Paul (2004). "Review of Lectures on modern convex optimization: analysis, algorithms and engineering applications, by Aharon BenTal and Arkadi Nemirovski". Math. Comp. 73: 1040. doi:10.1090/S0025571803016703.
External links
 Arkadi Nemirovski, Ph.D. – ISyE
 Arkadi Nemirovski's website
 Arkadi Nemirovski – Technion
 https://web.archive.org/web/20160513155431/https://www.informs.org/RecognizeExcellence/INFORMSPrizesAwards/JohnvonNeumannTheoryPrize