- March 1992 LIDS -P -2098 Appeared in Networks, Vol. 23, pp. 703-709, 1993
- Projected Equations, Variational Inequalities, and Temporal Difference Methods
- SIAM J. OPTIM. c 2011 Society for Industrial and Applied Mathematics Vol. 21, No. 1, pp. 333360
- June 2007 (Revised November 2007) Report LIDS -2754 Solution of Large Systems of Equations Using
- Stochastic Optimization: Algorithms and Applications (S. Uryasev and P. M. Pardalos, Editors), pp. 263-304
- IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS -PART A., VOL. XX, NO. Y, MONTH 1999 100 IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS -PART A., VOL. XX, NO. Y, MONTH 1999 101
- Neuro-Dynamic Programming: An Dimitri P. Bertsekas
- December 1989 PARALLEL ASYNCHRONOUS HUNGARIAN
- Auction Algorithms Dimitri P. Bertsekas
- LEARNING ALGORITHMS FOR MARKOV DECISION PROCESSES WITH AVERAGE COST
- A NEW CLASS OF INCREMENTAL GRADIENT METHODS FOR LEAST SQUARES PROBLEMS
- MATHEMATICS OF OPERATIONS RESEARCH Vol. 35, No. 2, May 2010, pp. 306329
- 105Annalsof OperationsResearch14(1988)105-123 D.P. Bertsekas
- IEEE TRANSACTIONS ON AUTOMAllC CONTROL, YOLo AC-3I, NO.4, APRIL 1986 325 JOHN N. TSITSIKLIS, MEMBER,IEEE, ANDDIMITRI P. BERTSEKAS, FELLOW,IEEE
- August 2008 LIDS-P-2796 Revised Jan. 2009
- August 1993 (Revised April 1994) LIDS-P-2193 To appear in J.O.T.A.
- STOCHASTIC SHORTEST PATH GAMES STEPHEN D. PATEKy AND DIMITRI P. BERTSEKASz
- Mathematical Programming 55 (1992) 293-318 293 North-Holland
- 1 PLAY SELECTION IN AMERICAN FOOTBALL: A CASE STUDY IN
- Mathematical Programming 32 (1985)125-145 North-Holland
- SIAM J. OPTIMIZATION Vol. 4, No. 3, pp. 551-572, August 1994
- Appears in Proc. of the 35th Allerton Conference on Communication, Control, and Computing, Allerton Park, Ill., October 1997
- SIAM J. CONTROL AND OPTIMIZATION Vol. 25, No. 1, January 1987
- Math Programming, Vol. 60, pp. 1-19, 1993 On the Convergence of the Exponential Multiplier Method
- April 2010; Revised Oct. 2010 and May 2011 Report LIDS -2831 Q-Learning and Enhanced Policy Iteration in
- A Neuro-Dynamic Programming Approach to Retailer Inventory Management1
- JOURNAL OF OtrFIMIZATIONTHEORY AND APPLICATIONS:Vol,36, No. 2, FEBRUARY 1982 Enlarging the Region of Convergence of
- IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 5, MAY 2007 911 Separable Dynamic Programming and Approximate
- ESTlMATES OF THE DUALITY GAP FOR LARGE-SCALE SEPARABLE NONCONVFJ OPTIMIZATION PROBLMS* Dimitri P. Bertsekast Nils R . Sandell, Jr,T
- IEEE Transactions on Automatic Control, Vol. 43, 1998, pp. 278-283 Implementation of Efficient Algorithms for Globally
- A NEW VALUE ITERATION METHOD FOR THE AVERAGE COST DYNAMIC PROGRAMMING PROBLEM
- Basis Function Adaptation Methods for Cost Approximation in MDP
- May 1992 LIDS -P -2108 Auction Algorithms for Network Flow Problems
- IEEETRANSACTIONS ON AUTOMATIC CO~TROL, VOL. AC-28,NO. 1: JANUARY 1983 I Optimal Short-Term Scheduling of
- Appeared in Network Optimization, Pardalos, P. M., Hearn, D. W., and Hager, W. W. (eds.), Lecture Notes in Economics and Mathematical Systems, Springer-Verlag,
- ~'" ",O.iLr.,.:t:~(.e.\,on ~ J"" fo ""IA-.~O"\'\~c..eM.(.fn .~ ~~~) na~c-t.."'7".
- May 2005 Report LIDS 2632 To appear in the European J. on Control and the 2005 CDC Proceedings
- Neuro-Dynamic Programming: An Overview Dimitri Bertsekas
- Admission Control for Wireless Networks Cynara C. Wu Dimitri P. Bertsekas
- 1. Introduction AN -RELAXATION METHOD FOR SEPARABLE
- April 2011 Report LIDS -2866 Centralized and Distributed Newton Methods for
- 610 IEEE TRANSACTIONS ON AUTOMATICCONTROL, VOL. AC-27,NO. 3, JUNE 1982 withtwosnitch-over levels for a class of IY/G/I queuingsystems Pratin P. Varaiya (!W68-SM78-F'XO), for a photographandbiography.
- Polynomial Auction Algorithms for Shortest Paths1 Dimitri P. Bertsekas,2 Stefano Pallottino,3 and Maria Grazia Scutella'4
- October 1994 LIDS-P-2212 Published in Operations Research Letters
- Mathematical Programming 38 (1987)303-321 North-Holland
- Mathematical Programming42 (1988)203-243 North-Holland
- Pathologies of Approximate Policy Iteration in Dynamic Programming
- "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules"
- October 1990 (revised February 1991) LIDS -P -2000 SIAM J. on Optimization (to appear)
- Convex Optimization Theory Athena Scientific, 2009
- MATHEMATICAL ISSUES IN DYNAMIC PROGRAMMING
- April 2010 -Revised December 2010 and June 2011 Report LIDS -2833 A version appears in Journal of Control Theory and Applications, 2011
- Projected Equation Approximation Unified Framework for Projected Equations Simulation-Based Versions On Temporal Difference Methods and
- Classical Value and Policy Iteration for Discounted MDP Distributed Asynchronous Computation of Fixed Points Distributed Asynchronous Policy Iteration Inte New Exact and Approximate Policy Iteration Methods in
- LIDS REPORT 2822 1 Approximate Solution of Large-Scale Linear Inverse
- Report LIDS-P-2819 1 Approximate Simulation-Based Solution of
- Basis function tuning by gradient descent Automatic basis function generation Feature scaling Feature Selection and Basis Function Adaptation in
- Author's personal copy Journal of Computational and Applied Mathematics 227 (2009) 2750
- Math. Program., Ser. A DOI 10.1007/s10107-008-0262-5
- Q-Learning Algorithms for Optimal Stopping Based on Least Squares Huizhen Yu and Dimitri P. Bertsekas
- LIDS REPORT 2731 1 A Least Squares Q-Learning Algorithm for
- November 2004; revised January 2006 Report LIDS 2628 Set Intersection Theorems and Existence of
- SET INTERSECTION THEOREMS EXISTENCE OF OPTIMAL SOLUTIONS FOR
- July 2004 Report LIDS 2631 Enhanced Fritz John Conditions
- 9 Improved Temporal Difference Methods with Linear Function
- July 31, 2002 To appear in J. of DEDS LEAST SQUARES POLICY EVALUATION ALGORITHMS
- STOCHASTIC APPROXIMATION FOR NONEXPANSIVE MAPS: APPLICATION TO Q-LEARNING ALGORITHMS
- August 1996 (Revised August 1997) Report LIDS-P-2349 Temporal Differences-Based Policy Iteration
- NOTE Communicatedby Peter Dayan A Counterexample to Temporal Differences Learning
- December 2001 LIDS REPORT P-2535 Routing and Wavelength Assignment in
- November 2000 Submitted for publication to JOTA Pseudonormality and a Lagrange Multiplier Theory
- Digital Object Identifier (DOI) 10.1007/s101070000153 Math. Program., Ser. A 88: 85104 (2000)
- Proceedings of Allerton Conference, September 2000 Enhanced Optimality Conditions
- Distributed Power Control Algorithms for Wireless Networks
- January 1995 Appeared in SIAM J. on Optimization INCREMENTAL LEAST SQUARES METHODS1
- October 1993 LIDS-P-2204 Appears in J.O.T.A., Vol. 89, 1996, pp. 1-15.
- Mathematical Programming 46 (1990) 127-151 127 North-Holland
- Relaxation Methods for Linear Programs Author(s): Paul Tseng and Dimitri P. Bertsekas
- SIAM J. CONTROL AND OPTIMIZATION Vol. 20. No. 2. March 1982
- JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 29, No. 2, OCTOBER 1979 Convexification Procedures and Decomposition
- 174 IEEEt1lANSACTIONSONAUTOMAnC CONTROL,VOL. Ac-21, NO. 2, APRn. 1916 DIMITRI P.BERTSEKAS
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CAS-23,NO. 10, OCTOBER 1976 599 Hing C. So (M'60-SM'74) received the B.S.,
- April 1995 LIDS-P-2146 SIAM J. on Optimization, to appear
- March 1992 Appeared in SIAM J. on Optimization, Vol. 3, 1993, pp. 268-299 REVERSE AUCTION AND THE SOLUTION OF
- Appeared in Computational Optimization and its Applications, Vol. 2, pp. 317-336, 1993 PARALLEL PRIMAL-DUAL METHODS
- January 1993 LIDS-P-2159 A FORWARD/REVERSE AUCTION ALGORITHM
- SIAM J. CONTR~L AND OPTIMIZATION Vol. 28, No.3, pp!678-710, May 1.990
- February 1989 LIDS-P-1850 THE AUCTION ALGORITHM FOR THE TRANSPORTATION
- IEEE TRANSACTlON~ ON AUTOMATIC CONTROL, VOL. AC-29, NO. II, NOVEMBER 1984 1009 ELI M. GAFNI ANDDIMITRI P. BERTSEKAS, FELWW,ffiEE
- 1090 IEEE TRANSACTIONS ON AUTONATIC CONTROL, VOL. AC-28.NO. 12, DECEMBER 1983 Jerry M. Mendel (S'59-M61-SM72-F78) re-
- Au/OmGnCG.Vol 27. No I. pp 3--21.1991 PrInted In Great Bnta,n
- CONVERGENCE RATE AND TERMINATION OF ASYNCHRONOUS ITERATIVE ALGORITHMS
- Mathematical Programming 27 (1983) 107-120 North-Holland
- Automatica,Vol. 7,pp. 233-247.PergamonPress,1971.Printedin GreatBritain. On the Minimax Reachability of Target Sets
- Ten Simple Rules, D. P. Bertsekas TEN SIMPLE RULES
- Computational Optimization and Applications 12, 4151 (1999) c 1999 Kluwer Academic Publishers. Manufactured in The Netherlands.
- October 2004 (Revised May 2005) Report LIDS 2632 Proceedings of the Erice 2004 Workshop
- [12] D. Chazan and W. L. Miranker, ``Chaotic relaxation,'' Lin. Algebra and Appl. Vol. 2, 199222, 1969.
- February 1995 Revision of Report LIDSP2146 AN AUCTION/SEQUENTIAL SHORTEST PATH ALGORITHM
- Rollout Algorithms for Discrete Optimization: Dimitri P. Bertsekas
- GRADIENT CONVERGENCE IN GRADIENT METHODS WITH ERRORS
- IBEETRANSAC'nONSON AUTOMAllC CONTROL,VOL. Ac.l6, No.2, APRIL 1971 117 DIMITRI P. BERTSEKAS ANDIAN B. RHODES, MEMBER,IEEE
- 314 IEEE TFUNSACTIONS ON AUTOMATIC CONTROL, JUNE 1973 Gamkrelitze's and Boltyanskii's results appear to entail the same where T P E E" and UJ;E Emdenote forall k the state and controlof
- April 2005 Report LIDS 2646 Rollout Algorithms for Constrained
- Dynamic Programming and Optimal Control 3rd Edition, Volume II
- Simulation and Analysis of Various Routing Algorithms for Optical Networks
- Proc. of Symposium on Global Optimization, Santorini, Greece, June 2003 Optimal Solution of Integer Multicommodity Flow Problems
- SIAM J. CONTROL AND OI'TIMIZATION Vol. 25, No 5, September 1987
- Journal of Heuristics, 3: 245262 (1997) c 1997 Kluwer Academic Publishers
- August 2010 (revised December 2010) Report LIDS -2848 Incremental Gradient, Subgradient, and Proximal Methods for
- Polyhedral Approximation Extended Monotropic Programming Special Cases Polyhedral Approximations in
- Parallel Shortest Paths Methods for Globally Optimal Trajectories \Lambda D.P. Bertsekas a , F. Guerriero b and R. Musmanno b
- IEEE TRANSACTIONS ONCOMMUNICATIONS, VOL. COM-29,NO. 1, JANUARY 1981 11 Distributed Algorithms for Generating Loop-Free Routes
- Convex Analysis and Optimization, D. P. Bertsekas A NEW LOOK AT
- Parallel Asynchronous Label Correcting Methods for Shortest Paths 1,2
- Pathologies of Temporal Difference Methods in Approximate Dynamic Programming
- Automatica, Vol. 12, pp. 133-145. Pergamon Press, 1976. Printed in Great Britain Multiplier Methods: A Survey*t
- Basis Function Adaptation Methods for Cost Approximation in MDP
- October 2003 The Relation Between Pseudonormality and Quasiregularity
- CONVEX (AND NONCONVEX) ANALYSIS AND OPTIMIZATION
- (,04 +";E TR "S.I,CTIOXS0:--.~t:TO;\r\TIC CO:'"TROL,VOL. .\C-17, NO. 5, OCTOB~;a1972 computing it for any given point in the state space1 thedevclope
- JOURNALOFOPTIMIZATIONTHEORYANDAPPLICATIONS:Vol.25, No. 3,JULY1978 TECHNICAL NOTE
- IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. COM-32 , NO.8, AUGUST 1984 DIMITRI P. ~ERTSEKAS, ELI M. GAFNI, ANDROBERT G. GALLAGER, FELWW,IEEE
- Discretized Approximations for POMDP with Average Cost Lab for Information and Decisions
- Classical Value and Policy Iteration for Discounted MDP New Optimistic Policy Iteration Algorithms Optimistic Policy Iteration and Q-learning in Dynamic
- LIDS REPORT 2859 1 On Boundedness of Q-Learning Iterates for Stochastic
- IEEE TRANSACTIOXS ON AUTOMATIC CONTROL, VOL. ac-18, NO. 2, APRIL 1973 117 [6] R. S.Bucy and I(. D. Senne "Realization of optimum discrete-
- ParallelComputing 17 (1991)707-732 North-Holland
- JOURNALOF PARALLEL AND DISTRIBUTEDCOMPUTING 11, 263-275 (1991) Optimal Communication Algorithms for Hypercubes*
- Noname manuscript No. (will be inserted by the editor)
- March 2006 (Revised February 2010) Report LIDS -2692 Extended Monotropic Programming and
- October 2011 Report LIDS -2874 Lambda-Policy Iteration: A Review and a
- LIDS REPORT 2859 1 On Boundedness of Q-Learning Iterates for Stochastic
- LIDS REPORT 2871 1 Q-Learning and Policy Iteration Algorithms for
- On the Convergence of Iterative Simulation-Based Methods for Singular Linear Systems
- Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems