Dimitri P. Bertsekas

ORCID

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 42

Top Venues

CoRR

SIAM J. Optim.

Math. Oper. Res.

IEEE Trans. Autom. Control.

Publications

Dimitri P. Bertsekas
New Auction Algorithms for the Assignment Problem and Extensions. CoRR (2023)
Jamison W. Weber, Dhanush R. Giriyan, Devendra R. Parkar, Andréa W. Richa, Dimitri P. Bertsekas
Distributed Online Rollout for Multivehicle Routing in Unmapped Environments. CoRR (2023)
Daniel Garces, Sushmita Bhattacharya, Dimitri P. Bertsekas, Stephanie Gil
Approximate Multiagent Reinforcement Learning for On-Demand Urban Mobility Problem on a Large Map (extended version). CoRR (2023)
Siddhant Bhambri, Amrita Bhattacharjee, Dimitri P. Bertsekas
Playing Wordle Using an Online Rollout Algorithm for Deterministic POMDPs. CoG (2023)
Garima Agrawal, Dimitri P. Bertsekas, Huan Liu
Auction-Based Learning for Question Answering over Knowledge Graphs. Inf. 14 (6) (2023)
Daniel Garces, Sushmita Bhattacharya, Stephanie Gil, Dimitri P. Bertsekas
Multiagent Reinforcement Learning for Autonomous Routing and Pickup Problem with Adaptation to Variable Demand. ICRA (2023)
Dimitri P. Bertsekas
Rollout Algorithms and Approximate Dynamic Programming for Bayesian Optimization and Sequential Estimation. CoRR (2022)
Dimitri P. Bertsekas
New Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning. CoRR (2022)
Daniel Garces, Sushmita Bhattacharya, Stephanie Gil, Dimitri P. Bertsekas
Multiagent Reinforcement Learning for Autonomous Routing and Pickup Problem with Adaptation to Variable Demand. CoRR (2022)
Siddhant Bhambri, Amrita Bhattacharjee, Dimitri P. Bertsekas
Reinforcement Learning Methods for Wordle: A POMDP/Adaptive Control Approach. CoRR (2022)
Menghan Liu, Erik Poppleton, Giulia Pedrielli, Petr Sulc, Dimitri P. Bertsekas
ExpertRNA: A New Framework for RNA Secondary Structure Prediction. INFORMS J. Comput. 34 (5) (2022)
Dimitri P. Bertsekas
Multiagent Reinforcement Learning: Rollout and Policy Iteration. IEEE CAA J. Autom. Sinica 8 (2) (2021)
Dimitri P. Bertsekas
Distributed Asynchronous Policy Iteration for Sequential Zero-Sum Games and Minimax Control. CoRR (2021)
Dimitri P. Bertsekas
Lessons from AlphaZero for Optimal, Model Predictive, and Adaptive Control. CoRR (2021)
Yuchao Li, Karl Henrik Johansson, Jonas Mårtensson, Dimitri P. Bertsekas
Data-driven Rollout for Deterministic Optimal Control. CDC (2021)
Dimitri P. Bertsekas
On-Line Policy Iteration for Infinite Horizon Dynamic Programming. CoRR (2021)
Sushmita Bhattacharya, Sahil Badyal, Thomas Wheeler, Stephanie Gil, Dimitri P. Bertsekas
Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration With Application to Autonomous Sequential Repair Problems. IEEE Robotics Autom. Lett. 5 (3) (2020)
Dimitri P. Bertsekas
Constrained Multiagent Rollout and Multidimensional Assignment with the Auction Algorithm. CoRR (2020)
Dimitri P. Bertsekas
Multiagent Value Iteration Algorithms in Dynamic Programming and Reinforcement Learning. CoRR (2020)
Sushmita Bhattacharya, Siva Kailas, Sahil Badyal, Stephanie Gil, Dimitri P. Bertsekas
Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems. CoRR (2020)
Sushmita Bhattacharya, Sahil Badyal, Thomas Wheeler, Stephanie Gil, Dimitri P. Bertsekas
Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration with Application to Autonomous Sequential Repair Problems. CoRR (2020)
Sushmita Bhattacharya, Siva Kailas, Sahil Badyal, Stephanie Gil, Dimitri P. Bertsekas
Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems. CoRL (2020)
Dimitri P. Bertsekas
Feature-based aggregation and deep reinforcement learning: a survey and some new implementations. IEEE CAA J. Autom. Sinica 6 (1) (2019)
Dimitri P. Bertsekas
Multiagent Rollout Algorithms and Reinforcement Learning. CoRR (2019)
Dimitri P. Bertsekas
Biased Aggregation, Rollout, and Enhanced Policy Improvement for Reinforcement Learning. CoRR (2019)
Dimitri P. Bertsekas
Affine Monotonic and Risk-Sensitive Models in Dynamic Programming. IEEE Trans. Autom. Control. 64 (8) (2019)
Dimitri P. Bertsekas
Proximal algorithms and temporal difference methods for solving fixed point problems. Comput. Optim. Appl. 70 (3) (2018)
Dimitri P. Bertsekas
Feature-Based Aggregation and Deep Reinforcement Learning: A Survey and Some New Implementations. CoRR (2018)
Dimitri P. Bertsekas
Stable Optimal Control and Semicontractive Dynamic Programming. SIAM J. Control. Optim. 56 (1) (2018)
Dimitri P. Bertsekas
Proper Policies in Infinite-State Stochastic Shortest Path Problems. IEEE Trans. Autom. Control. 63 (11) (2018)
Dimitri P. Bertsekas
Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming. IEEE Trans. Neural Networks Learn. Syst. 28 (3) (2017)
Dimitri P. Bertsekas
Regular Policies in Abstract Dynamic Programming. SIAM J. Optim. 27 (3) (2017)
Dimitri P. Bertsekas
Proximal Algorithms and Temporal Differences for Large Linear Systems: Extrapolation, Approximation, and Simulation. CoRR (2016)
Mengdi Wang, Dimitri P. Bertsekas
Stochastic First-Order Methods with Random Constraint Projection. SIAM J. Optim. 26 (1) (2016)
Dimitri P. Bertsekas
Robust Shortest Path Planning and Semicontractive Dynamic Programming. CoRR (2016)
Dimitri P. Bertsekas
Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey. CoRR (2015)
Dimitri P. Bertsekas
Incremental Aggregated Proximal and Augmented Lagrangian Algorithms. CoRR (2015)
Dimitri P. Bertsekas
Lambda-Policy Iteration: A Review and a New Implementation. CoRR (2015)
Dimitri P. Bertsekas
Centralized and Distributed Newton Methods for Network Optimization and Extensions. CoRR (2015)
Dimitri P. Bertsekas
Value and Policy Iteration in Optimal Control and Adaptive Dynamic Programming. CoRR (2015)
Mengdi Wang, Dimitri P. Bertsekas
Incremental constraint projection methods for variational inequalities. Math. Program. 150 (2) (2015)
Huizhen Yu, Dimitri P. Bertsekas
A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies. Math. Oper. Res. 40 (4) (2015)
Mengdi Wang, Dimitri P. Bertsekas
Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems. Math. Oper. Res. 39 (1) (2014)
Huizhen Yu, Dimitri P. Bertsekas
Q-learning and policy iteration algorithms for stochastic shortest path problems. Ann. Oper. Res. 208 (1) (2013)
Huizhen Yu, Dimitri P. Bertsekas
On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems. Math. Oper. Res. 38 (2) (2013)
Huizhen Yu, Dimitri P. Bertsekas
Discretized Approximations for POMDP with Average Cost CoRR (2012)
Dimitri P. Bertsekas, Huizhen Yu
Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming. Math. Oper. Res. 37 (1) (2012)
Dimitri P. Bertsekas
Temporal Difference Methods for General Projected Equations. IEEE Trans. Autom. Control. 56 (9) (2011)
Dimitri P. Bertsekas, Zhi-Quan Luo
Preface. Math. Program. 129 (2) (2011)
Dimitri P. Bertsekas, Huizhen Yu
A Unifying Polyhedral Approximation Framework for Convex Optimization. SIAM J. Optim. 21 (1) (2011)
Dimitri P. Bertsekas
Incremental proximal methods for large scale convex optimization. Math. Program. 129 (2) (2011)
Dimitri P. Bertsekas, Huizhen Yu
Distributed asynchronous policy iteration in dynamic programming. Allerton (2010)
Huizhen Yu, Dimitri P. Bertsekas
Error Bounds for Approximations from Projected Linear Equations. Math. Oper. Res. 35 (2) (2010)
Dimitri P. Bertsekas
Pathologies of temporal difference methods in approximate dynamic programming. CDC (2010)
Angelia Nedic, Dimitri P. Bertsekas
The effect of deterministic noise in subgradient methods. Math. Program. 125 (1) (2010)
Dimitri P. Bertsekas, Huizhen Yu
Q-learning and enhanced policy iteration in discounted dynamic programming. CDC (2010)
Huizhen Yu, Dimitri P. Bertsekas
Convergence Results for Some Temporal Difference Methods Based on Least Squares. IEEE Trans. Autom. Control. 54 (7) (2009)
Dimitri P. Bertsekas
A unified framework for temporal difference methods. ADPRL (2009)
Huizhen Yu, Dimitri P. Bertsekas
Basis function adaptation methods for cost approximation in MDP. ADPRL (2009)
Huizhen Yu, Dimitri P. Bertsekas
New Error Bounds for Approximations from Projected Linear Equations. EWRL (2008)
Huizhen Yu, Dimitri P. Bertsekas
New error bounds for approximations from projected linear equations. Allerton (2008)
Huizhen Yu, Dimitri P. Bertsekas
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP. Math. Oper. Res. 33 (1) (2008)
Dimitri P. Bertsekas, John N. Tsitsiklis
Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules". IEEE Trans. Autom. Control. 52 (5) (2007)
Dimitri P. Bertsekas
Separable Dynamic Programming and Approximate Decomposition Methods. IEEE Trans. Autom. Control. 52 (5) (2007)
Dimitri P. Bertsekas, Paul Tseng
Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. 110 (2) (2007)
Dimitri P. Bertsekas, John N. Tsitsiklis
Erratum to "Comments on 'Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'". IEEE Trans. Autom. Control. 52 (7) (2007)
Dimitri P. Bertsekas
Neuro-Dynamic Programming: An Overview and Recent Results. OR (2006)
Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng
Enhanced Fritz John Conditions for Convex Programming. SIAM J. Optim. 16 (3) (2006)
Dimitri P. Bertsekas
Dynamic Programming and Suboptimal Control: From ADP to MPC. CDC/ECC (2005)
Dimitri P. Bertsekas
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC. Eur. J. Control 11 (4-5) (2005)
Huizhen Yu, Dimitri P. Bertsekas
Discretized Approximations for POMDP with Average Cost. UAI (2004)
Asuman E. Ozdaglar, Dimitri P. Bertsekas
The relation between pseudonormality and quasiregularity in constrained optimization. Optim. Methods Softw. 19 (5) (2004)
Asuman E. Ozdaglar, Dimitri P. Bertsekas
Routing and wavelength assignment in optical networks. IEEE/ACM Trans. Netw. 11 (2) (2003)
Angelia Nedic, Dimitri P. Bertsekas
Least Squares Policy Evaluation Algorithms with Linear Function Approximation. Discret. Event Dyn. Syst. 13 (1-2) (2003)
Jinane Abounadi, Dimitri P. Bertsekas, Vivek S. Borkar
Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms. SIAM J. Control. Optim. 41 (1) (2002)
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)
Jinane Abounadi, Dimitri P. Bertsekas, Vivek S. Borkar
Learning Algorithms for Markov Decision Processes with Average Cost. SIAM J. Control. Optim. 40 (3) (2001)
Cynara Wu, Dimitri P. Bertsekas
Distributed power control algorithms for wireless networks. IEEE Trans. Veh. Technol. 50 (2) (2001)
Angelia Nedic, Dimitri P. Bertsekas
Incremental Subgradient Methods for Nondifferentiable Optimization. SIAM J. Optim. 12 (1) (2001)
Dimitri P. Bertsekas, M. L. Homer, D. A. Logan, Stephen D. Patek, Nils R. Sandell
Missile defense and interceptor allocation by neuro-dynamic programming. IEEE Trans. Syst. Man Cybern. Part A 30 (1) (2000)
Dimitri P. Bertsekas, John N. Tsitsiklis
Gradient Convergence in Gradient methods with Errors. SIAM J. Optim. 10 (3) (2000)
Paul Tseng, Dimitri P. Bertsekas
An ε-relaxation method for separable convex cost generalized network flow problems. Math. Program. 88 (1) (2000)
Dimitri P. Bertsekas, David A. Castañón
Rollout Algorithms for Stochastic Scheduling Problems. J. Heuristics 5 (1) (1999)
Dimitri P. Bertsekas
A Note on Error Bounds for Convex and Nonconvex Programs. Comput. Optim. Appl. 12 (1-3) (1999)
Lazaros C. Polymenakos, Dimitri P. Bertsekas, John N. Tsitsiklis
Implementation of efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control. 43 (2) (1998)
Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu
Rollout Algorithms for Combinatorial Optimization. J. Heuristics 3 (3) (1997)
Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng
An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. SIAM J. Optim. 7 (3) (1997)
Dimitri P. Bertsekas
A New Class of Incremental Gradient Methods for Least Squares Problems. SIAM J. Optim. 7 (4) (1997)
Emmanouel A. Varvarigos, Dimitri P. Bertsekas
A Conflict Sense Routing Protocol and Its Performance for Hypercubes. IEEE Trans. Computers 45 (6) (1996)
Paul Tseng, Dimitri P. Bertsekas
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO (1996)
Satinder P. Singh, Dimitri P. Bertsekas
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems. NIPS (1996)
Dimitri P. Bertsekas
Incremental Least Squares Methods and the Extended Kalman Filter. SIAM J. Optim. 6 (3) (1996)
S. A. Savari, Dimitri P. Bertsekas
Finite Termination of Asynchronous Iterative Algorithms. Parallel Comput. 22 (1) (1996)
Dimitri P. Bertsekas
A Counterexample to Temporal Differences Learning. Neural Comput. 7 (2) (1995)
Dimitri P. Bertsekas, Stefano Pallottino, Maria Grazia Scutellà
Polynomial auction algorithms for shortest paths. Comput. Optim. Appl. 4 (2) (1995)
Emmanouel A. Varvarigos, Dimitri P. Bertsekas
Dynamic Broadcasting in Parallel Computing. IEEE Trans. Parallel Distributed Syst. 6 (2) (1995)
Dimitri P. Bertsekas
Generic rank-one corrections for value iteration in Markovian decision problems. Oper. Res. Lett. 17 (3) (1995)
Emmanouel A. Varvarigos, Dimitri P. Bertsekas
Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task. Parallel Comput. 21 (2) (1995)
Emmanouel A. Varvarigos, Dimitri P. Bertsekas
Performance of hypercube routing schemes with or without buffering. IEEE/ACM Trans. Netw. 2 (3) (1994)
Emmanouel A. Varvarigos, Dimitri P. Bertsekas
Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes. J. Parallel Distributed Comput. 23 (2) (1994)

Dimitri P. Bertsekas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dimitri P. Bertsekas