Dimitri Bertsekas

Dimitri Bertsekas
Dimitri P. Bertsekas

Born Athens, Greece
Residence United States
Fields Optimization, Mathematics, Control theory and Data Communication Network
Institutions Stanford University
University of Illinois at Urbana-Champaign
Massachusetts Institute of Technology
Alma mater Massachusetts Institute of Technology
Known for

Convex optimization
Dynamic Programming
Approximate Dynamic Programming

Stochastic systems and Optimal Control
Notable awards

INFORMS ICS Prize 1997
Greek National Award for Operations Research
ACC John R. Ragazzini Education Award


Member of the United States National Academy of Engineering
2009 INFORMS Expository Writing Award

Dimitri Bertsekas is an applied mathematician and computer scientist, and a professor at the department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts.

Contents

Biography

Dimitri P. Bertsekas was born in Greece and lived his childhood there. He studied for five years at the National Technical University of Athens, Greece (a time that, by his account, was spent mostly in playing poker and chess, and dating his future wife Ioanna), for about a year and a half at the George Washington University, Wash.DC (at night, while working as a research engineer), and for about two years at MIT, where he obtained his doctorate in system science. He also taught for three years at the Engineering-Economic Systems Dept. of Stanford University, and for five years at the Electrical and Computer Engineering Dept. of the University of Illinois at Urbana-Champaign.[1]

He is known for his research work, and for his fourteen textbooks and monographs in theoretical and algorithmic optimization and control, and in applied probability. His work ranges from theoretical/foundational work, to algorithmic analysis and design for optimization problems, and to applications such as data communication and transportation networks, and electric power generation. He is featured among the top 100 most cited computer science authors in the CiteSeer search engine academic database[2] and digital library. In 1995, he co-founded, a publishing company, Athena Scientific that among others, publishes most of his books.

In the late 90s Bertsekas developed a strong interest in digital photography. His photographs have been exhibited on several occasions at M.I.T.,[3] and can also be accessed from his www site http://web.mit.edu/dimitrib/www/home.html.

Awards and honors

Bertsekas was awarded the INFORMS 1997 Prize for Research Excellence in the Interface Between Operations Research and Computer Science[4] for his book "Neuro-Dynamic Programming" (co-authored with J. N. Tsitsiklis); the 2000 Greek National Award for Operations Research; and the 2001 ACC John R. Ragazzini Education Award for outstanding contributions to education.[5] In 2001, he was elected to the US National Academy of Engineering for "pioneering contributions to fundamental research, practice and education of optimization/control theory, and especially its application to data communication networks".[6] In 2009, he was awarded the 2009 INFORMS Expository Writing Award for his ability to "communicate difficult mathematical concepts with unusual clarity, thereby reaching a broad audience across many disciplines. "[7]

Textbooks and research monographs

Bertsekas' textbooks include

all of which are used widely for classroom instruction in many universities including MIT,[8][9] have been published in multiple editions, and have been translated in foreign languages.

He has also written several widely referenced research monographs,[10] which collectively contain most of his research. These include:

Free books to download

External links

Notes

See also


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Convex function — on an interval. A function (in black) is convex if and only i …   Wikipedia

  • National Technical University of Athens — NTUA redirects here. For the Taiwanese university, see National Taiwan University of Arts National Technical University of Athens Εθνικό Μετσόβιο Πολυτεχνείο Seal of NTUA (Prometheus Carrying Fire) Established December 31, 1836 (OS) …   Wikipedia

  • Frank–Wolfe algorithm — The Frank–Wolfe algorithm, also known as the convex combination algorithm , is a classic algorithm in operations research (OR). It was originally proposed by Marguerite Frank and Phil Wolfe in 1956 as a procedure for solving quadratic programming …   Wikipedia

  • Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… …   Wikipedia

  • Auction algorithm — The term auction algorithm applies to several variations of a combinatorial optimization algorithm which solves assignment problems, including forward/reverse auction algorithms. An auction algorithm has been used in a business setting to… …   Wikipedia

  • Claude Lemaréchal — is a French applied mathematician. In mathematical optimization, Claude Lemaréchal is known for his work in numerical methods for nonlinear optimization, especially for problems with nondifferentiable kinks. Lemaréchal and Phil. Wolfe pioneered… …   Wikipedia

  • Reinforcement learning — Inspired by related psychological theory, in computer science, reinforcement learning is a sub area of machine learning concerned with how an agent ought to take actions in an environment so as to maximize some notion of long term reward .… …   Wikipedia

  • Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized,… …   Wikipedia

  • Neural network — For other uses, see Neural network (disambiguation). Simplified view of a feedforward artificial neural network The term neural network was traditionally used to refer to a network or circuit of biological neurons.[1] The modern usage of the term …   Wikipedia

  • Subgradient method — Subgradient methods are algorithms for solving convex optimization problems. Originally developed by Naum Z. Shor and others in the 1960s and 1970s, subgradient methods can be used with a non differentiable objective function. When the objective… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”