Dimitri P. Bertsekas

Dimitri P. Bertsekas, Huizhen Yu: Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming. Math. Oper. Res. 37(1): 66-94 (2012)

Huizhen Yu, Dimitri P. Bertsekas: Discretized Approximations for POMDP with Average Cost. CoRR abs/1207.4154 (2012)

Dimitri P. Bertsekas, Zhi-Quan Luo: Preface. Math. Program. 129(2): 159-162 (2011)

Dimitri P. Bertsekas: Incremental proximal methods for large scale convex optimization. Math. Program. 129(2): 163-195 (2011)

Dimitri P. Bertsekas, Huizhen Yu: A Unifying Polyhedral Approximation Framework for Convex Optimization. SIAM Journal on Optimization 21(1): 333-360 (2011)

Dimitri P. Bertsekas: Temporal Difference Methods for General Projected Equations. IEEE Trans. Automat. Contr. 56(9): 2128-2139 (2011)

Huizhen Yu, Dimitri P. Bertsekas: Error Bounds for Approximations from Projected Linear Equations. Math. Oper. Res. 35(2): 306-329 (2010)

Angelia Nedic, Dimitri P. Bertsekas: The effect of deterministic noise in subgradient methods. Math. Program. 125(1): 75-99 (2010)

Dimitri P. Bertsekas, Huizhen Yu: Q-learning and enhanced policy iteration in discounted dynamic programming. CDC 2010: 1409-1416

Dimitri P. Bertsekas: Pathologies of temporal difference methods in approximate dynamic programming. CDC 2010: 3034-3039

Huizhen Yu, Dimitri P. Bertsekas: Convergence Results for Some Temporal Difference Methods Based on Least Squares. IEEE Trans. Automat. Contr. 54(7): 1515-1531 (2009)

Dimitri P. Bertsekas: Auction Algorithms. Encyclopedia of Optimization 2009: 128-132

Dimitri P. Bertsekas: Neuro-Dynamic Programming. Encyclopedia of Optimization 2009: 2555-2560

Huizhen Yu, Dimitri P. Bertsekas: On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP. Math. Oper. Res. 33(1): 1-11 (2008)

Huizhen Yu, Dimitri P. Bertsekas: New Error Bounds for Approximations from Projected Linear Equations. EWRL 2008: 253-267

Dimitri P. Bertsekas, Paul Tseng: Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. 110(2): 287-314 (2007)

Dimitri P. Bertsekas: Separable Dynamic Programming and Approximate Decomposition Methods. IEEE Trans. Automat. Contr. 52(5): 911-916 (2007)

Dimitri P. Bertsekas, John N. Tsitsiklis: Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules". IEEE Trans. Automat. Contr. 52(5): 968-969 (2007)

Dimitri P. Bertsekas, John N. Tsitsiklis: Erratum to "Comments on `Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'". IEEE Trans. Automat. Contr. 52(7): 1356 (2007)

Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng: Enhanced Fritz John Conditions for Convex Programming. SIAM Journal on Optimization 16(3): 766-797 (2006)

Dimitri P. Bertsekas: Neuro-Dynamic Programming: An Overview and Recent Results. OR 2006: 71-72

Dimitri P. Bertsekas: Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC. Eur. J. Control 11(4-5): 310-334 (2005)

Huizhen Yu, Dimitri P. Bertsekas: Discretized Approximations for POMDP with Average Cost. UAI 2004: 519

Angelia Nedic, Dimitri P. Bertsekas: Least Squares Policy Evaluation Algorithms with Linear Function Approximation. Discrete Event Dynamic Systems 13(1-2): 79-110 (2003)

Asuman E. Ozdaglar, Dimitri P. Bertsekas: Routing and wavelength assignment in optical networks. IEEE/ACM Trans. Netw. 11(2): 259-272 (2003)

Jinane Abounadi, Dimitri P. Bertsekas, Vivek S. Borkar: Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms. SIAM J. Control and Optimization 41(1): 1-22 (2002)

Jinane Abounadi, Dimitri P. Bertsekas, Vivek S. Borkar: Learning Algorithms for Markov Decision Processes with Average Cost. SIAM J. Control and Optimization 40(3): 681-698 (2001)

Angelia Nedic, Dimitri P. Bertsekas: Incremental Subgradient Methods for Nondifferentiable Optimization. SIAM Journal on Optimization 12(1): 109-138 (2001)

Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Dimitri P. Bertsekas, Hussein T. Mouftah: Reservation-Based Session Routing for Broadband Communication Networks with Strict QoS Requirements. ICOIN 2001: 593-

Dimitri P. Bertsekas, John N. Tsitsiklis: Gradient Convergence in Gradient methods with Errors. SIAM Journal on Optimization 10(3): 627-642 (2000)

Dimitri P. Bertsekas, M. L. Homer, D. A. Logan, Stephen D. Patek, N. R. Sandell: Missile defense and interceptor allocation by neuro-dynamic programming. IEEE Transactions on Systems, Man, and Cybernetics, Part A 30(1): 42-51 (2000)

Dimitri P. Bertsekas, David A. Castañon: Rollout Algorithms for Stochastic Scheduling Problems. J. Heuristics 5(1): 89-108 (1999)

Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu: Rollout Algorithms for Combinatorial Optimization. J. Heuristics 3(3): 245-262 (1997)

S. A. Savari, Dimitri P. Bertsekas: Finite Termination of Asynchronous Iterative Algorithms. Parallel Computing 22(1): 39-56 (1996)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: A Conflict Sense Routing Protocol and Its Performance for Hypercubes. IEEE Trans. Computers 45(6): 693-703 (1996)

Paul Tseng, Dimitri P. Bertsekas: A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO 1996: 85-93

Satinder P. Singh, Dimitri P. Bertsekas: Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems. NIPS 1996: 974-980

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task. Parallel Computing 21(2): 243-264 (1995)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Dynamic Broadcasting in Parallel Computing. IEEE Trans. Parallel Distrib. Syst. 6(2): 120-131 (1995)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes. J. Parallel Distrib. Comput. 23(2): 177-189 (1994)

Lazaros Polymenakos, Dimitri P. Bertsekas: Parallel Shortest Path Auction Algorithms. Parallel Computing 20(9): 1221-1247 (1994)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Performance of hypercube routing schemes with or without buffering. IEEE/ACM Trans. Netw. 2(3): 299-311 (1994)

Dimitri P. Bertsekas, David A. Castañon: Parallel Asynchronous Hungarian Methods for the Assignment Problem. INFORMS Journal on Computing 5(3): 261-274 (1993)

Paul Tseng, Dimitri P. Bertsekas: On the convergence of the exponential multiplier method for convex programming. Math. Program. 60: 1-19 (1993)

Dimitri P. Bertsekas: A simple and fast label correcting algorithm for shortest paths. Networks 23(8): 703-709 (1993)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets. IEEE Trans. Parallel Distrib. Syst. 4(2): 144-154 (1993)

Dimitri P. Bertsekas, Robert Gallager: Data networks (2. ed.). Prentice Hall 1992, isbn 978-0-13-201674-2, pp. I-XIX, 1-556

Jonathan Eckstein, Dimitri P. Bertsekas: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55: 293-318 (1992)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. Parallel Computing 18(11): 1233-1257 (1992)

Emmanouel A. Varvarigos, Dimitri P. Bertsekas: Partial Multinode Broadcast Algorithms for D-Dimensional Meshes. ICPP (3) 1992: 51-54

Dimitri P. Bertsekas: Linear network optimization - algorithms and codes. MIT Press 1991, isbn 978-0-262-02334-4, pp. I-XI, 1-359

Dimitri P. Bertsekas, John N. Tsitsiklis: Some aspects of parallel and distributed iterative algorithms - A survey^, . Automatica 27(1): 3-21 (1991)

Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis: Optimal Communication Algorithms for Hypercubes. J. Parallel Distrib. Comput. 11(4): 263-275 (1991)

Dimitri P. Bertsekas, David A. Castañon: Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Computing 17(6-7): 707-732 (1991)

Paul Tseng, Dimitri P. Bertsekas: Relaxation Methods for Monotropic Programs. Math. Program. 46: 127-151 (1990)

Dimitri P. Bertsekas, John N. Tsitsiklis: Parallel and distributed computation. Prentice Hall 1989, isbn 978-0-13-648759-3, pp. I-XIX, 1-715

Dimitri P. Bertsekas, John N. Tsitsiklis: Convergence rate and termination of asynchronous iterative algorithms. ICS 1989: 461-470

Eli Gafni, Dimitri P. Bertsekas: Asymptotic optimality of shortest path routing algorithms. IEEE Transactions on Information Theory 33(1): 83-90 (1987)