Dimitri Bertsekas

Bertsekas, National Technical University of Athens'den B.S. derecesini elde ettikten sonra, Elektrik mühendisliği 1969 yılında George Washington Üniversitesi'nden M.S., ve 1971 yılında Massachusetts Institute of Technology'den Ph.D. derecelerini aldı.

• Dynamic Programming and Optimal Control (1996)
• Data Networks (1989, Robert G. Gallager ile birlikte)
• Nonlinear Programming (1996)
• Introduction to Probability (2003, co-authored with J. N. Tsitsiklis ile birlikte)
• Convex Optimization Algorithms (2015)

Yukarıdaki kitapların hepsi MIT'de olduğu gibi daha birçok üniversitede de ders kitabı olarak okutulmaktadır.[4][5]

Ayrıca araştırmalarının büyük kısmını ihtiva eden birçok monograf ta yazmıştır.[6]

Bunlar:

• Stochastic Optimal Control: The Discrete-Time Case (1978, co-authored with S. E. Shreve), a mathematically complex work, establishing the measure-theoretic foundations of dynamic programming and stochastic control.
• Constrained Optimization and Lagrange Multiplier Methods (1982), the first monograph that addressed comprehensively the algorithmic convergence issues around augmented Lagrangian and sequential quadratic programming methods.
• Parallel and Distributed Computation: Numerical Methods (1989, co-authored with J. N. Tsitsiklis), which among others established the fundamental theoretical structures for the analysis of distributed asynchronous algorithms.
• Linear Network Optimization (1991) and Network Optimization: Continuous and Discrete Models (1998), which among others discuss comprehensively the class of auction algorithms for assignment and network flow optimization, developed by Bertsekas over a period of 20 years starting in 1979.
• Neuro-Dynamic Programming(1996, co-authored with J. N. Tsitsiklis), which laid the theoretical foundations for suboptimal approximations of highly complex sequential decision-making problems.
• Convex Analysis and Optimization (2003, co-authored with A. Nedic and A. Ozdaglar) and Convex Optimization Theory (2009), which provided a new line of development for optimization duality theory, a new connection between the theory of Lagrange multipliers and nonsmooth analysis, and a comprehensive development of incremental subgradient methods.

• Network Optimization
• Data Networks
• Approximate Dynamic Programming
• Constrained Optimization and Lagrange Multiplier Methods
• Parallel and Distributed Computation: Numerical Methods
• Stochastic Optimal Control: The Discrete-Time Case
• Abstract Dynamic Programming

• Publications from Google Scholar.
• Publications from DBLP.
• Biography from National Academy of Engineering
• Bertsekas' home page at MIT
• Athena Scientific
• Laboratory for Information and Control Systems, MIT
• Department of Electrical Engineering and Computer Science, MIT
• Biography of Dimitri Bertsekas from the Institute for Operations Research and the Management Sciences (INFORMS)