Dimitri Bertsekas
#3,018
Most Influential Person Now
Greek computer scientist and mathematician
Dimitri Bertsekas's AcademicInfluence.com Rankings
Dimitri Bertsekascomputer-science Degrees
Computer Science
#285
World Rank
#297
Historical Rank
Programming
#10
World Rank
#10
Historical Rank
Dimitri Bertsekasmathematics Degrees
Mathematics
#442
World Rank
#879
Historical Rank
Control Theory
#1
World Rank
#2
Historical Rank
Measure Theory
#30
World Rank
#54
Historical Rank
Download Badge
Computer Science Mathematics
Dimitri Bertsekas's Degrees
- PhD Electrical Engineering Stanford University
- Masters Electrical Engineering Stanford University
- Bachelors Electrical Engineering National Technical University of Athens
Why Is Dimitri Bertsekas Influential?
(Suggest an Edit or Addition)According to Wikipedia, Dimitri Panteli Bertsekas is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology , Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe.
Dimitri Bertsekas's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Dynamic Programming and Optimal Control (1995) (10579)
- Nonlinear Programming (1995) (9046)
- Data Networks (1986) (6904)
- Parallel and Distributed Computation: Numerical Methods (1989) (5668)
- Constrained Optimization and Lagrange Multiplier Methods (1982) (4277)
- Neuro-Dynamic Programming (2009) (4110)
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators (1992) (2762)
- Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms (1984) (1887)
- Parallel and distributed computation (1989) (1528)
- Stochastic optimal control : the discrete time case (2007) (1455)
- Dynamic Programming: Deterministic and Stochastic Models (1987) (1407)
- Introduction to Probability (2002) (1295)
- Data networks (2nd ed.) (1992) (1150)
- Network optimization : continuous and discrete models (1998) (905)
- Convex Analysis and Optimization (2003) (889)
- Dynamic Programming and Stochastic Control (1977) (799)
- Recursive state estimation for a set-membership description of uncertainty (1971) (709)
- Projected Newton methods for optimization problems with simple constraints (1981) (669)
- Incremental subgradient methods for nondifferentiable optimization (1999) (651)
- On the Goldstein-Levitin-Polyak gradient projection method (1974) (607)
- Convex Optimization Algorithms (2015) (591)
- The auction algorithm: A distributed relaxation method for the assignment problem (1988) (590)
- An Analysis of Stochastic Shortest Path Problems (1991) (568)
- Dynamic Programming and Optimal Control, Vol. II (1976) (528)
- Gradient Convergence in Gradient methods with Errors (1999) (450)
- Neuro-dynamic programming: an overview (1995) (445)
- On the minimax reachability of target sets and target tubes (1971) (435)
- Auction algorithms for network flow problems: A tutorial introduction (1992) (427)
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology (1981) (420)
- Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey (2015) (414)
- Reinforcement Learning and Optimal Control by (2018) (372)
- Linear network optimization - algorithms and codes (1991) (370)
- Projection methods for variational inequalities with application to the traffic assignment problem (1982) (350)
- Rollout Algorithms for Stochastic Scheduling Problems (1998) (343)
- Multiplier methods: A survey (1975) (342)
- Incremental proximal methods for large scale convex optimization (2011) (340)
- A New Class of Incremental Gradient Methods for Least Squares Problems (1997) (324)
- Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC (2005) (321)
- Approximate Dynamic Programming (2010) (315)
- Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems (1996) (281)
- Convergence Rate of Incremental Subgradient Algorithms (2001) (274)
- Convex Optimization Theory (2009) (272)
- Approximate policy iteration: a survey and some new methods (2011) (270)
- Infinite time reachability of state-space regions by using feedback control (1972) (268)
- Data Networks, Second Edition (1992) (266)
- A new algorithm for the assignment problem (1981) (266)
- The Auction Algorithm for Assignment and Other Network Flow Problems (1990) (264)
- TWO-METRIC PROJECTION METHODS FOR CONSTRAINED OPTIMIZATION* (1984) (263)
- Routing and wavelength assignment in optical networks (2003) (260)
- Rollout Algorithms for Combinatorial Optimization (1997) (257)
- Distributed asynchronous computation of fixed points (1983) (256)
- Dynamic programming and optimal control, 3rd Edition (2005) (234)
- Least Squares Policy Evaluation Algorithms with Linear Function Approximation (2003) (229)
- Dynamic Programming and Optimal Control 3rd Edition, Volume II (2010) (228)
- Optimal short-term scheduling of large-scale power systems (1981) (226)
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (1988) (202)
- Adaptive aggregation methods for infinite horizon dynamic programming (1989) (192)
- Learning Algorithms for Markov Decision Processes with Average Cost (2001) (190)
- On the convergence of the exponential multiplier method for convex programming (1993) (187)
- Parallel synchronous and asynchronous implementations of the auction algorithm (1991) (186)
- Solution of Large-Scale Optimal Unit Commitment Problems (1982) (184)
- A neuro-dynamic programming approach to retailer inventory management (1997) (184)
- Convergence of discretization procedures in dynamic programming (1975) (182)
- Incremental least squares methods and the extended Kalman filter (1994) (182)
- Necessary and sufficient conditions for a penalty method to be exact (1975) (181)
- Distributed Asynchronous Incremental Subgradient Methods (2001) (175)
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks (1984) (167)
- The auction algorithm for the transportation problem (1989) (167)
- Some aspects of parallel and distributed iterative algorithms - A survey, (1991) (161)
- Dynamic Programming and Optimal Control, Two Volume Set (1995) (153)
- Optimal Communication Algorithms for Hypercubes (1991) (145)
- Temporal Differences-Based Policy Iteration and Applications in Neuro-Dynamic Programming (1996) (139)
- Abstract Dynamic Programming (2013) (137)
- Dynamic behavior of shortest path routing algorithms for communication networks (1982) (127)
- ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION (1976) (125)
- An Auction Algorithm for Shortest Paths (1991) (123)
- A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS (1973) (122)
- Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming (2015) (119)
- A simple and fast label correcting algorithm for shortest paths (1993) (119)
- Convergence Results for Some Temporal Difference Methods Based on Least Squares (2009) (119)
- Relaxation methods for network flow problems with convex arc costs (1987) (118)
- Distributed asynchronous relaxation methods for convex network flow problems (1987) (118)
- Dual coordinate step methods for linear network flow problems (1988) (117)
- Nondifferentiable optimization via approximation (1975) (115)
- RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems (1994) (115)
- Stochastic optimization problems with nondifferentiable cost functionals (1973) (114)
- Distributed dynamic programming (1981) (114)
- Feature-based aggregation and deep reinforcement learning: a survey and some new implementations (2018) (113)
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems (1989) (109)
- Convexification procedures and decomposition methods for nonconvex optimization problems (1979) (109)
- A forward/reverse auction algorithm for asymmetric assignment problems (1992) (105)
- Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems (1973) (103)
- Missile defense and interceptor allocation by neuro-dynamic programming (2000) (101)
- Projected Newton methods and optimization of multicommodity flows (1982) (100)
- Control of uncertain systems with a set-membership description of the uncertainty (1971) (99)
- Distributed asynchronous optimal routing in data networks (1984) (98)
- Combined Primal–Dual and Penalty Methods for Convex Programming (1976) (91)
- Optimal Scheduling Of Large Hydrothermal Power Systems (1985) (91)
- A new penalty function method for constrained minimization (1972) (90)
- Dynamic Control of Session Input Rates in Communication Networks (1982) (90)
- Temporal Dierences-Based Policy Iteration and Applications in Neuro-Dynamic Programming 1 (1997) (88)
- Partially asynchronous, parallel algorithms for network flow and other problems (1990) (88)
- Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules" (2007) (85)
- Projected equation methods for approximate solution of large linear systems (2009) (85)
- Numerical methods for constrained optimization (1976) (83)
- Distributed power control algorithms for wireless networks (1999) (80)
- The effect of deterministic noise in subgradient methods (2010) (80)
- Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems (1987) (80)
- Parallel asynchronous label-correcting methods for shortest paths (1996) (79)
- Stochastic Shortest Path Games (1999) (79)
- COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION* (1975) (78)
- The relax codes for linear minimum cost network flow problems (1988) (76)
- Nonlinear Programming 2 (2005) (73)
- Incremental constraint projection methods for variational inequalities (2014) (71)
- Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms (1997) (71)
- An Alternating Direction Method for Linear Programming (1990) (70)
- Approximation procedures based on the method of multipliers (1977) (69)
- 6.253 Convex Analysis and Optimization, Spring 2010 (2004) (67)
- Convergence rate and termination of asynchronous iterative algorithms (1989) (65)
- New error bounds for approximations from projected linear equations (2008) (65)
- Reverse Auction and the Solution of Inequality Constrained Assignment Problems (1993) (64)
- Relaxation methods for problems with strictly convex separable costs and linear constraints (1987) (64)
- A distributed asynchronous relaxation algorithm for the assignment problem (1985) (63)
- Q-learning and enhanced policy iteration in discounted dynamic programming (2010) (63)
- Implementation of efficient algorithms for globally optimal trajectories (1998) (62)
- Partial Proximal Minimization Algorithms for Convex Pprogramming (1994) (61)
- Network Flows and Monotropic Optimization (R. T. Rockafellar) (1985) (61)
- Stochastic First-Order Methods with Random Constraint Projection (2016) (61)
- Necessary and sufficient conditions for existence of an optimal portfolio (1974) (61)
- Temporal Difference Methods for General Projected Equations (2011) (57)
- Gradient convergence in gradient methods (1997) (56)
- Distributed relaxation methods for linear network flow problems (1986) (55)
- Incremental Constraint Projection-Proximal Methods for Nonsmooth Convex Optimization (2013) (52)
- A unified framework for primal-dual methods in minimum cost network flow problems (1985) (51)
- Discretized Approximations for POMDP with Average Cost (2004) (51)
- Q-learning and policy iteration algorithms for stochastic shortest path problems (2013) (51)
- Basis function adaptation methods for cost approximation in MDP (2009) (51)
- A Counterexample to Temporal Differences Learning (1995) (51)
- Auction Algorithms (2009) (50)
- Rollout Algorithms for Discrete Optimization: A Survey (2012) (49)
- Incremental Aggregated Proximal and Augmented Lagrangian Algorithms (2015) (48)
- Optimal Solution of Integer Multicommodity Flow Problems With Application in Optical Networks (2004) (48)
- A Distributed Algorithm for the Assignment Problem (2022) (47)
- Monotone Mappings with Application in Dynamic Programming (1977) (47)
- Communication algorithms for isotropic tasks in hypercubes and wraparound meshes (1992) (45)
- Multiplier methods for convex programming (1973) (45)
- Alternative theoretical frameworks for finite horizon discrete-time stochastic optimal control (1977) (43)
- Finite Termination of Asynchronous Iterative Algorithms (1996) (43)
- A Unifying Polyhedral Approximation Framework for Convex Optimization (2011) (43)
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (1991) (42)
- Polynomial auction algorithms for shortest paths (1995) (41)
- A class of optimal routing algorithms for communication networks (1980) (41)
- Universally Measurable Policies in Dynamic Programming (1979) (40)
- Multiagent Reinforcement Learning: Rollout and Policy Iteration (2021) (38)
- Extended Monotropic Programming and Duality (2008) (38)
- Enlarging the region of convergence of Newton's method for constrained optimization (1982) (38)
- Parallel Asynchronous Hungarian Methods for the Assignment Problem (1993) (37)
- Q-learning algorithms for optimal stopping based on least squares (2007) (36)
- Rollout Algorithms for Constrained Dynamic Programming (2005) (34)
- Approximate solution methods for partially observable markov and semi-markov decision processes (2006) (34)
- ARPANET Routing Algorithm Improvements (1978) (33)
- Stochastic shortest path games: theory and algorithms (1997) (32)
- Estimates of the duality gap for large-scale separable nonconvex optimization problems (1982) (32)
- Stochastic Shortest Path Problems Under Weak Conditions (2013) (32)
- Separable Dynamic Programming and Approximate Decomposition Methods (2007) (31)
- A generic auction algorithm for the minimum cost network flow problem (1993) (31)
- Vector space approach to models and optimization (1977) (31)
- Distributed asynchronous policy iteration in dynamic programming (2010) (31)
- On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP (2008) (30)
- An auction algorithm for the max-flow problem (1995) (30)
- CONVERGENCE OF A GRADIENT PROJECTION METHOD (1982) (30)
- An ε-Relaxation Method for Separable Convex Cost Network Flow Problems (1997) (28)
- An ε-relaxation method for separable convex cost generalized network flow problems (2000) (28)
- Optimal routing and flow control methods for communication networks (1982) (28)
- Multiagent Rollout Algorithms and Reinforcement Learning (2019) (28)
- Convergence rate of penalty and multiplier methods (1973) (28)
- Dynamic programming & optimal control , volume i (2014) (27)
- The relation between pseudonormality and quasiregularity in constrained optimization (2004) (27)
- On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems (2013) (27)
- The auction algorithm for the minimum cost network flow problem (1989) (27)
- Lessons from AlphaZero for Optimal, Model Predictive, and Adaptive Control (2021) (27)
- On the method of multipliers for convex programming (1975) (27)
- Set Intersection Theorems and Existence of Optimal Solutions (2007) (26)
- The Bivariate Normal Distribution (2003) (26)
- Robust shortest path planning and semicontractive dynamic programming (2016) (25)
- Lambda-Policy Iteration: A Review and a New Implementation (2013) (25)
- A Least Squares Q-Learning Algorithm for Optimal Stopping Problems (2007) (25)
- Relaxation methods for monotropic programs (1990) (25)
- Relaxation Methods for Linear Programs (1987) (25)
- Parallel computing in network optimization (1994) (25)
- Algorithms for Nonlinear Multicommodity Network Flow Problems (1979) (23)
- Parallel Shortest Path Auction Algorithms (1994) (22)
- Dynamic models of shortest path routing algorithms for communication networks with multiple destinations (1979) (22)
- Convergence theories of distributed iterative processes: A survey (1986) (22)
- Projected Equations, Variational Inequalities, and Temporal Difference Methods (2009) (22)
- Rollout Algorithms for Constrained Dynamic Programming 1 (2005) (22)
- A New Value Iteration method for the Average Cost Dynamic Programming Problem (1998) (21)
- Introduction to Probability Vol. 1 (2002) (21)
- Reinforcement Learning for POMDP: Partitioned Rollout and Policy Iteration With Application to Autonomous Sequential Repair Problems (2020) (21)
- A Quasi Monte Carlo Method for Large-Scale Inverse Problems (2012) (21)
- Enhanced Optimality Conditions and Exact Penalty Functions (2000) (21)
- Asymptotic optimality of shortest path routing algorithms (1987) (21)
- Enhanced Optimality Conditions and Exact Penalty Functions 1 (2000) (20)
- A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies (2013) (20)
- Dynamic Programming and Suboptimal Control: From ADP to MPC (2005) (20)
- Partial conjugate gradient methods for a class of optimal control problems (1974) (20)
- Performance of hypercube routing schemes with or without buffering (1994) (20)
- Parallel primal-dual methods for the minimum cost flow problem (1993) (19)
- RELAX: a computer code for minimum cost network flow problems (1985) (19)
- On the minimax feedback control of uncertain dynamic systems (1971) (18)
- A survey of some aspects of parallel and distributed iterative algorithms (1989) (18)
- Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems (2014) (18)
- Multiagent Value Iteration Algorithms in Dynamic Programming and Reinforcement Learning (2020) (18)
- Parallel and distributed iterative algorithms : a selective survey (1988) (18)
- On the solution of some minimax problems (1972) (17)
- Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets (1993) (17)
- Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals (1971) (17)
- Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation (1984) (17)
- Dynamic Broadcasting in Parallel Computing (1995) (16)
- Relaxation methods for minimum cost network flow problems (1983) (16)
- The Method of Multipliers for Equality Constrained Problems (1982) (16)
- Stable Optimal Control and Semicontractive Dynamic Programming (2017) (16)
- A hybrid incremental gradient method for least squares problems (1994) (15)
- A new algorithm for solution of resistive networks involving diodes (1976) (15)
- Affine Monotonic and Risk-Sensitive Models in Dynamic Programming (2016) (15)
- Dynamic Programming and Optimal Control 4 th Edition , Volume II (2015) (15)
- Multiagent Rollout and Policy Iteration for POMDP with Application to Multi-Robot Repair Problems (2020) (14)
- Nonlinear Programming 3 rd Edition Theoretical Solutions Manual Chapter 6 (2016) (14)
- Solution of Large Systems of Equations Using Approximate Dynamic Programming Methods (2007) (14)
- Weighted Bellman Equations and their Applications in Approximate Dynamic Programming ∗ (2012) (14)
- Validation of algorithms for optimal routing of flow in networks (1978) (14)
- Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes (1994) (13)
- Min Common/Max Crossing Duality: A Simple Geometric Framework for Convex Optimization and Minimax Theory1 (2003) (13)
- Enhanced Fritz John Conditions for Convex Programming (2006) (13)
- Linear convex stochastic control problems over an infinite horizon (1973) (13)
- The Method of Multipliers for Inequality Constrained and Nondifferentiable Optimization Problems (1982) (13)
- Computation of production control policies by a dynamic programming technique (1982) (12)
- Dynamic programming and optimal control . Dynamic Programming and Optimal Control (2018) (12)
- Biased Aggregation, Rollout, and Enhanced Policy Improvement for Reinforcement Learning (2019) (12)
- Missile Defense and Interceptor Allocation by (2000) (12)
- An auction/sequential shortest path algorithm for the minimum cost network flow problem (1992) (12)
- Monotone mappings in dynamic programming (1975) (11)
- Regular Policies in Abstract Dynamic Programming (2016) (11)
- Pathologies of temporal difference methods in approximate dynamic programming (2010) (10)
- Rollout algorithms: an overview (1999) (10)
- Min Common / Max Crossing Duality : A Geometric View of Conjugacy in Convex Optimization (2008) (10)
- Partial Solutions Manual Parallel and Distributed Computation : Numerical Methods (1997) (10)
- Path assignment for virtual circuit routing (1983) (9)
- On error bounds for successive approximation methods (1976) (9)
- Distributed Computation of Fixed Points. (1981) (9)
- ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems (1997) (9)
- PARALLEL ASYNCHRONOUS PRIMAL-DUAL METHODS FOR THE MINIMUM COST FLOW PROBLEM' (1990) (8)
- Distributed Asynchronous Policy Iteration for Sequential Zero-Sum Games and Minimax Control (2021) (8)
- Thevenin decomposition and large-scale optimization (1996) (8)
- On the convergence properties of second-order multiplier methods (1978) (8)
- Asymptotic optimality of shortest path routing (1983) (8)
- Existence of optimal stationary policies in deterministic optimal control (1979) (8)
- Constrained Multiagent Rollout and Multidimensional Assignment with the Auction Algorithm (2020) (8)
- RELAXT-III : a new and improved version of the RELAX code (1990) (8)
- Stochastic optimization problems with nondifferentiable cost functionals with an application in stochastic programming (1972) (7)
- Relaxation methods for problems with strictly convex costs and linear inequality constraints (1987) (7)
- Notes on Optimal Routing and Flow Control for Communication Networks. (1981) (7)
- A Conflict Sense Routing Protocol and Its Performance for Hypercubes (1996) (7)
- On the convergence of simulation-based iterative methods for solving singular linear systems (2013) (7)
- Local Convex Conjugacy and Fenchel Duality (1978) (7)
- Approximate Solution of Large-Scale Linear Inverse Problems with Monte Carlo Simulation ∗ (2009) (7)
- Some issues in distributed asynchronous routing in virtual circuit data networks (1986) (7)
- Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow (1994) (6)
- Proper Policies in Infinite-State Stochastic Shortest Path Problems (2017) (6)
- On-Line Policy Iteration for Infinite Horizon Dynamic Programming (2021) (6)
- Optimal and Neuro—Dynamic Programming Solutions for a Stochastic Inventory Transportation Problem (2001) (6)
- Augmented Lagrangian and differentiable exact penalty methods (1981) (5)
- ExpertRNA: A New Framework for RNA Secondary Structure Prediction (2022) (5)
- Corrections for the book NONLINEAR PROGRAMMING: 2ND (2005) (5)
- DYNAMIC PROGRAMMING IN BOREL SPACES (1978) (5)
- Note on the design of linear systems with piecewise constant feedback gains (1970) (5)
- Newton's Method for Linear Optimal Control Problems* (1976) (5)
- Generic rank-one corrections for value iteration in Markovian decision problems (1995) (5)
- Proximal Algorithms and Temporal Differences for Large Linear Systems: Extrapolation, Approximation, and Simulation (2016) (5)
- A Note on Error Bounds for Convex and Nonconvex Programs (1999) (5)
- A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems (1996) (5)
- Play selection in American football: a case study in neuro-dynamic programming (1997) (5)
- Optimal Control Theory An Introduction Dover Books On Electrical Engineering (2019) (4)
- Adaptive aggregation methods for discounted dynamic programming (1986) (4)
- MATHEMATICAL ISSUES IN DYNAMIC PROGRAMMING (2002) (4)
- Lagrange Multipliers with Optimal Sensitivity Properties in Constrained Optimization (2006) (4)
- Chapter 5 Parallel computing in network optimization (1995) (4)
- On the Convergence of Iterative Simulation-Based Methods for Singular Linear Systems (2012) (4)
- Reservation-based session routing for broadband communication networks with strict QoS requirements (2001) (4)
- Rollout, Approximate Policy Iteration, and Distributed Reinforcement Learning (2020) (4)
- Proximal algorithms and temporal difference methods for solving fixed point problems (2018) (4)
- Control of Stochastic Systems (2009) (4)
- Neuro-Dynamic Programming: An Overview and Recent Results (2006) (4)
- Convergence of the feasible region in infinite horizon optimization problems (1972) (4)
- Centralized and Distributed Newton Methods for Network Optimization and Extensions (2015) (4)
- Globally convergent Newton methods for constrained optimization using differentiable exact penalty functions (1980) (4)
- The Auction Algorithm: A . . . (1988) (4)
- Nonquadratic Penalty Functions — Convex Programming (1982) (3)
- NEW ALGORITHMS FOR ASSIGNMENT AND TRANSPORTATION PROBLEMS (1979) (3)
- Efficient algorithms for continuous-space shortest path problems (1995) (3)
- Convex Analysis and Optimization Chapter 1 Solutions (2008) (3)
- Infinite-Space Shortest Path Problems and Semicontractive Dynamic Programming † (2014) (3)
- Preconditioned conjugate gradient methods for optimal control problems with delays with application in hydroelectric power systems scheduling (1983) (3)
- Dynamic Programming and Optimal Control Volume 1 SECOND EDITION (2000) (3)
- Rollout Algorithms for Combinatorial Optimization 1 (1997) (3)
- Newton’s method for reinforcement learning and model predictive control (2022) (3)
- ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS (1987) (3)
- ASYNCHRONOUS DETERMINISTIC AND STOCHASTIC GRADIENT OPTIMIZATION ALGORITHMSt (3)
- Distributed Reinforcement Learning, Rollout, and Approximate Policy Iteration (2020) (2)
- Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task (1995) (2)
- Decomposition algorithms for large-scale nonconvex optimization problems (1976) (2)
- Modified auction algorithms for shortest paths (1992) (2)
- Epsilon-relaxation and auction algorithms for the convex cost network flow problem (1995) (2)
- Erratum to "Comments on 'Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'" (2007) (2)
- Play selection in football : a case study in neuro-dynamic programming (1996) (2)
- Second Ed Ition Data Networks Multiaccess Communication 4.1 Introduction (2009) (2)
- New value iteration and Q-learning methods for the average cost dynamic programming problem (1998) (2)
- Nonlinear Programming 2 nd Edition Solutions Manual (2005) (2)
- On the Convergence of Simulation-Based Iterative Methods for Singular Linear Systems (2012) (2)
- LIDS-P-2819 1 Approximate Simulation-Based Solution of Large-Scale Least Squares Problems ∗ (1998) (2)
- Exact Penalty Methods and Lagrangian Methods (1982) (2)
- Relaxation Method for Linear Programs with Side Constraints (1987) (2)
- IMPROVED TEMPORAL DIFFERENCE METHODS WITH LINEAR FUNCTION APPROXIMATION1 (2003) (2)
- 6.041 / 6.431 Probabilistic Systems Analysis and Applied Probability, Spring 2005 (2002) (2)
- Nonlinear Programming 3rd Edition Theoretical Solutions Manual Chapter 4 (2016) (1)
- Rollout Algorithms for Stochastic (1998) (1)
- Reinforcement Learning Methods for Wordle: A POMDP/Adaptive Control Approach (2022) (1)
- 6.231 Dynamic Programming and Stochastic Control, Fall 2008 (2002) (1)
- Equivalent stochastic and deterministic optimal control problems (1976) (1)
- Two-Level Form of the Kalman Filter (1971) (1)
- Optimal Scheduling of Large Hydrothermal Power Systems (1985) (1)
- Rollout Algorithms and Approximate Dynamic Programming for Bayesian Optimization and Sequential Estimation (2022) (1)
- A unified framework for temporal difference methods (2009) (1)
- ASYNCHRONOUS COMPUTATION OF FIXED POINTS (1)
- INCREMENTAL SUBGRADIENT METHODS1 FOR NONDIFFERENTIABLE OPTIMIZATION (2001) (1)
- NEW THEORETICAL FRAMEWORK FOR FINITE HORIZON STOCHASTIC CONTROL. (1976) (1)
- ExpertRNA: A new framework for RNA structure prediction (2021) (1)
- A VALUE ITERATION METHOD FOR THE 1 AVERAGE COST DYNAMIC PROGRAMMING PROBLEM (1)
- Neuro-Dynamic Optimal Control of a L-Lysine Fed-Batch Fermentation (2006) (1)
- Multiplier Methods: a Survey*t (1976) (1)
- Second Edition Data Networks (2009) (0)
- Security Classification of This Page (when Data Entered) " (1983) (0)
- Multiagent Reinforcement Learning for Autonomous Routing and Pickup Problem with Adaptation to Variable Demand (2022) (0)
- A Model for Uncoordinated Distributed Computation of Fixed Points. (1981) (0)
- THEVENIN DECOMPOSITIONi AND LARGE-SCALE OPTIMIZATION (0)
- Extended Monotropic Programming and Duality 1 (2010) (0)
- ON OPTIMAL ROUTING AND FLOW CONTROL FOR COMMUNICATION NETWORKSt by (0)
- Routing algorithms based on shortest paths (1980) (0)
- Revised November 1986 THE RELAX CODES FOR LINEAR MINIMUM COST NETWORK FLOW PROBLEMS by (0)
- Algorithms for Learning and Decision Making (2013) (0)
- THEVENIN DECOMPOSITION 1 AND LARGE-SCALE OPTIMIZATION (1993) (0)
- Standard One-Step Lookahead Rollout Algorithm : Start (2019) (0)
- Standard One-Step Lookahead Rollout Algorithm (2019) (0)
- Gradient Convergence in Gradient Methods 1 (1997) (0)
- Regular Policies in Stochastic Optimal Control and Abstract Dynamic Programming (2015) (0)
- New Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning (2022) (0)
- Reinforcement Learning and Optimal ControlASU, CSE 691, Winter 2019 (2019) (0)
- Chapter 4 Infinite Horizon Reinforcement Learning DRAFT (2019) (0)
- A Journey through Optimization (2015) (0)
- A note on the robust computation of rollout policies (1997) (0)
- Convex Optimization Theory Chapter 1 Exercises and Solutions : Extended Version (2010) (0)
- Áëìêááíììì Ëëaeaeàêçaeçíë Áaeaeêêååaeìä Ëíííêêêááaeì Ååìàççë (2000) (0)
- Multiagent Reinforcement Learning: Rollout and Policy Iteration for POMDP with Application to Multi-Robot Problems (2022) (0)
- THEVENIN DECOMPOSITION1 AND LARGE-SCALE OPTIMIZATION (2001) (0)
- Q-learning and policy iteration algorithms for stochastic shortest path problems (2012) (0)
- THE EFFECT OF DETERMINISTIC NOISE1 IN SUBGRADIENT METHODS (2008) (0)
- March 1994 LIDS-P-2237 INCREMENTAL LEAST SQUARES METHODSi AND THE EXTENDED KALMAN FILTER (0)
- Communication issues in parallel and distributed optimization algorithms (1988) (0)
- Proximal algorithms and temporal difference methods for solving fixed point problems (2018) (0)
- Convergence Analysis of Distributed Asynchronous Iterative Processes (1984) (0)
- LIDS-P-1997 PARALLEL ASYNCHRONOUS HUNGARIAN METHODS FOR THE ASSIGNMENT PROBLEMi (0)
- Routing and Wavelength Assignment in Optical Networks 1 (2001) (0)
- Incremental constraint projection methods for variational inequalities (2014) (0)
- Topics in Reinforcement Learning:Rollout and Approximate Policy IterationASU, CSE 691, Spring 2021Links to Class Notes, Videolectures, and Slides athttp://web.mit.edu/dimitrib/www/RLbook.html (2021) (0)
- 9 Improved Temporal Difference Methods with Linear Function Approximation (2008) (0)
- An Auction Algorithm for Shortest Pathsi (0)
- Optimal Scheduling ofLarge Hydrothermal PowerSystems (1985) (0)
- Asymptotic Optimality of Shortest Path Routing Algorithms* -2 (1983) (0)
- Reinforcement Learning and Optimal ControlASU, CSE 691, Winter 2020 (2020) (0)
- DYNhUIC MODELS OF SHORTEST PATH mING ALGORITHUS POR C!OHWNICATICN NETWRKS WITH KJLTIPLE DESTINATICNS (1979) (0)
- NO . TP 2-1 ON THE SOLUTION OF SOME MINIMAX PROBLEMS * (0)
- Corrections for Abstract Dynamic Programming (2014) (0)
- In This Issue –Technically (2007) (0)
- Main Results-Discounted Problems (2019) (0)
- Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning (2022) (0)
- 2019 Chapter 5 Infinite Horizon Reinforcement Learning SELECTED (2019) (0)
- Corrections for DYNAMIC PROGRAMMING AND OPTIMAL CONTROL : 3 RD , 4 TH , and EARLIER EDITIONS (2012) (0)
- FP2 - 4:30 ADAPTIVE AGGREGATION METHODS FOR DISCOUNTED DYNAMIC PROGRAMMING* (1986) (0)
- LIDS REPORT 2822 1 Approximate Solution of Large-Scale Linear Inverse Problems with Monte Carlo Simulation ∗ (2009) (0)
- November 1997 LIDS-P-2404 GRADIENT CONVERGENCE IN GRADIENT METHODS (0)
- Feature Selection and Basis Function Adaptation in Approximate Dynamic Programming (2009) (0)
- Forward path search : a new dual coordinate ascent algorithm for shortest paths (1990) (0)
- Partial Multinode Broadcast Algorithms for D-Dimensional Meshes (1992) (0)
- A DISTRIBUTED ASYSCHRONOUS RELAXATION ALGORITHlrI FOR THE ASSIGhXEST PROBLEN (1985) (0)
- April 1998 LIDS-P-2413 ROLLOUT ALGORITHMS FOR STOCHASTIC SCHEDULING PROBLEMS (2006) (0)
- M It Slibraries Disclaimer of Quality Two-metric Projection Methodst for Constrained Optimization (0)
- Proposal Approximate Dynamic Programming Using Bellman Residual Elimination (2008) (0)
- Planning and Scheduling: Dynamic Assignment and Scheduling with Contingencies (1998) (0)
- Second Ed ition Data Networks (2009) (0)
- P-2535 Routing and Wavelength Assignment in Optical Networks (2002) (0)
- TECHNICAL NOTE On the Convergence Properties of Second-Order Multiplier Methods 1 (1978) (0)
- FOR THE MAX-FLOW PROBLEM (1994) (0)
- Ecient Discriminative Training Method for Structured Predictions (2008) (0)
- AN C-RELAXATION METHOD FOR SEPARABLE CONVEX COST NETWORK FLOW PROBLEMS1 (0)
- Results in Control and Optimization (2020) (0)
- DIFFERENTIAL TRAINING OF 1 ROLLOUT POLICIES (2002) (0)
- FINDING MAXIMAL BENEFIT/MAXIMAL CARDINALITY ASSIGNMENTS (1992) (0)
- CONFERENCE IN NUMERICAL ANALYSIS (NumAn 2007) RECENT APPROACHES TO NUMERICAL ANALYSIS: THEORY, METHODS AND APPLICATIONS (2007) (0)
- Class Notes for ASU Course CSE 691; Spring 2023 Topics in Reinforcement Learning (2023) (0)
- North-holland 707 (1989) (0)
- Dual Coordinate Ascent Methods for Linear Network Flow Problems (0)
- Modified Auction Algorithm for Shortest Paths (0)
- LIDS REPORT 2871 1 Q-Learning and Policy Iteration Algorithms for Stochastic Shortest Path Problems ∗ (2012) (0)
- Parallel Shortest Paths Methods for Globally Optimal Trajectories (1995) (0)
- September 1994 LIDS-P-2267 A HYBRID INCREMENTAL GRADIENT METHOD 1 FOR LEAST SQUARES PROBLEMS (0)
- Relaxt-mii: a New and Improved Version of the Relax Code 1 (0)
This paper list is powered by the following services:
Other Resources About Dimitri Bertsekas
What Schools Are Affiliated With Dimitri Bertsekas?
Dimitri Bertsekas is affiliated with the following schools:
