D. Bertsekas

D. Bertsekas, S. Shreve, 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

Routing and wavelength assignment in optical networks

Asuman E. Ozdaglar, Dimitri P. Bertsekas, A. Ozdaglar, 2003, TNET.

Relaxation methods for problems with strictly convex separable costs and linear constraints

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1987, Math. Program..

Relaxation methods for network flow problems with convex arc costs

D. Bertsekas, P. Tseng, Partick A. Hossein, 1987 .

Enhanced Fritz John Conditions for Convex Programming

Paul Tseng, Asuman E. Ozdaglar, Dimitri P. Bertsekas, 2006, SIAM J. Optim..

Basis function adaptation methods for cost approximation in MDP

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2009, 2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning.

An Auction Algorithm for Shortest Paths

Dimitri P. Bertsekas, D. Bertsekas, 1991, SIAM J. Optim..

Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems

Dimitri P. Bertsekas, Mengdi Wang, D. Bertsekas, 2014, Math. Oper. Res..

On the Convergence of Simulation-Based Iterative Methods for Singular Linear Systems

D. Bertsekas, Mengdi Wang mdwang, 2012 .

An ε-relaxation method for separable convex cost generalized network flow problems

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 2000, Math. Program..

ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems

D. Bertsekas, P. Tseng, L. Polymenakos, 1997 .

Stochastic Shortest Path Problems Under Weak Conditions

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2013 .

Incremental Subgradient Methods for Nondifferentiable Optimization

Dimitri P. Bertsekas, Angelia Nedic, D. Bertsekas, 2001, SIAM J. Optim..

CONVERGENCE OF A GRADIENT PROJECTION METHOD

D. Bertsekas, Decision Systems., E. Gafni, 1982 .

Extended Monotropic Programming and Duality

D. Bertsekas, 2008 .

Convergence rate of penalty and multiplier methods

D. Bertsekas, 1973, CDC 1973.

COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION*

D. Bertsekas, 1975 .

Augmented Lagrangian and differentiable exact penalty methods

D. Bertsekas, Decision Systems., 1981 .

Convex Analysis and Optimization

Dimitri P. Bertsekas, Angelia Nedic, Asuman Ozdaglar, 2003 .

A new algorithm for the assignment problem

Dimitri P. Bertsekas, D. Bertsekas, 1981, Math. Program..

Nondifferentiable optimization via approximation

D. Bertsekas, 1975 .

Relaxation Method for Linear Programs with Side Constraints

Decision Systems., Paul. Tseng, Dimitri P. Bertsekas, 1987 .

Computation of production control policies by a dynamic programming technique

Stanley B. Gershwin, Joseph Kimemia, Dimitri P. Bertsekas, 1982 .

Convexification procedures and decomposition methods for nonconvex optimization problems

D. Bertsekas, 1979 .

Multiplier methods: A survey

D. Bertsekas, 1975, Autom..

On Penalty and Multiplier Methods for Constrained Minimization

D. Bertsekas, 1976 .

6.253 Convex Analysis and Optimization, Spring 2010

D. Bertsekas, 2004 .

Enlarging the region of convergence of Newton's method for constrained optimization

D. Bertsekas, 1982 .

RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems

Dimitri P. Bertsekas, Decision Systems., Paul Tseng, 1994 .

An auction algorithm for the max-flow problem

D. Bertsekas, 1995 .

Incremental Constraint Projection-Proximal Methods for Nonsmooth Convex Optimization

D. Bertsekas, Mengdi Wang, 2013 .

Dynamic Programming and Optimal Control 3rd Edition, Volume II

Dimitri P. Bertsekas, D. Bertsekas, 2010 .

MATHEMATICAL ISSUES IN DYNAMIC PROGRAMMING

D. Bertsekas, S. Shreve, 2002 .

Convex Optimization Algorithms

Dimitri P. Bertsekas, D. Bertsekas, 2015 .

Distributed asynchronous deterministic and stochastic gradient optimization algorithms

John N. Tsitsiklis, Dimitri P. Bertsekas, Michael Athans, 1986 .

Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems

Dimitri P. Bertsekas, Jonathan Eckstein, D. Bertsekas, 1987 .

Convergence theories of distributed iterative processes: A survey

John N. Tsitsiklis, Michael Athans, Dimitri P. Bertsekas, 1986 .

Dynamic programming & optimal control , volume i

Dimitri P. Bertsekas, D. Bertsekas, 2014 .

Rollout Algorithms for Stochastic Scheduling Problems

Dimitri P. Bertsekas, David A. Castañón, D. Bertsekas, 1999, J. Heuristics.

6.231 Dynamic Programming and Stochastic Control, Fall 2008

Dimitri P. Bertsekas, D. Bertsekas, 2002 .

Incremental proximal methods for large scale convex optimization

Dimitri P. Bertsekas, D. Bertsekas, 2011, Math. Program..

Projected Newton methods and optimization of multicommodity flows

D. Bertsekas, E. Gafni, 1982, 1982 21st IEEE Conference on Decision and Control.

Convergence rate and termination of asynchronous iterative algorithms

John N. Tsitsiklis, Dimitri P. Bertsekas, D. Bertsekas, 1989, ICS '89.

Globally convergent Newton methods for constrained optimization using differentiable exact penalty functions

D. Bertsekas, 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

Convex Optimization Theory

Dimitri P. Bertsekas, D. Bertsekas, 2009 .

Approximation procedures based on the method of multipliers

D. Bertsekas, 1977 .

Multiplier methods: A survey

Dimitri P. Bertsekas, D. Bertsekas, 1975, at - Automatisierungstechnik.

Abstract Dynamic Programming

Dimitri P. Bertsekas, D. Bertsekas, 2013 .

Q-learning and policy iteration algorithms for stochastic shortest path problems

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2012, Annals of Operations Research.

Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology

Dimitri P. Bertsekas, Eli Gafni, D. Bertsekas, 1981, IEEE Trans. Commun..

Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals

D. Bertsekas, S. Mitter, 1971 .

Relaxation methods for monotropic programs

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1990, Math. Program..

Decomposition algorithms for large-scale nonconvex optimization problems

D. Bertsekas, 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.

The Method of Multipliers for Inequality Constrained and Nondifferentiable Optimization Problems

D. Bertsekas, 1982 .

Nonlinear Programming 2

Dimitri P. Bertsekas, D. Bertsekas, 2005 .

The effect of deterministic noise in subgradient methods

Dimitri P. Bertsekas, Angelia Nedic, D. Bertsekas, 2010, Math. Program..

Min Common/Max Crossing Duality: A Simple Geometric Framework for Convex Optimization and Minimax Theory1

A. Ozdaglar, D. Bertsekas, 2003 .

Approximate Dynamic Programming

Dimitri P. Bertsekas, D. Bertsekas, Sanjiban Choudhury, 2017, Encyclopedia of Machine Learning and Data Mining.

Introduction to Probability Vol. 1

John N. Tsitsiklis, Dimitri P. Bertsekas, D. Bertsekas, 2002 .

Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

Dimitri P. Bertsekas, Eli Gafni, Robert G. Gallager, 1984, IEEE Trans. Commun..

Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation

D. Bertsekas, W. Tsai, B. Gendron, 1984 .

Approximate solution methods for partially observable markov and semi-markov decision processes

D. Bertsekas, Huizhen Yu, 2006 .

Network Flows and Monotropic Optimization (R. T. Rockafellar)

D. Bertsekas, 1985 .

IMPROVED TEMPORAL DIFFERENCE METHODS WITH LINEAR FUNCTION APPROXIMATION1

D. Bertsekas, V. Borkar, A. Nedić, 2003 .

Incremental Aggregated Proximal and Augmented Lagrangian Algorithms pdf

Dimitri P. Bertsekas, D. Bertsekas, 2015, ArXiv.

Local Convex Conjugacy and Fenchel Duality

D. Bertsekas, 1978 .

Auction algorithms for network flow problems: A tutorial introduction

Dimitri P. Bertsekas, D. Bertsekas, 1992, Comput. Optim. Appl..

Some issues in distributed asynchronous routing in virtual circuit data networks

John Tsitsiklis, Dimitri Bertsekas, Wei Tsai, 1986, 1986 25th IEEE Conference on Decision and Control.

Asymptotic optimality of shortest path routing

D. Bertsekas, E. Gafni, 1983 .

Estimates of the duality gap for large-scale separable nonconvex optimization problems

D. Bertsekas, N. Sandell, 1982, 1982 21st IEEE Conference on Decision and Control.

Stochastic optimization problems with nondifferentiable cost functionals with an application in stochastic programming

D. Bertsekas, 1972, CDC 1972.

Optimal routing and flow control methods for communication networks

Dimitri P. Bertsekas, D. Bertsekas, 1982 .

Incremental constraint projection methods for variational inequalities

Dimitri P. Bertsekas, Mengdi Wang, D. Bertsekas, 2014, Math. Program..

On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2008, Math. Oper. Res..

Partial Proximal Minimization Algorithms for Convex Pprogramming

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1994, SIAM J. Optim..

Linear network optimization - algorithms and codes

Dimitri P. Bertsekas, D. Bertsekas, 1991 .

Separable Dynamic Programming and Approximate Decomposition Methods

Dimitri P. Bertsekas, D. Bertsekas, 2007, IEEE Transactions on Automatic Control.

Distributed asynchronous optimal routing in data networks

John N. Tsitsiklis, Dimitri P. Bertsekas, D. Bertsekas, 1986 .

A forward/reverse auction algorithm for asymmetric assignment problems

Dimitri P. Bertsekas, David A. Castañón, D. Bertsekas, 1992, Comput. Optim. Appl..

Rollout Algorithms for Combinatorial Optimization

John N. Tsitsiklis, Dimitri P. Bertsekas, Cynara Wu, 1997, J. Heuristics.

Centralized and Distributed Newton Methods for Network Optimization and Extensions pdf

Dimitri P. Bertsekas, D. Bertsekas, 2015, ArXiv.

Partial conjugate gradient methods for a class of optimal control problems

D. Bertsekas, 1974 .

NEW ALGORITHMS FOR ASSIGNMENT AND TRANSPORTATION PROBLEMS

Dimitri P. Bertsekas, D. Bertsekas, 1979 .

Asymptotic optimality of shortest path routing algorithms

Dimitri P. Bertsekas, Eli Gafni, D. Bertsekas, 1987, IEEE Trans. Inf. Theory.

Path assignment for virtual circuit routing

D. Bertsekas, E. Gafni, 1983, SIGCOMM.

Relaxation Methods for Linear Programs

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1987, Math. Oper. Res..

A simple and fast label correcting algorithm for shortest paths

Dimitri P. Bertsekas, D. Bertsekas, 1993, Networks.

Data Networks: Second Edition

Dimitri P. Bertsekas, Robert G. Gallager, R. Gallager, 1992 .

Dynamic Control of Session Input Rates in Communication Networks

Dimitri P. Bertsekas, Eli Gafni, D. Bertsekas, 1982 .

Min Common / Max Crossing Duality : A Geometric View of Conjugacy in Convex Optimization

D. Bertsekas, 2008 .

A Unifying Polyhedral Approximation Framework for Convex Optimization

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2011, SIAM J. Optim..

Reverse Auction and the Solution of Inequality Constrained Assignment Problems

Dimitri P. Bertsekas, David A. Castañón, Haralampos Tsaknakis, 1993, SIAM J. Optim..

Distributed power control algorithms for wireless networks

Dimitri P. Bertsekas, Cynara Wu, D. Bertsekas, 2001, IEEE Trans. Veh. Technol..

A new algorithm for solution of resistive networks involving diodes

Dimitri P. Bertsekas, D. Bertsekas, 1976 .

Network optimization : continuous and discrete models

Dimitri P. Bertsekas, D. Bertsekas, 1998 .

Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow

D. Bertsekas, 1994 .

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1988, Oper. Res..

Stable Optimal Control and Semicontractive Dynamic Programming

Dimitri P. Bertsekas, D. Bertsekas, 2017, SIAM J. Control. Optim..

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1991, Math. Oper. Res..

Parallel primal-dual methods for the minimum cost flow problem

Dimitri P. Bertsekas, David A. Castañón, D. Bertsekas, 1993, Comput. Optim. Appl..

Communication algorithms for isotropic tasks in hypercubes and wraparound meshes

Emmanouel A. Varvarigos, Dimitri P. Bertsekas, D. Bertsekas, 1992, Parallel Comput..

The relation between pseudonormality and quasiregularity in constrained optimization

Asuman E. Ozdaglar, Dimitri P. Bertsekas, A. Ozdaglar, 2004, Optim. Methods Softw..

Security Classification of This Page (when Data Entered) "

D. Bertsekas, E. Gafni, 1983 .

Optimal short-term scheduling of large-scale power systems

D. Bertsekas, N. Sandell, G. Lauer, 1981, CDC 1981.

RELAX: a computer code for minimum cost network flow problems

Dimitri P. Bertsekas, Decision Systems., Paul Tseng, 1985 .

Relaxation methods for problems with strictly convex costs and linear inequality constraints

D. Bertsekas, P. Tseng, Decision Systems., 1987 .

Dynamic Control of Session Input Rates in Communication Networks

Eli Gafni, Dimitri Bertsekas, D. Bertsekas, 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

LIDS REPORT 2871 1 Q-Learning and Policy Iteration Algorithms for Stochastic Shortest Path Problems ∗

D. Bertsekas, Huizhen Yu, 2012 .

Proposal Approximate Dynamic Programming Using Bellman Residual Elimination

A. Ozdaglar, D. Bertsekas, 2008 .

Áëìêááíììì Ëëaeaeàêçaeçíë Áaeaeêêååaeìä Ëíííêêêááaeì Ååìàççë

D. Bertsekas, METHODSA. Nedi, V. Borkar, 2000 .

ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS

Dimitri P. Bertsekas, Didier El Baz, D. Bertsekas, 1987 .

September 1994 LIDS-P-2267 A HYBRID INCREMENTAL GRADIENT METHOD 1 FOR LEAST SQUARES PROBLEMS

D. Bertsekas, 2022 .

March 1994 LIDS-P-2237 INCREMENTAL LEAST SQUARES METHODSi AND THE EXTENDED KALMAN FILTER

D. Bertsekas, 2022 .

Temporal Differences-Based Policy Iteration and Applications in Neuro-Dynamic Programming

S. Ioffe, D. Bertsekas, Sergey Ioffe, 1996 .

Adaptive aggregation methods for infinite horizon dynamic programming

D. Bertsekas, D. Castañón, 1989 .

Multiplier Methods: a Survey*t

D. Bertsekas, A. Surveyt, 1976 .

ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION

D. Bertsekas, 1976 .

Nonlinear Programming 3 rd Edition Theoretical Solutions Manual Chapter 6

D. Bertsekas, 2016 .

Enhanced Optimality Conditions and Exact Penalty Functions

D. Bertsekas, A. E. Koksal, 2000 .

Enhanced Optimality Conditions and Exact Penalty Functions 1

D. Bertsekas, A. E. Koksal, 2000 .

FP2 - 4:30 ADAPTIVE AGGREGATION METHODS FOR DISCOUNTED DYNAMIC PROGRAMMING*

D. Bertsekas, D. Castañón, 1986 .

New value iteration and Q-learning methods for the average cost dynamic programming problem

D. Bertsekas, 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

A VALUE ITERATION METHOD FOR THE 1 AVERAGE COST DYNAMIC PROGRAMMING PROBLEM

D. Bertsekas, 2022 .

A Journey through Optimization

D. Bertsekas, 2015 .

Lagrange Multipliers with Optimal Sensitivity Properties in Constrained Optimization

D. Bertsekas, 2006 .

Optimal Solution of Integer Multicommodity Flow Problems With Application in Optical Networks

A. Ozdaglar, D. Bertsekas, 2004 .

Thevenin decomposition and large-scale optimization

D. Bertsekas, 1996 .

DIFFERENTIAL TRAINING OF 1 ROLLOUT POLICIES

D. Bertsekas, 2002 .

Forward path search : a new dual coordinate ascent algorithm for shortest paths

D. Bertsekas, Decision Systems., 1990 .

ExpertRNA: A new framework for RNA structure prediction

D. Bertsekas, G. Pedrielli, P. Šulc, 2021, bioRxiv.

North-holland 707

D. Bertsekas, D. Castañón, 1989 .

LIDS-P-1997 PARALLEL ASYNCHRONOUS HUNGARIAN METHODS FOR THE ASSIGNMENT PROBLEMi

D. Bertsekas, David, A., 2022 .

LIDS REPORT 2822 1 Approximate Solution of Large-Scale Linear Inverse Problems with Monte Carlo Simulation ∗

D. Bertsekas, Mengdi Wang, N. Polydorides, 2009 .

On error bounds for successive approximation methods

Dimitri P. Bertsekas, D. Bertsekas, 1976 .

Equivalent stochastic and deterministic optimal control problems

D. Bertsekas, S. Shreve, 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.

Extended Monotropic Programming and Duality 1

D. Bertsekas, 2010 .

AN C-RELAXATION METHOD FOR SEPARABLE CONVEX COST NETWORK FLOW PROBLEMS1

D. Bertsekas, P. Tseng, L. Polymenakos, 2022 .

Rollout Algorithms for Combinatorial Optimization 1

John N. Tsitsiklis, Dimitri P. Bertsekas, Cynara Wu, 1997 .

THE EFFECT OF DETERMINISTIC NOISE1 IN SUBGRADIENT METHODS

D. Bertsekas, A. Nedić, 2008 .

Alternative theoretical frameworks for finite horizon discrete-time stochastic optimal control

D. Bertsekas, S. Shreve, 1977 .

November 1997 LIDS-P-2404 GRADIENT CONVERGENCE IN GRADIENT METHODS

D. Bertsekas, J. Tsitsiklis, 2022 .

A Vector Space Approach to Models and Optimization

D. Bertsekas, C. Dorny, D.P. Bertsekas, 1983 .

SECTION 1.1: Convex Sets and Functions

D. Bertsekas, 2010 .

Dynamic Programming and Optimal Control Volume 1 SECOND EDITION

Dimitri P. Bertsekas, D. Bertsekas, 2000 .

INCREMENTAL SUBGRADIENT METHODS1 FOR NONDIFFERENTIABLE OPTIMIZATION

D. Bertsekas, A. Nedić, 2001 .

M It Slibraries Disclaimer of Quality Two-metric Projection Methodst for Constrained Optimization

D. Bertsekas, E. Gafni, 2022 .

P-2535 Routing and Wavelength Assignment in Optical Networks

A. Ozdaglar, D. Bertsekas, 2002 .

Relaxt-mii: a New and Improved Version of the Relax Code 1

D. Bertsekas, P. Tseng, 2022 .

On the convergence properties of second-order multiplier methods

D. Bertsekas, 1978 .

Data networks (2nd ed.)

Dimitri P. Bertsekas, Robert G. Gallager, R. Gallager, 1992 .

Dual Coordinate Ascent Methods for Linear Network Flow Problems

D. Bertsekas, Jonathan Eckstein, 2022 .

New Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning

D. Bertsekas, 2022, ArXiv.

Convex Analysis and Optimization Chapter 1 Solutions

Dimitri P. Bertsekas, D. Bertsekas, 2008 .

NO . TP 2-1 ON THE SOLUTION OF SOME MINIMAX PROBLEMS *

D. Bertsekas, 2022 .

Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning

D. Bertsekas, 2022 .

Exact Penalty Methods and Lagrangian Methods

D. Bertsekas, 1982 .

Erratum to "Comments on 'Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'"

John N. Tsitsiklis, Dimitri P. Bertsekas, D. Bertsekas, 2007, IEEE Trans. Autom. Control..

Feature Selection and Basis Function Adaptation in Approximate Dynamic Programming

Dimitri P. Bertsekas, D. Bertsekas, 2009 .

Modified auction algorithms for shortest paths

Dimitri P. Bertsekas, Decision Systems., D. Bertsekas, 1992 .

Convergence of the feasible region in infinite horizon optimization problems

Dimitri P. Bertsekas, D. Bertsekas, 1972 .

A Distributed Algorithm for the Assignment Problem

D. Bertsekas, March, 2022 .

THEVENIN DECOMPOSITION 1 AND LARGE-SCALE OPTIMIZATION

D. Bertsekas, 1993 .

Modified Auction Algorithm for Shortest Paths

D. Bertsekas, 2022 .

Multiagent Rollout Algorithms and Reinforcement Learning

D. Bertsekas, 2019, ArXiv.

Gradient Convergence in Gradient Methods 1

D. Bertsekas, J. Tsitsiklis, 1997 .

Q-learning and policy iteration algorithms for stochastic shortest path problems

D. Bertsekas, Huizhen Yu, 2012, Annals of Operations Research.

Lessons from AlphaZero for Optimal, Model Predictive, and Adaptive Control

D. Bertsekas, 2021, ArXiv.

Rollout Algorithms and Approximate Dynamic Programming for Bayesian Optimization and Sequential Estimation

D. Bertsekas, 2022, ArXiv.

Multiagent Reinforcement Learning: Rollout and Policy Iteration for POMDP with Application to Multi-Robot Problems

D. Bertsekas, Stephanie Gil, Sahil Badyal, 2022 .

Reinforcement Learning and Optimal ControlA Selective Overview

D. Bertsekas, 2018 .

Multiagent Reinforcement Learning: Rollout and Policy Iteration

Dimitri Bertsekas, D. Bertsekas, 2021, IEEE/CAA Journal of Automatica Sinica.

April 1998 LIDS-P-2413 ROLLOUT ALGORITHMS FOR STOCHASTIC SCHEDULING PROBLEMS

David A. Castafion, D. Bertsekas, 2006 .

Missile Defense and Interceptor Allocation by

Dimitri P. Bertsekas, Stephen D. Patek, Nils Sandell, 2000 .

Play selection in American football: a case study in neuro-dynamic programming

Dimitri P. Bertsekas, Stephen D. Patek, D. Bertsekas, 1997 .

Neuro-Dynamic Programming

Dimitri P. Bertsekas, D. Bertsekas, 2009, Encyclopedia of Optimization.

Dynamic Programming and Optimal Control 4 th Edition , Volume II

Dimitri P. Bertsekas, D. Bertsekas, 2015 .

Pathologies of temporal difference methods in approximate dynamic programming

Dimitri P. Bertsekas, D. Bertsekas, 2010, 49th IEEE Conference on Decision and Control (CDC).

Constrained Multiagent Rollout and Multidimensional Assignment with the Auction Algorithm

D. Bertsekas, 2020, ArXiv.

Rollout Algorithms for Discrete Optimization: A Survey

Dimitri P. Bertsekas, D. Bertsekas, 2012 .

Convex Optimization Theory Chapter 1 Exercises and Solutions : Extended Version

D. Bertsekas, 2010 .

Routing and Wavelength Assignment in Optical Networks 1

Asuman Ozdaglar, Dimitri P. Bertsekas, A. Ozdaglar, 2001 .

An ε-Relaxation Method for Separable Convex Cost Network Flow Problems

Paul Tseng, Dimitri P. Bertsekas, Lazaros Polymenakos, 1997, SIAM J. Optim..

ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems

D. Bertsekas, P. Tseng, L. Polymenakos, 1997 .

Parallel computing in network optimization

Dimitri P. Bertsekas, Decision Systems., D. Bertsekas, 1994 .

A generic auction algorithm for the minimum cost network flow problem

Dimitri P. Bertsekas, David A. Castañón, D. Bertsekas, 1993, Comput. Optim. Appl..

An auction/sequential shortest path algorithm for the minimum cost network flow problem

Dimitri P. Bertsekas, Decision Systems., D. Bertsekas, 1992 .

RELAXT-III : a new and improved version of the RELAX code

Dimitri P. Bertsekas, Decision Systems., Paul. Tseng, 1990 .

Algorithms for Nonlinear Multicommodity Network Flow Problems

Dimitri P. Bertsekas, D. Bertsekas, 1979 .

CONFERENCE IN NUMERICAL ANALYSIS (NumAn 2007) RECENT APPROACHES TO NUMERICAL ANALYSIS: THEORY, METHODS AND APPLICATIONS

D. Bertsekas, P. Ligomenides, C. Tsallis, 2007 .

Results in Control and Optimization

D. Bertsekas, 2020 .

Class Notes for ASU Course CSE 691; Spring 2023 Topics in Reinforcement Learning

D. Bertsekas, 2023 .

Newton’s method for reinforcement learning and model predictive control

D. Bertsekas, 2022, Results in Control and Optimization.

Control of Stochastic Systems

Sean P. Meyn, Dimitri P. Bertsekas, R. L. Tweedie, 2009 .

Stochastic First-Order Methods with Random Constraint Projection

Dimitri P. Bertsekas, Mengdi Wang, D. Bertsekas, 2016, SIAM J. Optim..

Necessary and sufficient conditions for existence of an optimal portfolio

Dimitri P. Bertsekas, D. Bertsekas, 1974 .

Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems pdf

Stephanie Gil, Dimitri Bertsekas, Sushmita Bhattacharya, 2020, CoRL.

Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration With Application to Autonomous Sequential Repair Problems

Stephanie Gil, Dimitri Bertsekas, Sushmita Bhattacharya, 2020, IEEE Robotics and Automation Letters.

A survey of some aspects of parallel and distributed iterative algorithms

John N. Tsitsiklis, Dimitri P. Bertsekas, Decision Systems., 1989 .

On-Line Policy Iteration for Infinite Horizon Dynamic Programming pdf

Dimitri Bertsekas, D. Bertsekas, 2021, ArXiv.

Multiagent Value Iteration Algorithms in Dynamic Programming and Reinforcement Learning pdf

Dimitri Bertsekas, D. Bertsekas, 2020, Results in Control and Optimization.

Reinforcement Learning Methods for Wordle: A POMDP/Adaptive Control Approach

D. Bertsekas, Amrita Bhattacharjee, Siddhant Bhambri, 2022, ArXiv.

Distributed asynchronous policy iteration in dynamic programming

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

PARALLEL ASYNCHRONOUS PRIMAL-DUAL METHODS FOR THE MINIMUM COST FLOW PROBLEM'

Dimitri P. Bertsekas, Decision Systems., David A. Castanon, 1990 .

The auction algorithm for the minimum cost network flow problem

Dimitri P. Bertsekas, Decision Systems., David A. Castanon, 1989 .

Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task

Emmanouel A. Varvarigos, Dimitri P. Bertsekas, D. Bertsekas, 1995, Parallel Comput..

Partial Multinode Broadcast Algorithms for D-Dimensional Meshes

Emmanouel A. Varvarigos, Dimitri P. Bertsekas, D. Bertsekas, 1992, ICPP.

Existence of optimal stationary policies in deterministic optimal control

Dimitri P. Bertsekas, Steven E. Shreve, D. Bertsekas, 1979 .

Asymptotic Optimality of Shortest Path Routing Algorithms* -2

D. Bertsekas, E. Gafni, 1983 .

A Least Squares Q-Learning Algorithm for Optimal Stopping Problems

D. Bertsekas, Huizhen Yu, 2007 .

Dynamic Broadcasting in Parallel Computing

Emmanouel A. Varvarigos, Dimitri P. Bertsekas, D. Bertsekas, 1995, IEEE Trans. Parallel Distributed Syst..

ExpertRNA: A New Framework for RNA Secondary Structure Prediction

D. Bertsekas, G. Pedrielli, P. Šulc, 2022, INFORMS journal on computing.

TECHNICAL NOTE On the Convergence Properties of Second-Order Multiplier Methods 1

D. Bertsekas, 1978 .

The Bivariate Normal Distribution

D. Bertsekas, J. Tsitsiklis, The, 2003 .

Distributed Asynchronous Policy Iteration for Sequential Zero-Sum Games and Minimax Control

D. Bertsekas, 2021, ArXiv.

Regular Policies in Abstract Dynamic Programming

Dimitri P. Bertsekas, D. Bertsekas, 2016, SIAM J. Optim..

Multiagent Reinforcement Learning for Autonomous Routing and Pickup Problem with Adaptation to Variable Demand

D. Bertsekas, Stephanie Gil, Sushmita Bhattacharya, 2022, IEEE International Conference on Robotics and Automation.

Rollout, Approximate Policy Iteration, and Distributed Reinforcement Learning

D. Bertsekas, 2020 .

New error bounds for approximations from projected linear equations

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

Projected equation methods for approximate solution of large linear systems

D. Bertsekas, Huizhen Yu, 2008 .

LIDS-P-2819 1 Approximate Simulation-Based Solution of Large-Scale Least Squares Problems ∗

D. Bertsekas, Mengdi Wang, N. Polydorides, 1998 .

Affine Monotonic and Risk-Sensitive Models in Dynamic Programming

Dimitri Bertsekas, D. Bertsekas, 2016, IEEE Transactions on Automatic Control.

Biased Aggregation, Rollout, and Enhanced Policy Improvement for Reinforcement Learning pdf

Dimitri P. Bertsekas, D. Bertsekas, 2019, ArXiv.

Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems

Satinder Singh, D. Bertsekas, 1996, NIPS.

Solution of Large-Scale Optimal Unit Commitment Problems

D. Bertsekas, N. Sandell, G. Lauer, 1982, IEEE Transactions on Power Apparatus and Systems.

Nonlinear Programming 2 nd Edition Solutions Manual

D. Bertsekas, 2005 .

Auction-Based Learning for Question Answering over Knowledge Graphs

D. Bertsekas, Garima Agrawal, Huan Liu, 2023, Inf..

Data Networks

R. Gallager, D. Bertsekas, 1986 .

9 Improved Temporal Difference Methods with Linear Function Approximation

D. Bertsekas, V. Borkar, 2008 .

Nonlinear Programming

D. Bertsekas, 1995 .

Graphical models and message-passing algorithms for network-constrained decision problems

Greg, Jason K. Johnson, Wee Peng Tay, 2008 .

An Auction Algorithm for Shortest Pathsi

D. Bertsekas, 2022 .

Dynamic programming and optimal control, 3rd Edition

D. Bertsekas, 1995 .

e-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems*

D. Bertsekas, P. Tseng, L. Polymenakos, 2023 .

An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems | SIAM Journal on Optimization | Vol. 7, No. 3 | Society for Industrial and Applied Mathematics

D. Bertsekas, P. Tseng, L. Polymenakos, 1997 .

Optimal Scheduling Of Large Hydrothermal Power Systems

Dimitri Bertsekas, John Shaw, Robert Gendron, 1985, IEEE Transactions on Power Apparatus and Systems.

Dynamic Programming and Optimal Control 3rd Edition, Volume II

D. Bertsekas, 2010 .

Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey

D. Bertsekas, 2015, ArXiv.

Discretized Approximations for POMDP with Average Cost pdf

Dimitri P. Bertsekas, Huizhen Yu, D. Bertsekas, 2004, UAI.

Network optimization : continuous and discrete models

D. Bertsekas, 1998 .

Dynamic Programming: Deterministic and Stochastic Models

D. Bertsekas, 1987 .

Introduction to Probability

D. Bertsekas, J. Tsitsiklis, John B. Thomas, 2002 .

Distributed Asynchronous Policy Iteration for Sequential Zero-Sum Games and Minimax Control pdf

Dimitri Bertsekas, D. Bertsekas, 2021, ArXiv.

Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming

D. Bertsekas, 2017, IEEE Transactions on Neural Networks and Learning Systems.

ARPANET Routing Algorithm Improvements

Eric C. Rosen, John M. McQuillan, Ira Richer, 1978 .

Parallel Shortest Paths Methods for Globally Optimal Trajectories

Roberto Musmanno, Dimitri P. Bertsekas, Francesca Guerriero, 1995 .

A Least Squares Q-Learning Algorithm for Optimal Stopping Problems

D. Bertsekas, Huizhen Yu, A. Whitaker, 2007 .

Dynamic Programming and Optimal Control

A. Ozdaglar, D. Bertsekas, A. Nedić, 2010 .

Neuro-Dynamic Programming

D. Bertsekas, 2009, Encyclopedia of Optimization.

A forward/reverse auction algorithm for asymmetric assignment problems

D. Bertsekas, D. Castañón, 1992, Comput. Optim. Appl..

FOR THE MAX-FLOW PROBLEM

D. Bertsekas, 1994 .

Parallel Shortest Path Auction Algorithmsl

D. Bertsekas, L. Polymenakos, 1993 .

Distributed Asynchronous Computation of Fixed Points* 2. a Model for Distributed Asynchronous Fixed Point Algorithms

D. Bertsekas, A. U.S., 1983 .