DIMITRI P. BERTSEKAS
Scholarly Publications
Textbooks
1. D. P. Bertsekas, Dynamic Programming and Stochastic Control, Academic
Press, 1976.
2. D. P. Bertsekas and S. E. Shreve, Stochastic Optimal Control: The
Discrete Time Case, Academic Press, 1978, (translated in Russian);
republished by Athena Scientific, 1997.
3. D. P. Bertsekas, Lagrange Multiplier Methods in Constrained
Optimization, Academic Press, 1982, (translated in Russian); republished
by Athena Scientific, 1996.
4. D. P. Bertsekas and R. G. Gallager, Data Communication Networks,
Prentice-Hall, 1987, (translated in Russian and Japanese); second edition
published in 1991.
5. D. P. Bertsekas, Dynamic Programming: Deterministic and Stochastic
Models, Prentice-Hall, 1987.
6. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed
Computation: Numerical Methods, Prentice-Hall, 1989; republished by
Athena Scientific, 1997.
7. D. P. Bertsekas, Linear Network Optimization: Algorithms and Codes,
MIT Press, 1991.
8. D. P. Bertsekas, Dynamic Programming and Optimal Control, (2 Vols.),
Athena Scientific, 1995; 2nd edition of Vol. 1 published in 2000;
2nd edition of Vol. 2 published in 2001; 3rd edition of Vol. 1 published
in 2005; 3rd edition of Vol. 2 published in 2007.
9. D. P. Bertsekas, Nonlinear Programming, Athena Scientific, 1995;
2nd edition published in 1999.
10. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming,
Athena Scientific, 1996; awarded the 1997 INFORMS CSTS prize for reserach
excellence in the interface between operations research and computer
science.
11. D. P. Bertsekas, Network Optimization: Continuous and Discrete
Models, Athena Scientific, 1998.
12. D. P. Bertsekas and J. N. Tsitsiklis, Introduction to
Probability, Athena Scientific, 2002.
13. D. P. Bertsekas, with A. Nedic and A. Ozdaglar, Convex Analysis and
Optimization, Athena Scientific, 2003.
14. D. P. Bertsekas, Convex Optimization Theory, Athena Scientific, 2009.
15. D. P. Bertsekas, Abstract Dynamic Programming, Athena Scientific, 2013.
16. D. P. Bertsekas, Convex Optimization Algorithms, Athena Scientific, to appear Jan. 2015.
Journal Papers and Chapters in Edited Volumes
1. D. P. Bertsekas, "Note on the Design of Linear Regulators with
Piece-wise Constant Gains," IEEE Trans. on Automatic Control, (Corresp.),
Vol. AC-15, pp. 262-263, April 1970.
2. D. P. Bertsekas and I. B. Rhodes, "Recursive State Estimation with a
Set-Membership Description of the Uncertainty," IEEE Trans. on Automatic
Control, Vol. AC-16, pp. 117-128, April 1971.
3. D. P. Bertsekas and I. B. Rhodes, On the Minimax Reachability of
Target Sets and Target Tubes," Automatica, Vol. 7, pp. 233-241, March
1971.
4. D. P. Bertsekas, "Infinite Time Reachability of State Space Regions
by Using Feedback Control," IEEE Trans. on Automatic Control, Vol. AC-17,
pp. 604-613, October 1972.
5. D. P. Bertsekas and I. B. Rhodes, "Sufficiently Informative
Functions and the Minimax Feedback Control of Uncertain Dynamic Systems,"
IEEE Trans. on Automatic Control, Vol. AC-18, pp. 117-124, April 1973.
6. D. P. Bertsekas, "Stochastic Optimization Problems with
Nondifferentiable Cost Functionals," Journal of Optimization Theory and
Applications, Vol. 12, pp. 218-231, August 1973.
7. D. P. Bertsekas and S. K. Mitter, "Descent Numerical Methods for
Optimization Problems with Nondifferentiable Cost Functions," SIAM
Journal on Control, Vol. II, pp. 637-652, November 1973.
8. D. P. Bertsekas, "Linear Convex Stochastic Control Problems Over an
Infinite Time Horizon," IEEE Trans. on Automatic Control, (Corresp.),
Vol. AC-18, pp. 314-315, June 1973.
9. D. P. Bertsekas, "Partial Conjugate Gradient Methods for a Class of
Optimal Control Problems," IEEE Trans. on Automatic Control, Vol. AC-19,
pp. 209-217, June 1974.
10. D. P. Bertsekas, "Necessary and Sufficient Conditions for Existence
of and Optimal Portfolio," Journal of Economic Theory, Vol. 8, No. 2, pp.
235-247, 1974.
11. D. P. Bertsekas, On Penalty and Multiplier Methods for Constrained
Minimization," in Nonlinear Programming 2, by O. L. Mangasarian, R.
Meyer, S. Robinson, (eds.), Academic Press, New York, pp. 165-191, 1975.
12. D. P. Bertsekas, "Necessary and Sufficient Conditions for a Penalty
Method to be Exact," Mathematical Programming, Vol. 9, pp. 87-99, 1975.
13. D. P. Bertsekas,"Convergence of Discretization Procedures in Dynamic
Programming," IEEE Trans. on Automatic Control, Vol. AC-20, pp. 415-419,
1975.
14. D. P. Bertsekas, "On the Method of Multipliers for Convex
Programming," IEEE Trans. on Automatic Control, vol. AC-20, pp. 385-388,
1975.
15. D. P. Bertsekas, "Nondifferentiable Optimization via Approximation,"
in Mathematical Programming Study 3, Nondifferentiable Optimization, M.
L. Balinski, P. Wolfe, (eds.), North-Holland Publ. Co., pp. 1-15, 1975.
16. D. P. Bertsekas, "Combined Primal-Dual and Penalty Methods for
Constrained Minimization," SIAM Journal on Control, Vol. 13, No. 3, pp.
521-544, May 1975.
17. D. P. Bertsekas, "On Penalty and Multiplier Methods for Constrained
Minimization," SIAM Journal on Control, Vol. 14, pp. 216-235, 1976.
18. B. W. Kort and D. P. Bertsekas, "Combined Primal-Dual and Penalty
Methods for Convex Programming," SIAM Journal on Control, Vol. 14, pp.
268-294, 1976.
19. D. P. Bertsekas, "Multiplier Methods: A Survey," Automatica, Vol.
12, pp. 133-145, 1976.
20. D. P. Bertsekas, "On the Goldstein-Levitin-Polyak Gradient Projection
Method," IEEE Trans. on Automatic Control, Vol. AC-21, pp. 174-184, 1976.
21. D. P. Bertsekas, Review of "Numerical Methods for Constrained
Optimization," P. E. Gill and W. Murray (eds.), Academic Press, 1974,
IEEE Trans. on Automatic Control, Vol. AC-21, pp. 435-436, 1976.
22. D. P. Bertsekas, "On Error Bounds for Successive Approximation
Methods," IEEE Trans on Automatic Control, (Corresp.), Vol. AC-21, 1976,
pp. 394-396.
23. D. P. Bertsekas, "A New Algorithm for Solution of Nonlinear Resistive
Networks Involving Diodes," IEEE Trans. on Circuit Theory, Vol. CAS-23,
pp. 599-608, 1976.
24. D. P. Bertsekas, "Monotone Mappings with Application in Dynamic
Programming," SIAM J. on Control and Optimization, Vol. 15, pp. 438-464,
1977.
25. D. P. Bertsekas, "Approximation Procedures Based on the Method of
Multipliers," Journal of Optimization Theory and Applications, Vol. 23,
1977, pp. 487-510.
26. D. P. Bertsekas, Review of "A Vector Space Approach to Vector Spaces
and Optimization," by N. Dorny, J. Wiley, 1975, IEEE Transactions on
Automatic Control, Vol. AC-22, p. 686, 1977.
27. D. P. Bertsekas, "On the Convergence Properties of Second Order
Methods of Multipliers," Journal of Optimization Theory and Applications,
June 1978.
28. S. E. Shreve and D. P. Bertsekas, "Alternative Theoretical Frameworks
for Finite Horizon Discrete Time Stochastic Optimal Control," SIAM
Journal on Control and Optimization, Vol. 16, 1978, pp. 953-978.
29. S. E. Shreve and D. P. Bertsekas, "Dynamic Programming in Borel
Spaces," in Dynamic Programming and Its Applications, M. L. Puterman
(ed.), Academic Press, 1978, pp. 115-130.
30. D. P. Bertsekas, "Convexification Procedures and Decomposition
Methods for Nonconvex Optimization Problems," Journal of Optimization
Theory and Applications, Vol. 29, 1979, pp. 169-197.
31. D. P. Bertsekas
and S. E. Shreve, "Existence of Optimal Stationary Policies in
Deterministic Optimal Control," J. of Math. Analysis and Applications,
Vol. 69, 1979, pp. 607-620.
32. S. E. Shreve and D. P. Bertsekas, "Universally Measurable Policies in
Dynamic Programming," Mathematics of Operations Research, Vol. 4, 1979,
pp. 15-30.
33. D. P. Bertsekas, "Algorithms for Nonlinear Multicommodity Network
Flow Problems," International Symposium on Systems Optimization and
Analysis, A. Bensoussan and J. L. Lions (eds.), Springer-Verlag, 1979,
pp. 210-224.
34. D. P. Bertsekas, "A Convergence Analysis of the Method of Multipliers
for Nonlinear Noncovex Optimization," in Proc. of Workshop on Augmented
Lagrangians, by A. Wierzbicki (ed.), IAASA, Vienna, 1979, to be published
by North-Holland.
35. D. P. Bertsekas, Penalty and Multiplier Methods," in Nonlinear
Optimization Theory and Algorithms, by L.C.W. Dison, E. Spedicato and
G.P. Szego (eds.) Birkhauser, Boston 1980.
36. D. P. Bertsekas, "A New Algorithm for the Assignment Problem," Math.
Programming, Vol. 21, 1981, pp. 152-171.
37. E. Gafni and D. P. Bertsekas, "Distributed Algorithms for Generating
Loopfree Routes in Networks with Frequently Changing Topology," IEEE
Trans. on Comm., Vol. COM-29, pp. 11-18, 1981.
38. D. P. Bertsekas, "Enlarging the Region of Convergence of Newton's
Method for Constrained Minimization," J.O.T.A., Vol. 36, 1982, pp.
221-252.
39. D. P. Bertsekas, "Dynamic Behavior of Shortest Path Routing
Algorithms for Communication Networks," IEEE Trans. on Aut. Control, Vol.
AC-27, 1982, pp. 60-74.
40. D. P. Bertsekas and E. Gafni, "Projection Methods for Variational
Inequalities with Applications to the Traffic Assignment Problem," Math.
Progr. Studies, Vol. 17, 1982, pp. 139-159.
41. D. P. Bertsekas, "Augmented Lagrangians and Differentiable Exact
Penalty Functions," in Nonlinear Optimization 1981 (Proc. of NATO
Workshop on Nonlinear Optimization), by M.J.D. Powell (ed.), Cambridge,
England, 1981, Academic Press, 1982, pp. 223-234.
42. G. Lauer, D. P. Bertsekas, N. Sandell, and T. Posbergh, "Solution of
Large Scale Optimal Unit Commitment Problems," IEEE Trans. on Power
Systems and Apparatus, Vol. PAS-101, 1982, pp. 79-86.
43. D. P. Bertsekas, "Projected Newton Methods for Optimization Problems
with Simple Constraints," SIAM J. Control and Optimization, Vol. 20,
1981, pp. 221-246.
44. D. P. Bertsekas, "Distributed Dynamic Programming," IEEE Transactions
on Aut. Control, Vol AC-27, 1982, pp. 610-616.
45. D. P. Bertsekas, "Optimal Routing and Flow Control Methods for
Communication Networks," in Analysis and Optimization of Systems, (Proc.
of 5th International Conference on Analysis and Optimization of Systems,
A. Bensoussan and J. L. Lions, eds.), Versailles, France,
Springer-Verlag, Berlin & N.Y., 1982, pp. 615-643.
46. J. Kimemia, S. B. Gershwin, and D. P. Bertsekas, "Computation of
Production Control Policies by a Dynamic Programming Technique," in
Analysis and Optimization of Systems, (Proc. of 5th International
Conference on Analysis and Optimization of Systems, A. Bensoussan and J.
L. Lions, eds.), Versailles, France, Springer-Verlag, Berlin, & N.Y.,
1982, pp. 243-259.
47. D. P. Bertsekas, G. Lauer, N. Sandell, and T. Posbergh, "Optimal
Short Term Scheduling of Large Scale Power Systems," IEEE Trans. on Aut.
Control, Vol. AC-28, 1983, pp. 1-11.
48. D. P. Bertsekas and E. Gafni, "Projected Newton Methods and
Optimization of Multicommodity Flows," IEEE Trans. on Aut. Control, Vol.
AC-28, 1983, pp. 1090-1096.
49. D. P. Bertsekas, "Asynchronous Distributed Computation of Fixed
Points," Math. Programming, Vol. 27, 1983, pp. 107-120.
50. E. Gafni and D. P. Bertsekas "Two-Metric Projection Methods for
Constrained Optimization," SIAM J. Control and Optimization, Vol. 22,
1984, pp. 936-964.
51. E. M. Gafni and D. P. Bertsekas, "Dynamic Control of Input Session
Rates in Communication Networks," IEEE Trans. on Automatic Control, Vol.
AC-29, 1984, pp. 1009-1016.
52. D. P. Bertsekas, E. M. Gafni, and R. G. Gallager, "Second Derivative
Algorithms for Minimum Delay Distributed Routing in Networks," IEEE
Trans. on Communications, Vol. COM-32, 1984, pp. 911-919.
53. J. J. Shaw, D. P. Bertsekas, and R. F. Gendron, "Optimal Scheduling
of Large Hydrothermal Power Systems," IEEE Transactions of Power
Apparatus and Systems, Vol. PAS-104, 1985, pp. 286-293.
54. D. P. Bertsekas, "A Unified Framework for Primal-Dual Methods in
Minimum Cost Network Flow Problems," Math. Programming, Vol. 32, pp.
125-145, 1985.
55. D. P. Bertsekas, Review of "Network Flows and Monotropic
Optimization," by R. T. Rockafellar, SIAM Review, 1985.
56. D. P. Bertsekas, J. N. Tsitsiklis, and M. Athans, "Convergence
Theories of Distributed Asynchronous Computation: A Survey," LIDS Report
P-1412, M.I.T., Oct.1984; also in Stochastic Programming, by F. Archetti,
G. DiPillo, and M. Lucertini (eds.), Springer-Verlag, N.Y., pp. 107-139.
57. J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed
Asynchronous Deterministic and Stochastic Gradient Optimization
Algorithms," IEEE Trans. on Aut. Control, Vol. AC-31, 1986, pp. 803-812.
58. J. N. Tsitsiklis and D. P. Bertsekas, "Distributed Asynchronous
Optimal Routing in Data Networks," IEEE Trans. on Aut. Control, Vol.
AC-31, pp. 325-332, 1986.
59. D. P. Bertsekas and D. ElBaz, "Distributed Asynchronous Relaxation
Algorithms for Convex Network Flow Problems," SIAM J. Control and
Optimization, Vol. 25, 1987, pp. 74-85.
60. E. M. Gafni and D. P. Bertsekas, "Asymptotic Optimality of Shortest
Path Routing Algorithms," IEEE Trans. on Information Theory, Vol. IT-33,
1987, pp. 83-90.
61. D. P. Bertsekas, P. Hosein, and P. Tseng, "Relaxation Methods for
Network Flow Problems with Convex Arc Costs," SIAM J. on Control and
Opt., Vol. 25, pp. 1219-1243, 1987.
62. P. Tseng and D. P. Bertsekas, "Relaxation Methods for Problems with
Strictly Convex Separable Costs and Linear Constraints," Math.
Programming, Vol. 38, pp. 303-321, 1987.
63. P. Tseng and D. P. Bertsekas, "Relaxation Methods for Linear
Programs," Math. of Operations Research, Vol. 12, 1987, pp. 569-596.
64. D. P. Bertsekas and P. Tseng, "Relaxation Methods for Minimum Cost
ordinary and Generalized Network Flow Problems," LIDS Report P-1462,
M.I.T, May 1985, Operations Research Journal, Vol. 36, 1988, pp. 93-114.
65. D.P. Bertsekas, "The Auction Algorithm: A Distributed Relaxation
Method for the Assignment Problem," Annals of Operations Research, Vol.
14, 1988, pp. 105-123.
66. D. P. Bertsekas and P. Tseng, "The RELAX Codes for Linear Minimum
Cost Network Flow Problems," in "FORTRAN Codes for Network Optimization,"
B. Simeone (ed.), Annals of Operations Research, Vol. 13, 1988, pp.
125-190.
67. D. P. Bertsekas, "Distributed Asynchronous Fixed Point Algorithms:
General Convergence Theory," in Systems & Control Encyclopedia, M. S.
Singh (ed.), Pergamon Press, 1988.
68. D. P. Bertsekas and J. Eckstein, "Dual Coordinate Step Methods for
Linear Network Flow Problems," Mathematical Programming, Series B, Vol.
42, 1988, pp. 203-243.
69. D. P. Bertsekas and D. A. Castanon, "Adaptive Aggregation Methods for
Infinite Horizon Dynamic Programming," IEEE Trans. on Aut. Control, Vol.
34, 1989, pp. 589-598.
69a. D. P. Bertsekas and D. A. Castanon, "The Auction Algorithm for the
Tranportation Problem," Annals of Operations Research, Vol. 20, 1989, pp.
67-96.
70. J. C. Dunn and D. P. Bertsekas, "Efficient Dynamic Programming
Implementations of Newton's Method for Unconstrained Optimal Control
Problems," J.O.T.A., Vol. 63, 1989, pp. 23-38.
71. P. Tseng and D. P. Bertsekas, "Relaxation Methods for Monotropic
Programming," Math. Programming Journal, Vol. 46, 1990, pp. 127-151.
72. P. Tseng and D. P. Bertsekas, "Relaxation Methods for Problems with
Strictly Convex Costs and Linear Constraints," Math. of Operations
Research, Vol. 16, 1991, pp. 462-481.
73. P. Tseng, D. P. Bertsekas, and J. N. Tsitsiklis, "Partially
Asynchronous Algorithms for Network Flow and Other Problems," SIAM J. on
Control and Optimization, Vol. 28, 1990, pp. 678-710.
74. D. P. Bertsekas and J. N. Tsitsiklis, "An Analysis of Stochastic
Shortest Path Problems," Mathematics of Operations Research, Vol. 16,
1991, pp. 580-595.
75. D. P. Bertsekas and J. N. Tsitsiklis, "A Survey of Some Aspects of
Parallel and Distributed Iterative Algorithms," Automatica, Vol. 27,
1991, pp. 3-21.
76. D. P. Bertsekas, "The Auction Algorithm for Assignment and Other
Network Flow Problems: A Tutorial," Interfaces, Vol. 20, 1990, pp.
133-149.
77. J. Eckstein and D. P. Bertsekas, "On the Douglas-Rachford Splitting
Method and the Proximal Point Algorithm for Maximal Monotone Operators,"
Math. Programming, Vol. 55, 1992, pp. 293-318.
78. D. P. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. N.
Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. of
Parallel and Distributed Computation, Vol. 11, 1991, pp. 263-275.
79. D. P. Bertsekas and D. A. Castanon, "Parallel Synchronous and
Asynchronous Implementations of the Auction Algorithm," Parallel
Computing, Vol. 17, 1991, pp. 707-732.
80. D. P. Bertsekas, "An Auction Algorithm for Shortest Paths," SIAM J.
on Optimization, Vol. 1, 1991, pp. 425-447.
82. D. P. Bertsekas and D. A. Castanon, "A Forward/Reverse Auction
Algorithm for Asymmetric Assignments Problems", Computational
Optimization and Applications, Vol. 1, pp. 277-297, 1992.
83. E. Varvarigos and D. P. Bertsekas, "Multinode Broadcast in
Hypercubes and Rings with Randomly Distributed Length of Packets", IEEE
Trans. on Parallel and Distributed Systems, Vol. 4, pp. 144-154, 1993.
84. E. A. Varvarigos and D. P. Bertsekas, "Communication Algorithms for
Isotropic Tasks in Hypercubes and Wraparound Meshes", Parallel Computing,
Vol. 18, pp. 1233-1257, 1992.
85. D. P. Bertsekas and D. A. Castanon, "Asynchronous Hungarian Methods
for the Assignment Problem," ORSA J. on Computing, Vol. 5, pp. 261-274,
1993.
86. D. P. Bertsekas, "Auction Algorithms for Network Flow Problems: A
Tutorial Introduction," Computational Optimization and Applications, Vol.
1, pp. 7-66, 1992.
86a. D. P. Bertsekas, D. A. Castanon, and H. Tsaknakis,
"Reverse Auction and the Solution of Inequality Constrained Assignment
Problems," SIAM J. on Optimization, Vol. 3, pp. 268-299, 1993.
87. P. Tseng and D. P. Bertsekas, "On the Convergence of the Exponential
Multiplier Method for Convex Programming," Math Programming, Vol. 60, pp.
1-19, 1993.
88. D. P. Bertsekas and D. A. Castanon, "Parallel Primal-Dual Methods
for the Minimum Cost Flow Problem," Computational Optimization and its
Applications, Vol. 2, pp. 317-336, 1993.
89. D. B. Bertsekas, "Mathematical Equivalence of the Auction Algorithm
for Assignment and the e-Relaxation (Preflow-Push) Method for Min Cost
Flow", Large Scale Optimization: State of the Art, pp. 27-46, W. W.
Hager, D. W. Hearn and P. M. Pardalos, Eds., Kluwer, 1993.
90. D. P. Bertsekas, "A Simple and Fast Label Correcting Algorithm for
Shortest Paths", Networks, Vol. 23, pp. 703-709, 1993.
91. D. P. Bertsekas and D. A. Castanon, "A Generic Auction Algorithm for
the Minimum Cost Network Flow Problem", Computational Optimization and
Applications, Vol. 2, pp. 229-260, 1993.
92. E. A. Varvarigos and D. P. Bertsekas, "Transposition of Banded
Matrices in Hybercubes: A Nearly Isotropic Task", Parallel Computing,
Vol. 21, 1995, pp. 243-264.
93. D. P. Bertsekas, "The Auction Algorithm for Assignment and Shortest
Path Problems", Ricerca Operativa, Vol. 22, 1993, pp. 5-36.
94. E. A. Varvarigos and D. P. Bertsekas, "Dynamic Broadcasting in
Parallel Computing", IEEE Trans. on Parallel and Distributed Systems,
Vol. 6, 1995, pp. 120-131.
95. L. C. Polymenakos and D. P. Bertsekas, "Parallel Shortest Path
Auction Algorithms", Parallel Computing, Vol. 20, 1994, pp. 1221-1247.
96. D. P. Bertsekas and P. Tseng, "Partial Proximal Minimization
Algorithms for Convex Programming", SIAM J. on Optimization, Vol. 4,
1994, pp. 551-572.
97. E. A. Varvarigos and D. P. Bertsekas, "Performance of Hypercube
Routing Schemes With or Without Buffering", IEEE/ACM Transactions on
Networking, Vol. 2, 1994, pp. 299-311.
98. D. P. Bertsekas, "An Auction Algorithm for the Max-Flow Problem",
JOTA , Vol. 87, 1995, pp. 69-101.
99. D. P. Bertsekas, "A Counterexample on Temporal Differences
Learning", Neural Computation, Vol. 7, 1995, pp. 270-279.
100. E. A. Varvarigos and D. P. Bertsekas, "Partial Multinode Broadcasts
and Partial Exchange Algorithms for d-Dimensional Meshes", J. of Parallel
and Distributed Computing, Vol. 23, 1994, pp. 177-189.
101. E. A. Varvarigos and D.P. Bertsekas, "A Conflict Sense Routing
Protocol and Its Performance for Hypercubes", IEEE Trans. Computers,
Vol. 45, 1996, pp. 693-703.
102. D. P. Bertsekas, S. Pallottino, and M. G. Scutella, "Polynomial
Auction Algorithms for Shortest Paths", Computational Optimization and
Applications, Vol. 4, 1995, pp. 99-125.
103. D. P. Bertsekas, F. Guerriero and R. Musmanno, "Parallel
Asynchronous Label Correcting Methods for Shortest Paths", J. of
Optimization Theory and Applications, Vol. 88, 1996, pp. 297-320.
104. D. P. Bertsekas, "Generic Rank One Corrections for Value Iteration
in Markovian Decision Problems", Operations Research Letters, Vol. 17,
1995, pp. 111-119.
105. D. P. Bertsekas, "Incremental Least Squares Methods and the Extended
Kalman Filter", SIAM J. on Optimization, Vol. 6, 1996, pp. 807-822.
106. S. A. Savari and D. P. Bertsekas, "Finite Termination of
Asynchronous Iterative Algorithms", MIT, Laboratory for Information and
Decision Systems, Parallel Computing, Vol. 22, 1996, pp. 39-56.
107. D. P. Bertsekas, "Thevenin Decomposition and Network Optimization",
JOTA, Vol. 89, 1996, pp. 1-15.
108. D. P. Bertsekas, D. A. Castanon, J. Eckstein, and S. Zenios,
"Parallel Computing in Network Optimization", Handbooks in OR & MS, (M.
O. Ball, et. al, Eds.), Vol. 7, 1995, pp. 331-399.
109. D. P. Bertsekas, F. Guerriero and R. Musmanno, "Parallel Shortest
Path Methods for Globally Optimal Trajectories", in High Performance
Computing: Technology, Methods, and Applications, (J. Dongarra et.al.,
Eds.), Elsevier, 1995, pp. 303-315.
110. D. P. Bertsekas, "A New Class of Incremental Gradient Methods for
Least Squares Problems", SIAM J. on Optimization, Vol. 4, 1997, pp.
913-926.
111. D. P. Bertsekas, Polymenakos, L, and Tseng, P., "An e-Relaxation
Method for Convex Cost Network Flow Problems," SIAM J. on Optimization,
Vol. 7, 1997, pp. 853-870.
112. D. P. Bertsekas, "A New Value Iteration Method for the Average Cost
Dynamic Programming Problem," SIAM J. on Control and Optimization, Vol.
5, 1998, pp. 742-759.
113. L. C. Polymenakos, D. P. Bertsekas, and J. N. Tsitsiklis,
"Implementation of Efficient Algorithms for Globally Optimal
Trajectories", IEEE Trans. on Aut. Control, Vol. AC-43, 1998, pp. 278-283.
114. D. P. Bertsekas, Polymenakos, L, and Tseng, P., "Epsilon-Relaxation
and Auction Methods for Separable Convex Cost Network Flow Problems," in
Network Optimization, Pardalos, P. M., Hearn, D. W., and Hager, W. W.
(eds.), Lecture Notes in Economics and Mathematical Systems,
Springer-Verlag, N.Y., 1998, pp. 103-126.
115. D. P. Bertsekas, J. N. Tsitsiklis, and C. Wu, "Rollout Algorithms
for Combinatorial Optimization'', Journal of Heuristics, Vol. 3, 1997,
pp. 245-262.
116. D. P. Bertsekas, and D. A. Castanon, "Rollout Algorithms for
Stochastic Scheduling Problems'', Journal of Heuristics, Vol. 5, 1999,
pp. 89-108.
117. S. D. Patek, and D. P. Bertsekas, "Stochastic Shortest Path
Games", SIAM J. on Control and Opt., Vol. 37, 1999, pp. 804-824.
118. D. P. Bertsekas, "A Note on Error Bounds for Convex nad Nonconvex
Problems", Computational Optimization and Applications, Vol. 12, 1999,
pp. 41-51.
119. D. P. Bertsekas, M. L. Homer, D. A. Logan, S. D. Patek, and N. R.
Sandell, "Missile Defense and Interceptor Allocation by Neuro-Dynamic
Programming", IEEE Trans. on Systems Man and Cybernetics, Vol. 30,
2000, pp. 42-51.
120. J. Abounadi, D. P. Bertsekas, and V. Borkar, "Learning
Algorithms for Markov Decision Processes with Average Cost", SIAM J. on
Control and Opt., Vol. 40, 2001, pp. 681-698.
121. J. Abounadi, D. P. Bertsekas, and V. Borkar, "Approximation for Non-Expansive
Maps: Application to Q-Learning Algorithms", SIAM J. on Control and Opt., Vol. 41,
2002, pp. 1-22.
122. C. Wu, and D. P. Bertsekas, "Distributed Power Control Algorithms
for Wireless Networks'', IEEE Trans. on Vehicular Technology, 2001.
123. P. Tseng and D. P. Bertsekas, "Auction Algorithms for Convex
Generalized Network Problems," Math.\ Programming, Vol.\ 88, 2000, pp.\ 85-104.
124. D. P. Bertsekas, and J.N. Tsitsiklis, "Gradient Convergence in
Gradient Methods", SIAM J. on Optimization, Vol. 36, 2000, pp. 627-642.
125. A. Nedic and D. P. Bertsekas, "Incremental Subgradient Methods for Nondifferentiable
Optimization," SIAM J. on Optimization, Vol. 12, 2001, pp. 109-138.
126. D. P. Bertsekas and A. E. Ozdaglar, "Pseudonormality and a Lagrange Multiplier Theory for
Constrained Optimization," J. Optim. Theory Appl. Vol. 114 (2002), pp. 287--343.
127. A. Nedic, D. P. Bertsekas, and V. Borkar, Distributed Asynchronous Incremental Subgradient Methods, Proceedings of the
March 2000 Haifa Workshop ``Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications", D.
Butnariu, Y. Censor, and S. Reich, Eds., Elsevier, Amsterdam, 2001.
128. A. Nedic and D. P. Bertsekas, "Convergence Rate of Incremental Subgradient Algorithms," ps format version, Stochastic
Optimization: Algorithms and Applications (S. Uryasev and P. M. Pardalos, Editors), pp. 263-304, Kluwer Academic Publishers,
2000.
129. A. Nedic and D. P. Bertsekas, "Least-Squares Policy Evaluation Algorithms with Linear
Function Approximation," LIDS Report LIDS-P-2537, Dec. 2001; J. of Discrete Event Systems,
Vol. 13, 2003.
130. C. C. Wu and D. P. Bertsekas, "Admission Control for Wireless Networks," IEEE Trans. on Vehicular
Technology,IEEE Trans. on Vehicular Technology, Vol. 50, pp. 504-514, 2001.
131. D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar, "Min Common/Max Crossing Duality: A Simple
Geometric Framework for Convex Optimization and Minimax Theory," Report LIDS-P-2536, Jan.
2002.
132. A. E. Ozdaglar and D. P. Bertsekas, "Routing and Wavelength Assignment in Optical
Networks," IEEE Trans. on Networking,
Apr. 2003 pp. 259-272.
133. A. E. Ozdaglar and D. P. Bertsekas,
"The Relation Between Pseudonormality and
Quasiregularity in Constrained Optimization," Optimization Methods and
Software, Vol. 19, 2004, pp. 493-506.
134. D. P. Bertsekas, V. Borkar, and A. Nedic,
"Improved Temporal Difference Methods with Linear Function
Approximation," in "Learning and Approximate
Dynamic Programming", by A. Barto, W. Powell, J. Si, (Eds.), IEEE Press, 2004.
135. D. P. Bertsekas, A. E. Ozdaglar, and P. Tseng,
"Enhanced Fritz John Conditions for Convex
Programming," Lab. for Information and Decision Systems Report 2631, MIT, July 2004; SIAM J. on
Optimization, Vol. 16, 2006, p. 766.
136. D. P. Bertsekas and J. N. Tsitsiklis, "Comment on
Coordination of Groups of Mobile Autonomous
Agents Using Nearest Neighbor Rules," Lab. for Information and Decision
Systems Report, MIT, June 2006; EEE Trans. on Aut. Control, Vol. 52, pp. 968-969, 2007.
137. H. Yu and D. P. Bertsekas, "On Near-Optimality of the Set of Finite-State Controllers for Average Cost POMDP," Mathematics of Operations Research, 33(1), pp. 1-11, 2008.
138. D. P. Bertsekas, "Extended Monotropic Programming and Duality," Lab. for Information and Decision
Systems Report 2692, MIT, March 2006 (revised March 2007), to appear in JOTA.
139. D. P. Bertsekas, "Separable Dynamic Programming and Approximate Decomposition Methods," Lab. for Information and Decision
Systems Report 2684, MIT, Feb. 2006; to appear in IEEE Trans. on Aut. Control.
140. D. P. Bertsekas, "Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC," in Fundamental Issues in Control, European J. of Control, Vol. 11, Nos. 4-5, 2005.
141. D. P. Bertsekas, and P. Tseng,
"Set Intersection Theorems and Existence of Optimal
Solutions," Math. Programming J., Vol. 110, 2007 pp. 287-314.
142. D. P. Bertsekas, A. E. Ozdaglar, and P. Tseng,
"Enhanced Fritz John Conditions for Convex
Programming," SIAM J. on
Optimization, Vol. 16, 2006, p. 766.
143. A. Nedich and D. P. Bertsekas, "The Effect of Deterministic Noise in Subgradient Methods," Math. Programming, Ser. A, Vol. 125, pp. 75-99, 2010.
144. D. P. Bertsekas, "Separable Dynamic Programming and Approximate Decomposition Methods," IEEE Trans. on Aut. Control, Vol. 52, 2007, pp. 911-916.
145. H. Yu and D. P. Bertsekas, "Convergence Results for Some Temporal Difference Methods Based on Least Squares," IEEE Trans. on Aut. Control, Vol. 54, 2009, pp. 1515-1531.
146. D. P. Bertsekas, "Extended Monotropic Programming and Duality," JOTA, Vol. 139, 2008, pp. 209-225.
147. D. P. Bertsekas and H. Yu, "A Unifying Polyhedral Approximation Framework for Convex Optimization," SIAM J. on Optimization, Vol. 21, 2011, pp. 333-360.
148. D. P. Bertsekas and H. Yu, "Projected Equation Methods for Approximate Solution of Large Linear Systems," Journal of Computational and Applied Mathematics, Vol. 227, 2009, pp. 27-50.
149. A. Nedich and D. P. Bertsekas, "The Effect of Deterministic Noise in Subgradient Methods," Math. Programming, Ser. A, Vol. 125, pp. 75-99, 2010.
150. D. P. Bertsekas, "Temporal Difference Methods for General Projected Equations," IEEE Trans. on Automatic Control, Vol. 56, pp. 2128 - 2139, 2011.
151. H. Yu and D. P. Bertsekas, "Error Bounds for Approximations from Projected Linear Equations," Mathematics of Operations Research, Vol. 35, 2010, pp. 306-329.
152. D. P. Bertsekas, "Incremental Proximal Methods for Large Scale Convex Optimization," Lab. for Information and Decision Systems Report LIDS-P-2847, MIT, August 2010; Mathematical Programming, Vol. 129, 2011, pp.163-195.
153. D. P. Bertsekas, "Approximate Policy Iteration: A Survey and Some New Methods," Journal of Control Theory and Applications, Vol. 9, 2011, pp. 310-335.
154. D. P. Bertsekas, "Weighted Sup-Norm Contractions in Dynamic Programming: A Review and Some New Applications", Lab. for Information and Decision Systems Report LIDS-P-2884, MIT, May 2012.
155. M. Wang and D. P. Bertsekas, "Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems", Lab. for Information and Decision
Systems Report LIDS-P-2878, MIT, December 2011 (revised March 2012); Math. of Operations Research (to appear).
156. D. P. Bertsekas, "Lambda-Policy Iteration: A Review and a New Implementation", Lab. for Information and Decision Systems Report LIDS-P-2874, MIT, October 2011. In "Reinforcement Learning and Approximate Dynamic Programming for Feedback Control," by F. Lewis and D. Liu (eds.), IEEE Press Computational Intelligence Series.
157. D. P. Bertsekas and H. Yu, "Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming," Lab. for Information and Decision Systems Report LIDS-P-2831, MIT, April, 2010 (revised November 2011); Math. of Operations Research, Vol. 37, 2012, pp. 66-94.
158. H. Yu and D. P. Bertsekas, "Q-Learning and Policy Iteration Algorithms for Stochastic Shortest Path Problems," Annals of Operations Research Vol. 208, 2013, pp. 95-132.
159. H. Yu and D. P. Bertsekas, "On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems," Mathematics of Operations Research 38(2), pp. 209-227, 2013.
160. M. Wang and D. P. Bertsekas, "Convergence of Iterative Simulation-Based Methods for Singular Linear Systems," Stochastic Systems, Vol. 3, 2013, pp 39-96.
161. M. Wang and D. P. Bertsekas, "Incremental Constraint Projection-Proximal Methods for Nonsmooth Convex Optimization ", Lab. for Information and Decision Systems Report LIDS-P-2907, MIT, July 2013; to appear in SIAM J. on Optimization.
162. M. Wang and D. P. Bertsekas, "Incremental Constraint Projection Methods for Variational Inequalities", Lab. for Information and Decision Systems Report LIDS-P-2898, MIT, December 2012; to appear in Mathematical Programming.
163. H. Yu and D. P. Bertsekas, "A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies," Lab. for Information and Decision Systems Report LIDS-P-2905, MIT, July 2013; Math. of Operations Research (to appear).
Selected Conference Proceedings Papers
1. D. P. Bertsekas and S. K. Mitter, "Steepest Descent for Optimization
Problems With Nondifferentiable Cost Functions," Proc. 5th Annual
Princeton Conference on Information Sciences and Systems, Princeton,
N.J., March 1971.
2. D. P. Bertsekas and I. B. Rhodes, "Minimax Feedback Control of
Uncertain Dynamic Systems," Proc. IEEE Decision and Control Conference,
Miami, Florida, December 1971.
3. D. P. Bertsekas, "Convergence of the Feasible Region in Infinite
Horizon Optimization Problems," Proc. 1972 Joint Automatic Control
Conference, Stanford University, Stanford, Calif., August 1972.
4. D. P. Bertsekas, "On the Solution of Some Minimax Problems," Proc.
1972 IEEE Decision and Control Conference, New Orleans, LA, December 1972.
5. B. W. Kort and D. P. Bertsekas, "A New Penalty Function Method for
Constrained Minimization," Proc. 1971 IEEE Decision and Control
Conference, New Orleans, LA, December 1972.
6. D. P. Bertsekas, "Stochastic Optimization Problems with
Nondifferentiable Cost Functionals with an Application in Stochastic
Programming," Proc. 1972 IEEE Decision and Control Conference, New
Orleans, LA, December 1972.
7. B. W. Kort and D. P. Bertsekas, "Multiplier Methods for Convex
Programming," Proc. 1973 IEEE Decision and Control Conference, San Diego,
CA, December 1973, pp. 260-264.
8. D. P. Bertsekas, "Convergence Rate of Penalty and Multiplier
Methods," Proc. 1973 IEEE Decision and Control Conference, San Diego, CA,
December 1973, pp. 260-264.
9. D. P. Bertsekas, "On the Goldstein-Levitin-Polyak Gradient Projection
Method," Proc. 1974 IEEE Decision and Control Conference, Phoenix, AZ,
Nov. 1974, pp. 47-52.
10. D. P. Bertsekas, "Nondifferentiable Optimization Via Approximation,"
Proc. Twelfth Annual Allerton Conference on circuit and System Theory,
Allerton Park, Ill., Oct. 1974, pp. 41-52
11. D. P. Bertsekas, "Multiplier Methods: A Survey," Proc. 1975 IFAC
Congress, Boston, MA, August 1975.
12. D. P. Bertsekas, "A New Algorithm for Analysis of Nonlinear Resistive
Networks," Proc. Thirteenth Annual Allerton Conference on Circuit &
System Theory, Allerton Park, Illinois, October 1975, pp. 622-632.
13. D. P. Bertsekas, "A General Method for Approximation Based on the
Method of Multipliers," Proc. Thirteenth Annual Allerton Conference on
Circuit and System Theory, Allerton Park, Ill., October 1975, pp. 192-203.
14. D. P. Bertsekas, "Monotone Mappings in Dynamic Programming," Proc. of
1975 IEEE Conference on Decision and Control, Houston, Texas, Dec. 1975,
pp. 20-25.
15. D. P. Bertsekas, "Newton's Method for Linear Optimal Control
Problems," Proc. of IFAC Symposium on Large Scale Systems, Udine, Italy,
June 1976, pp. 353-359.
16. S. Shreve and D. P. Bertsekas, "Equivalent Deterministic and
Stochastic Optimal Control Problems," Proc. of 1976 IEEE Conf. on
Decision and Control, Clearwater Beach, Fla., Dec. 1976, pp. 705-709.
17. D. P. Bertsekas, "Decomposition Methods for Large-Scale Nonconvex
Optimization Problems," Proc. of 1976 IEEE Conf. on Decision and Control,
Clearwater Beach, Fla., Dec. 1976, pp. 532-536.
18. S. Shreve and D. P. Bertsekas, "A New Theoretical Framework for
Finite Horizon Stochastic Control," Proc. Fourteen Annual Allerton
Conference on Circuit and System Theory, Allerton Park, Ill. Oct. 1976,
pp. 336-343.
19. D. P. Bertsekas, "Minimax Methods Based on Approximation," Proc. of
the 1976 Johns Hopkins Conference on Information and Sciences and
Systems, Baltimore, MD, March 1976, pp. 463-465.
20. D. P. Bertsekas, "Local Convex Conjugacy and Fenchel Duality,"
Preprints of Seventh Triennial World Congress of IFAC, Helsinki, June
1978, Vol. 2, pp. 1079-1084.
21. D. P. Bertsekas, "Routing Algorithms for Data Communication
Networks," Proc. of MECO'78, Athens, Greece, June 1978.
22. D. P. Bertsekas, E. Gafni, and K. Vastola, "Validation of Algorithms
for Optimal Routing of Flow in Networks," Proc. 1978 IEEE Conference on
Decision and Control, San Diego, CA, Jan. 1979, pp. 220-227.
23. D. P. Bertsekas, "Globally Convergent Newton Methods for Constrained
Optimization Using Differentiable Exact Penalty Functions," Proc. of 19th
IEEE Conference on Decision and Control, Albuquerque, NM, Dec. 1980, pp.
234-238.
24. D. P. Bertsekas, "Dynamic Models of Shortest Path Routing Algorithms
for Communication Networks with Multiple Destinations," Proceedings 1979
IEEE Conference on Decision and Control, Ft. Lauderdale, Fla., Dec. 1979.
25. D. P. Bertsekas, "An Algorithm for the Hitchcock Transportation
Problem," Proceedings Seventeenth Annual Allerton Conference on
Communication , Control, and Computing, Allerton Park, Ill., Oct. 1979.
26. D. P. Bertsekas, "Variable Metric Methods for Constrained
Optimization Using Differentiable Exact Penalty Functions," Proc.
Eighteenth Annual Allerton Conf. on Comm., Control, and Computing,
Allerton Park, Ill., Oct. 1980.
27. D. P. Bertsekas, Class of Optimal Routing Algorithms for
Communication Networks," Proc. of the Fifth International Conference on
Computer Communication, Atlanta, GA, Oct. 1980, pp. 71-76.
28. D. P. Bertsekas, G. Lauer, N. Sandell, and T. Posbergh, "Optimal
Short-Term Scheduling of Large-Scale Power Systems," Proc. of 1981 IEEE
Conference on Decision and Control, San Diego, CA, Dec. 1981.
29. D. P. Bertsekas, "A Model for Uncoordinated Distributed Computation
of Fixed Points," Proc. of Nineteenth Annual Allerton Conference on
Communication, Control, and Computing, Allerton Park, Ill., Oct. 1981.
30. D. P. Bertsekas, "Distributed Dynamic Programming," Proc. 1981 IEEE
Conference on Decision and Control, San Diego, CA, Dec. 1981.
31. N. Sandell, D. P. Bertsekas, J. Shaw, S. Gully, and R. Gendron,
"Optimal Scheduling of Hydro-Electric Power Plants," Proc. of 1982 IEEE
International Large Scale Systems Symposium, Virginia Beach, VA, Oct.
1982.
32. J. Kimemia, S. B. Gershwin, and D. P. Bertsekas, "Computation of
Production Control Policies by a Dynamic Programming Technique," Proc. of
1982 IEEE International Large Scale Systems Symposium, Virginia Beach,
VA, Oct. 1982, pp. 393-397.
33. E. Gafni and D. P. Bertsekas, "Dynamic Control of Input Session Rates
in Communication Networks," Proc of MILCOM'82, Bedford, MA, Oct. 1982.
34. D. P. Bertsekas and E. Gafni, "Projected Newton Methods and
Optimization of Multicommodity Flows," Proc. of 1982 IEEE Conf. on
Decision and Control, Orlando, Fla., Dec. 1982.
35. D. P. Bertsekas and N. R. Sandell, "Estimates of the Duality Gap for
Large-Scale Separable Nonconvex Optimization Problems," Proc. of 1981
IEEE Conf. on Decision and Control, Orlando, Fla., Dec. 1982.
36. E. M. Gafni and D. P. Bertsekas, "Path Assignment for Virtual Circuit
Routing," SIGCOMM 83 Symposium on Communications Architectures and
Protocols, Austin, TX, March 1983, pp. 21-25.
37. K. R. Pattipati, J. J. Shaw, D. P. Bertsekas, J. C.. Deckert, M. P.
Kastner, L. K. Beean, and R. F. Gendron, "A Model for the Optimal
Synthesis and Analysis of Maintenance Facilities," Proc. of IEEE Autotest
Conference, Nov. 1983, pp. 449-456.
38. J. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed
Optimization Algorithms with Communications," Proc. 6th MIT/ONR Workshop
on C3 Systems, Dec. 1983, pp. 215-218.
39. J. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed
Deterministic and Stochastic Optimization Algorithms with Applications in
Systems Identification," Proc. 1983 Melecon Conference, Athens, Greece,
May 1983.
40. D. P. Bertsekas, I. J. Shaw, and R. F. Gendron, "Preconditioned
Conjugate Gradient Methods for Optimal Control Problems with Delays with
Application in Hydroelectric Power Systems Scheduling," Proc.of 22nd IEEE
Conf. on Dec. and Control, San Antonio, TX, Dec. 1983, pp. 1434-1442.
41. D. P. Bertsekas, "A Model for Distributed Asynchronous Computation,"
Trans. of the Second Army Conference on Applied Mathematics and
Computing, Rensselaer Poly. Inst., Troy, N.Y., Feb. 1985, pp. 943-948.
42. J. N. Tsitsiklis and D. P. Bertsekas, "Distributed Asynchronous
Optimal Routing in Data Networks," Proc. of 23rd Conference on Decision
and Control, Las Vegas, NM, Dec. 1984, pp. 1133-1138.
43. D. P. Bertsekas, "Distributed Relaxation Methods for Linear Network
Flow Problems," Proc. 25th IEEE Conference on Decision and Control,
Athens, Greece, 1986.
44. D. P. Bertsekas and D. A. Castanon, "Adaptive Aggregation Methods for
Discounted Dynamic Programming," Proc. 25th IEEE Conference on Decision
and Control, Athens, Greece, Dec. 1986.
45. W. K. Tsai, J. N. Tsitsiklis, and D. P. Bertsekas, "Some Issues in
Distributed Asynchronous Routing in Virtual Circuit Data Networks," Proc.
25th Conference on Decision and Control, Athens, Greece, Dec. 1986.
46. D. P. Bertsekas and J. Eckstein, "Distributed Relaxation Methods for
Linear Network Flow Problems," Proc. of IFAC 1987, Munich, Germany, July
1987.
47. D. P. Bertsekas and J. N. Tsitsiklis, "Convergence Rate and
Termination of Asynchronous Iterative Algorithms", Proceedings of the
1989 International Conference on Supercomputing, Crete, Greece, pp.
461-470, June 1989.
48. D. P. Bertsekas, "Auction Algorithms for Network Flow Problems: A
Tutorial Introduction," Proc. 29th Annual Allerton Conference on
Communication, Control, and Computing, Allerton Park, Ill., Oct. 1991.
49. E. A. Varvarigos and D. P. Bertsekas, "Partial Multinode Broadcast
for D-Dimensional Meshes", 1992 International Conference on Parallel
Processing, pp. III-51-III-54.
50. D. P. Bertsekas, "Some Communication Aspects of Parallel Computing
Systems", Proc. of LAAS Symposium, Toulouse, France, pp. 141-145, 1993.
51. E. A. Varvarigos, and D. P. Bertsekas, "Partial Multinode Broadcast
and Partial Exchange in d-Dimensional Meshes", Proc. of 1992 Int'l
Confer. on Parall. Proces., Vol. 3, 1992, pp. 51-54.
52. E. A. Varvarigos, and D. P. Bertsekas, "Comparison of Five Routing
Schemes for Multiprocessor Communications", Proc. 4th Int'l Confer. on
Adva. in Comm. and Control, 1993, pp. 22-33.
53. D. P. Bertsekas, "Differential Training of Rollout Policies", Proc.
35th Allerton Conference on Communication, Control, and Computing,
Allerton Park, Ill., 1997, pp. 913-922.
54. D. P. Bertsekas, "New Value Iteration and Q-Learning Methods for the
Average Cost Dynamic Programming Problem," Proc. 1998 IEEE Conference on
Decision and Control Conference.
55. A. Geary, and D. P. Bertsekas, "Incremental Subgradient Methods for
Nondifferentiable Optimization," Proc. 1999 IEEE Conference on Decision
and Control Conference.
56. C. Wu, and D. P. Bertsekas, "Didtributed Power Control Algorithms
for Wireless Networks'', Proc. 1999 IEEE Conference on Decision and
Control Conference.
57. D. P. Bertsekas, D. A. Castanon, M. L. Curry, and D. Logan, "Adaptive Multi-Platform
Scheduling in a Risky Environment," Proceedings of Symposium on Advances in Enterprise Control, San
Diego, CA, November 1999.
58. C. Wu, M. L. Curry, D. P. Bertsekas and D. A. Castanon, "Approximate Dynamic Programming for
Multi-Platform Scheduling in a Risky Environment," Proceedings of Symposium on Advances in Enterprise
Control, Minneapolis, MN, June 2000.
59. D. P. Bertsekas and A. E. Ozdaglar-Koksal, "Enhanced Optimality Conditions and Exact Penalty
Functions," Proceedings of Allerton Conference Allerton Park, Ill., Oct. 2000.
60. A. Nedic and D. P. Bertsekas, "Convergence Rate of Incremental Subgradient Algorithms,"
Stochastic Optimization: Algorithms and Applications (S. Uryasev and P. M. Pardalos, Editors), pp.
263-304, Kluwer Academic Publishers, 2000.
61. D. P. Bertsekas, "Auction Algorithms," Encyclopedia of
Optimization, Kluwer, 2002.
62. D. P. Bertsekas, "Neuro-Dynamic Programming," Encyclopedia of
Optimization, Kluwer, 2002.
63. A. Nedic, D. Bertsekas, and V. Borkar, "Distributed Asynchronous Subgradient Methods for
Nondifferentiable Optimization," in Inherently Parallel Algorithms in Optimization, by D. Butnariou
and Y. Censor (eds.), Kluwer, 2001.
64. A. E. Ozdaglar and D. P. Bertsekas, "Optimal Solution of Integer Multicommodity Flow Problems with
Application in Optical Networks," Proc. of Symposium on Global Optimization, Santorini, Greece, June 2003;
Frontiers in global optimization, pp. 411--435, Nonconvex Optim. Appl., 74, Kluwer Acad. Publ., Boston, MA,
2004.
65. H. Yu and D. P. Bertsekas,
"Discretized Approximations for POMDP with Average Cost," Proc. of 20th Conference on Uncertainty in
Artificial Intelligence, Banff, Canada, July 2004.
66. H. Yu and D. P. Bertsekas, "Q-Learning Algorithms for Optimal Stopping Based on Least Squares," Proc. European Control Conference 2007, Kos, Greece, July 2007.
67. H. Yu and D. P. Bertsekas, "Basis Function Adaptation Methods for Cost Approximation in MDP," Proc. of IEEE International Symposium on Adaptive Dynamic Programming and Reinforcement Learning 2009, Nashville, TN.
68. N. Polydorides, M. Wang, and D. P. Bertsekas, "A Quasi Monte Carlo Method for Large Scale Inverse Problems," Proc. of The 9th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (MCQMC 2010); to be published in "Monte Carlo and Quasi-Monte Carlo Methods 2010," by H. Wozniakowski and L. Plaskota (eds), Springer-Verlag.
69. D. P. Bertsekas and H. Yu, "Distributed Asynchronous Policy Iteration in Dynamic Programming," Proc. of 2010 Allerton Conference on Communication, Control, and Computing, Allerton Park, ILL, Sept. 2010.