| Year |
Citation |
Score |
| 2019 |
Bertsekas DP. Affine Monotonic and Risk-Sensitive Models in Dynamic Programming Ieee Transactions On Automatic Control. 64: 3117-3128. DOI: 10.1109/Tac.2019.2896049 |
0.483 |
|
| 2019 |
Bertsekas DP. Feature-based aggregation and deep reinforcement learning: a survey and some new implementations Ieee/Caa Journal of Automatica Sinica. 6: 1-31. DOI: 10.1109/Jas.2018.7511249 |
0.372 |
|
| 2019 |
Bertsekas DP. Robust shortest path planning and semicontractive dynamic programming Naval Research Logistics. 66: 15-37. DOI: 10.1002/Nav.21697 |
0.517 |
|
| 2018 |
Bertsekas DP. Stable Optimal Control and Semicontractive Dynamic Programming Siam Journal On Control and Optimization. 56: 231-252. DOI: 10.1137/17M1122815 |
0.488 |
|
| 2018 |
Bertsekas DP. Proper Policies in Infinite-State Stochastic Shortest Path Problems Ieee Transactions On Automatic Control. 63: 3787-3792. DOI: 10.1109/Tac.2018.2811781 |
0.442 |
|
| 2018 |
Bertsekas DP. Proximal algorithms and temporal difference methods for solving fixed point problems Computational Optimization and Applications. 70: 709-736. DOI: 10.1007/S10589-018-9990-5 |
0.515 |
|
| 2017 |
Bertsekas DP. Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming. Ieee Transactions On Neural Networks and Learning Systems. 28: 500-509. PMID 28055911 DOI: 10.1109/Tnnls.2015.2503980 |
0.481 |
|
| 2017 |
Bertsekas DP. Regular Policies in Abstract Dynamic Programming Siam Journal On Optimization. 27: 1694-1727. DOI: 10.1137/16M1090946 |
0.449 |
|
| 2016 |
Wang M, Bertsekas DP. Stochastic First-Order Methods with Random Constraint Projection Siam Journal On Optimization. 26: 681-717. DOI: 10.1137/130931278 |
0.45 |
|
| 2015 |
Yu H, Bertsekas DP. A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies Mathematics of Operations Research. 40: 926-968. DOI: 10.1287/Moor.2014.0704 |
0.462 |
|
| 2015 |
Wang M, Bertsekas DP. Incremental constraint projection methods for variational inequalities Mathematical Programming. 150: 321-363. DOI: 10.1007/S10107-014-0769-X |
0.308 |
|
| 2014 |
Wang M, Bertsekas DP. Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems Mathematics of Operations Research. 39: 1-30. DOI: 10.1287/Moor.2013.0596 |
0.419 |
|
| 2013 |
Yu H, Bertsekas DP. On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems Mathematics of Operations Research. 38: 209-227. DOI: 10.1287/Moor.1120.0562 |
0.349 |
|
| 2013 |
Yu H, Bertsekas DP. Q-learning and policy iteration algorithms for stochastic shortest path problems Annals of Operations Research. 208: 95-132. DOI: 10.1007/S10479-012-1128-Z |
0.451 |
|
| 2012 |
Bertsekas DP, Yu H. Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming Mathematics of Operations Research. 37: 66-94. DOI: 10.1287/Moor.1110.0532 |
0.481 |
|
| 2011 |
Bertsekas DP, Yu H. A Unifying Polyhedral Approximation Framework for Convex Optimization Siam Journal On Optimization. 21: 333-360. DOI: 10.1137/090772204 |
0.542 |
|
| 2011 |
Bertsekas DP. Temporal Difference Methods for General Projected Equations Ieee Transactions On Automatic Control. 56: 2128-2139. DOI: 10.1109/Tac.2011.2115290 |
0.425 |
|
| 2011 |
Bertsekas DP. Approximate Policy Iteration: A Survey and Some New Methods Journal of Control Theory and Applications. 9: 310-335. DOI: 10.1007/S11768-011-1005-3 |
0.363 |
|
| 2011 |
Bertsekas DP. Incremental proximal methods for large scale convex optimization Mathematical Programming. 129: 163-195. DOI: 10.1007/S10107-011-0472-0 |
0.417 |
|
| 2010 |
Yu H, Bertsekas DP. Error Bounds for Approximations from Projected Linear Equations Mathematics of Operations Research. 35: 306-329. DOI: 10.1287/Moor.1100.0441 |
0.314 |
|
| 2010 |
Nedić A, Bertsekas DP. The effect of deterministic noise in subgradient methods Mathematical Programming. 125: 75-99. DOI: 10.1007/S10107-008-0262-5 |
0.376 |
|
| 2009 |
Yu H, Bertsekas DP. Convergence Results for Some Temporal Difference Methods Based on Least Squares Ieee Transactions On Automatic Control. 54: 1515-1531. DOI: 10.1109/Tac.2009.2022097 |
0.461 |
|
| 2009 |
Bertsekas DP, Yu H. Projected equation methods for approximate solution of large linear systems Journal of Computational and Applied Mathematics. 227: 27-50. DOI: 10.1016/J.Cam.2008.07.037 |
0.386 |
|
| 2008 |
Yu H, Bertsekas DP. On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP Mathematics of Operations Research. 33: 1-11. DOI: 10.1287/Moor.1070.0279 |
0.429 |
|
| 2008 |
Bertsekas DP. Extended Monotropic Programming and Duality Journal of Optimization Theory and Applications. 139: 209-225. DOI: 10.1007/S10957-008-9393-3 |
0.302 |
|
| 2007 |
Bertsekas DP. Separable Dynamic Programming and Approximate Decomposition Methods Ieee Transactions On Automatic Control. 52: 911-916. DOI: 10.1109/Tac.2007.895901 |
0.477 |
|
| 2007 |
Bertsekas DP, Tseng P. Set intersection theorems and existence of optimal solutions Mathematical Programming. 110: 287-314. DOI: 10.1007/S10107-006-0003-6 |
0.662 |
|
| 2007 |
Bertsekas DP. Neuro-Dynamic Programming: An Overview and Recent Results A Quarterly Journal of Operations Research. 71-72. DOI: 10.1007/978-3-540-69995-8_11 |
0.308 |
|
| 2006 |
Bertsekas DP, Ozdaglar AE, Tseng P. Enhanced Fritz John Conditions for Convex Programming Siam Journal On Optimization. 16: 766-797. DOI: 10.1137/040613068 |
0.682 |
|
| 2005 |
Bertsekas DP. Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC* European Journal of Control. 11: 310-334. DOI: 10.3166/Ejc.11.310-334 |
0.413 |
|
| 2004 |
Ozdaglar AE, Bertsekas DP. The relation between pseudonormality and quasiregularity in constrained optimization Optimization Methods & Software. 19: 493-506. DOI: 10.1080/10556780410001709420 |
0.431 |
|
| 2003 |
Ozdaglar AE, Bertsekas DP. Routing and wavelength assignment in optical networks Ieee Acm Transactions On Networking. 11: 259-272. DOI: 10.1109/Tnet.2003.810321 |
0.52 |
|
| 2003 |
Nedić A, Bertsekas DP. Least Squares Policy Evaluation Algorithms with Linear Function Approximation Discrete Event Dynamic Systems. 13: 79-110. DOI: 10.1023/A:1022192903948 |
0.481 |
|
| 2002 |
Abounadi J, Bertsekas DP, Borkar V. Stochastic Approximation for Nonexpansive Maps: Application to Q -Learning Algorithms Siam Journal On Control and Optimization. 41: 1-22. DOI: 10.1137/S0363012998346621 |
0.37 |
|
| 2002 |
Bertsekas DP, Ozdaglar AE. Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization Journal of Optimization Theory and Applications. 114: 287-343. DOI: 10.1023/A:1016083601322 |
0.424 |
|
| 2001 |
Nedic A, Bertsekas DP. Incremental Subgradient Methods for Nondifferentiable Optimization Siam Journal On Optimization. 12: 109-138. DOI: 10.1137/S1052623499362111 |
0.477 |
|
| 2001 |
Abounadi J, Bertsekas D, Borkar VS. Learning Algorithms for Markov Decision Processes with Average Cost Siam Journal On Control and Optimization. 40: 681-698. DOI: 10.1137/S0363012999361974 |
0.459 |
|
| 2001 |
Wu C, Bertsekas DP. Distributed power control algorithms for wireless networks Ieee Transactions On Vehicular Technology. 50: 504-514. DOI: 10.1109/25.923062 |
0.357 |
|
| 2000 |
Tseng P, Bertsekas DP. An E-Relaxation Method For Separable Convex Cost Generalized Network Flow Problems' Mathematical Programming. 88: 85-104. DOI: 10.1007/Pl00011379 |
0.656 |
|
| 1999 |
Patek SD, Bertsekas DP. Stochastic shortest path games Siam Journal On Control and Optimization. 37: 804-824. DOI: 10.1137/S0363012996299557 |
0.432 |
|
| 1999 |
Bertsekas DP, Castanon DA. Journal of Heuristics. 5: 89-108. DOI: 10.1023/A:1009634810396 |
0.518 |
|
| 1999 |
Bertsekas DP. A Note on Error Bounds for Convex and Nonconvex Programs Computational Optimization and Applications. 12: 41-51. DOI: 10.1023/A:1008659512824 |
0.38 |
|
| 1998 |
Bertsekas DP. A New Value Iteration method for the Average Cost Dynamic Programming Problem Siam Journal On Control and Optimization. 36: 742-759. DOI: 10.1137/S0363012995291609 |
0.48 |
|
| 1998 |
Polymenakos LC, Bertsekas DP, Tsitsiklis JN. Implementation of efficient algorithms for globally optimal trajectories Ieee Transactions On Automatic Control. 43: 278-283. DOI: 10.1109/9.661081 |
0.463 |
|
| 1997 |
Bertsekas DP. A New Class of Incremental Gradient Methods for Least Squares Problems Siam Journal On Optimization. 7: 913-926. DOI: 10.1137/S1052623495287022 |
0.499 |
|
| 1997 |
Bertsekas DP, Polymenakos LC, Tseng P. An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems Siam Journal On Optimization. 7: 853-870. DOI: 10.1137/S1052623495285886 |
0.706 |
|
| 1997 |
Bertsekas DP, Tsitsiklis JN, Wu C. Rollout Algorithms for Combinatorial Optimization Journal of Heuristics. 3: 245-262. DOI: 10.1023/A:1009635226865 |
0.513 |
|
| 1996 |
Bertsekas DP. Incremental Least Squares Methods and the Extended Kalman Filter Siam Journal On Optimization. 6: 807-822. DOI: 10.1137/S1052623494268522 |
0.36 |
|
| 1996 |
Varvarigos EA, Bertsekas DP. A conflict sense routing protocol and its performance for hypercubes Ieee Transactions On Computers. 45: 693-703. DOI: 10.1109/12.506425 |
0.325 |
|
| 1996 |
Bertsekas DP. Thevenin decomposition and large-scale optimization Journal of Optimization Theory and Applications. 89: 1-15. DOI: 10.1007/Bf02192638 |
0.474 |
|
| 1996 |
Bertsekas DP, Guerriero F, Musmanno R. Parallel asynchronous label-correcting methods for shortest paths Journal of Optimization Theory and Applications. 88: 297-320. DOI: 10.1007/Bf02192173 |
0.364 |
|
| 1995 |
Bertsekas DP. A counterexample to temporal differences learning Neural Computation. 7: 270-279. DOI: 10.1162/Neco.1995.7.2.270 |
0.376 |
|
| 1995 |
Varvarigos EA, Bertsekas DP. Dynamic broadcasting in parallel computing Ieee Transactions On Parallel and Distributed Systems. 6: 120-131. DOI: 10.1109/71.342123 |
0.346 |
|
| 1995 |
Bertsekas DP. Generic rank-one corrections for value iteration in Markovian decision problems Operations Research Letters. 17: 111-119. DOI: 10.1016/0167-6377(95)00007-7 |
0.365 |
|
| 1995 |
Bertsekas DP. An auction algorithm for the max-flow problem Journal of Optimization Theory and Applications. 87: 69-101. DOI: 10.1007/Bf02192042 |
0.459 |
|
| 1995 |
Bertsekas DP, Pallottino S, Scutellà MG. Polynomial auction algorithms for shortest paths Computational Optimization and Applications. 4: 99-125. DOI: 10.1007/Bf01302891 |
0.367 |
|
| 1994 |
Bertsekas DP, Tseng P. Partial Proximal Minimization Algorithms for Convex Pprogramming Siam Journal On Optimization. 4: 551-572. DOI: 10.1137/0804031 |
0.406 |
|
| 1994 |
Varvarigos EA, Bertsekas DP. Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes Journal of Parallel and Distributed Computing. 23: 177-189. DOI: 10.1006/Jpdc.1994.1130 |
0.382 |
|
| 1993 |
Bertsekas DP, Castañon DA. Parallel Asynchronous Hungarian Methods for the Assignment Problem Orsa Journal On Computing. 5: 261-274. DOI: 10.1287/Ijoc.5.3.261 |
0.434 |
|
| 1993 |
Bertsekas DP, Castañon DA, Tsaknakis H. Reverse Auction and the Solution of Inequality Constrained Assignment Problems Siam Journal On Optimization. 3: 268-297. DOI: 10.1137/0803013 |
0.417 |
|
| 1993 |
Varvarigos EA, Bertsekas DP. Multinode broadcast in hypercubes and rings with randomly distributed length of packets Ieee Transactions On Parallel and Distributed Systems. 4: 144-154. DOI: 10.1109/71.207590 |
0.322 |
|
| 1993 |
Tseng P, Bertsekas DP. On the convergence of the exponential multiplier method for convex programming Mathematical Programming. 60: 1-19. DOI: 10.1007/Bf01580598 |
0.696 |
|
| 1993 |
Bertsekas DP, Casta�on DA. Parallel primal-dual methods for the minimum cost flow problem Computational Optimization and Applications. 2: 317-336. DOI: 10.1007/Bf01299544 |
0.516 |
|
| 1993 |
Bertsekas DP, Casta�on DA. A generic auction algorithm for the minimum cost network flow problem Computational Optimization and Applications. 2: 229-259. DOI: 10.1007/Bf01299450 |
0.484 |
|
| 1993 |
Bertsekas DP. A simple and fast label correcting algorithm for shortest paths Networks. 23: 703-709. DOI: 10.1002/Net.3230230808 |
0.396 |
|
| 1992 |
Eckstein J, Bertsekas DP. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Mathematical Programming. 55: 293-318. DOI: 10.1007/Bf01581204 |
0.411 |
|
| 1992 |
Bertsekas DP, Castañon DA. A forward/reverse auction algorithm for asymmetric assignment problems Computational Optimization and Applications. 1: 277-297. DOI: 10.1007/Bf00249638 |
0.413 |
|
| 1992 |
Bertsekas DP. Auction algorithms for network flow problems : a tutorial introduction Computational Optimization and Applications. 1: 7-66. DOI: 10.1007/Bf00247653 |
0.51 |
|
| 1991 |
Bertsekas DP, Tsitsiklis JN. An Analysis of Stochastic Shortest Path Problems Mathematics of Operations Research. 16: 580-595. DOI: 10.1287/Moor.16.3.580 |
0.392 |
|
| 1991 |
Tseng P, Bertsekas DP. Relaxation methods for problems with strictly convex costs and linear constraints Mathematics of Operations Research. 16: 462-481. DOI: 10.1287/Moor.16.3.462 |
0.69 |
|
| 1991 |
Bertsekas DP. An Auction Algorithm for Shortest Paths Siam Journal On Optimization. 1: 425-447. DOI: 10.1137/0801026 |
0.42 |
|
| 1991 |
Bertsekas DP, Özveren C, Stamoulis GD, Tseng P, Tsitsiklis JN. Optimal communication algorithms for hypercubes Journal of Parallel and Distributed Computing. 11: 263-275. DOI: 10.1016/0743-7315(91)90033-6 |
0.698 |
|
| 1991 |
Bertsekas DP, Tsitsiklis JN. Some aspects of parallel and distributed iterative algorithms-A survey Automatica. 27: 3-21. DOI: 10.1016/0005-1098(91)90003-K |
0.381 |
|
| 1990 |
Bertsekas DP. The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial Interfaces. 20: 133-149. DOI: 10.1287/Inte.20.4.133 |
0.474 |
|
| 1990 |
Tseng P, Bertsekas DP, Tsitsiklis JN. Partially asynchronous, parallel algorithms for network flow and other problems Siam Journal On Control and Optimization. 28: 678-710. DOI: 10.1137/0328040 |
0.711 |
|
| 1990 |
Tseng P, Bertsekas DP. Relaxation methods for monotropic programs Mathematical Programming. 46: 127-151. DOI: 10.1007/Bf01585734 |
0.695 |
|
| 1989 |
Bertsekas DP, Castanon DA. Adaptive Aggregation Methods for Infinite Horizon Dynamic Programming Ieee Transactions On Automatic Control. 34: 589-598. DOI: 10.1109/9.24227 |
0.457 |
|
| 1989 |
Bertsekas DP, Castanon DA. The auction algorithm for the transportation problem Annals of Operations Research. 20: 67-96. DOI: 10.1007/Bf02216923 |
0.444 |
|
| 1989 |
Dunn JC, Bertsekas DP. Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems Journal of Optimization Theory and Applications. 63: 23-38. DOI: 10.1007/Bf00940728 |
0.499 |
|
| 1988 |
Bertsekas DP, Tseng P. Relaxation methods for minimum cost ordinary and generalized network flow problems Operations Research. 36: 93-114. DOI: 10.1287/Opre.36.1.93 |
0.515 |
|
| 1988 |
Bertsekas DP, Tseng P. The relax codes for linear minimum cost network flow problems Annals of Operations Research. 13: 125-190. DOI: 10.1007/Bf02288322 |
0.671 |
|
| 1988 |
Bertsekas DP. The auction algorithm: a distributed relaxation method for the assignment problem Annals of Operations Research. 14: 105-123. DOI: 10.1007/Bf02186476 |
0.445 |
|
| 1988 |
Bertsekas DP, Eckstein J. Dual coordinate step methods for linear network flow problems Mathematical Programming. 42: 203-243. DOI: 10.1007/Bf01589405 |
0.481 |
|
| 1987 |
Tseng P, Bertsekas DP. Relaxation methods for linear programs Mathematics of Operations Research. 12: 569-596. DOI: 10.1287/Moor.12.4.569 |
0.456 |
|
| 1987 |
Bertsekas DP, Hossein PA, Tseng P. Relaxation methods for network flow problems with convex arc costs Siam Journal On Control and Optimization. 25: 1219-1243. DOI: 10.1137/0325067 |
0.476 |
|
| 1987 |
Bertsekas DP, Baz De. Distributed asynchronous relaxation methods for convex network flow problems Siam Journal On Control and Optimization. 25: 74-85. DOI: 10.1137/0325006 |
0.458 |
|
| 1987 |
Gafni EM, Bertsekas DP. Asymptotic Optimality of Shortest Path Routing Algorithms Ieee Transactions On Information Theory. 33: 83-90. DOI: 10.1109/Tit.1987.1057274 |
0.703 |
|
| 1987 |
Bertsekas DP, Eckstein J. Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems Ifac Proceedings Volumes. 20: 103-114. DOI: 10.1016/S1474-6670(17)55135-6 |
0.484 |
|
| 1987 |
Tseng P, Bertsekas DP. Relaxation methods for problems with strictly convex separable costs and linear constraints Mathematical Programming. 38: 303-321. DOI: 10.1007/Bf02592017 |
0.71 |
|
| 1986 |
Tsitsiklis JN, Bertsekas DP, Athans M. Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms Ieee Transactions On Automatic Control. 31: 803-812. DOI: 10.1109/Tac.1986.1104412 |
0.41 |
|
| 1986 |
Tsitsiklis JN, Bertsekas DP. Distributed Asynchronous Optimal Routing in Data Networks Ieee Transactions On Automatic Control. 31: 325-332. DOI: 10.1109/Tac.1986.1104261 |
0.464 |
|
| 1985 |
Shaw JJ, Gendron RF, Bertsekas DP. Optimal Scheduling Of Large Hydrothermal Power Systems Ieee Power & Energy Magazine. 104: 286-294. DOI: 10.1109/Tpas.1985.319042 |
0.467 |
|
| 1985 |
Bertsekas DP. A unified framework for primal-dual methods in minimum cost network flow problems Mathematical Programming. 32: 125-145. DOI: 10.1007/Bf01586087 |
0.497 |
|
| 1984 |
Bertsekas DP, Gallager RG, Gafni EM. Second Derivative Algorithms for Minimum Delay Distributed Routing ting in Networks Ieee Transactions On Communications. 32: 911-919. DOI: 10.1109/Tcom.1984.1096159 |
0.717 |
|
| 1984 |
Gafni EM, Bertsekas DP. Dynamic Control of Session Input Rates in Communication Networks Ieee Transactions On Automatic Control. 29: 1009-1016. DOI: 10.1109/Tac.1984.1103431 |
0.678 |
|
| 1984 |
Bertsekas DP. Convergence Analysis of Distributed Asynchronous Iterative Processes Ifac Proceedings Volumes. 17: 1145-1146. DOI: 10.1016/S1474-6670(17)61127-3 |
0.387 |
|
| 1983 |
Bertsekas DP, Gafni EM. Projected Newton Methods and Optimization of Multicommodity Flows Ieee Transactions On Automatic Control. 28: 1090-1096. DOI: 10.1109/Tac.1983.1103183 |
0.72 |
|
| 1983 |
Bertsekas DP. Distributed asynchronous computation of fixed points Mathematical Programming. 27: 107-120. DOI: 10.1007/Bf02591967 |
0.468 |
|
| 1982 |
Bertsekas DP. Projected Newton Methods for Optimization Problems with Simple Constraints Siam Journal On Control and Optimization. 20: 221-246. DOI: 10.1137/0320018 |
0.374 |
|
| 1982 |
Lauere S, Sandell NR, Bertsekas DP, Posbergh TA. Solution of large-scale optimal unit commitment problems Ieee Transactions On Power Apparatus and Systems. 79-86. DOI: 10.1109/Tpas.1982.317243 |
0.481 |
|
| 1982 |
Bertsekas D. Dynamic behavior of shortest path routing algorithms for communication networks Ieee Transactions On Automatic Control. 27: 60-74. DOI: 10.1109/Tac.1982.1102884 |
0.407 |
|
| 1982 |
Bertsekas DP. Enlarging The Region Of Convergence Of Newton'S Method For Constrained Optimization Journal of Optimization Theory and Applications. 36: 221-252. DOI: 10.1007/Bf00933831 |
0.499 |
|
| 1981 |
Gafni EM, Bertsekas DP. Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology Ieee Transactions On Communications. 29: 11-18. DOI: 10.1109/Tcom.1981.1094876 |
0.672 |
|
| 1981 |
Bertsekas DP. A new algorithm for the assignment problem Mathematical Programming. 21: 152-171. DOI: 10.1007/Bf01584237 |
0.461 |
|
| 1979 |
Shreve SE, Bertsekas DP. Universally Measurable Policies in Dynamic Programming Mathematics of Operations Research. 4: 15-30. DOI: 10.1287/Moor.4.1.15 |
0.713 |
|
| 1979 |
Bertsekas DP, Shreve SE. Existence of optimal stationary policies in deterministic optimal control Journal of Mathematical Analysis and Applications. 69: 607-620. DOI: 10.1016/0022-247X(79)90171-9 |
0.712 |
|
| 1979 |
Bertsekas DP. Convexification procedures and decomposition methods for nonconvex optimization problems Journal of Optimization Theory and Applications. 29: 169-197. DOI: 10.1007/Bf00937167 |
0.499 |
|
| 1978 |
Shreve SE, Bertsekas DP. Alternative Theoretical Frameworks for Finite Horizon Discrete-Time Stochastic Optimal Control Siam Journal On Control and Optimization. 16: 953-978. DOI: 10.1137/0316065 |
0.713 |
|
| 1978 |
Bertsekas DP. Local Convex Conjugacy and Fenchel Duality Ifac Proceedings Volumes. 11: 1079-1084. DOI: 10.1016/S1474-6670(17)66057-9 |
0.309 |
|
| 1978 |
Bertsekas DP. On the convergence properties of second-order multiplier methods Journal of Optimization Theory and Applications. 25: 443-449. DOI: 10.1007/Bf00932905 |
0.329 |
|
| 1977 |
Bertsekas DP. Monotone Mappings with Application in Dynamic Programming Siam Journal On Control and Optimization. 15: 438-464. DOI: 10.1137/0315031 |
0.446 |
|
| 1977 |
Bertsekas D. A vector space approach to models and optimization Ieee Transactions On Automatic Control. 22: 686-686. DOI: 10.1109/Tac.1977.1101583 |
0.308 |
|
| 1977 |
Bertsekas DP. Approximation procedures based on the method of multipliers Journal of Optimization Theory and Applications. 23: 487-510. DOI: 10.1007/Bf00933293 |
0.509 |
|
| 1976 |
Kort BW, Bertsekas DP. Combined Primal–Dual and Penalty Methods for Convex Programming Siam Journal On Control and Optimization. 14: 268-294. DOI: 10.1137/0314020 |
0.485 |
|
| 1976 |
Bertsekas DP. On Penalty and Multiplier Methods for Constrained Minimization Siam Journal On Control and Optimization. 14: 165-191. DOI: 10.1137/0314017 |
0.5 |
|
| 1976 |
Bertsekas D. A new algorithm for solution of resistive networks involving diodes Ieee Transactions On Circuits and Systems. 23: 599-608. DOI: 10.1109/Tcs.1976.1084140 |
0.473 |
|
| 1976 |
Bertsekas D. On error bounds for successive approximation methods Ieee Transactions On Automatic Control. 21: 394-396. DOI: 10.1109/Tac.1976.1101232 |
0.39 |
|
| 1976 |
Bertsekas D. Numerical methods for constrained optimization Ieee Transactions On Automatic Control. 21: 435-436. DOI: 10.1109/Tac.1976.1101222 |
0.43 |
|
| 1976 |
Bertsekas DP. Newton's Method for Linear Optimal Control Problems* Ifac Proceedings Volumes. 9: 353-359. DOI: 10.1016/S1474-6670(17)67358-0 |
0.517 |
|
| 1976 |
Bertsekas DP. Expository & survey paper: Multiplier methods: A survey Automatica. 12: 133-145. DOI: 10.1016/0005-1098(76)90077-7 |
0.36 |
|
| 1975 |
Bertsekas DP. Combined Primal-Dual And Penalty Methods For Constrained Minimization* Siam Journal On Control. 13: 521-544. DOI: 10.1137/0313030 |
0.388 |
|
| 1975 |
Bertsekas D. Convergence of discretization procedures in dynamic programming Ieee Transactions On Automatic Control. 20: 415-419. DOI: 10.1109/Tac.1975.1100984 |
0.509 |
|
| 1975 |
Bertsekas D. On the method of multipliers for convex programming Ieee Transactions On Automatic Control. 20: 385-388. DOI: 10.1109/Tac.1975.1100976 |
0.515 |
|
| 1975 |
Bertsekas DP. Multiplier Methods: A Survey Ifac Proceedings Volumes. 8: 351-363. DOI: 10.1016/S1474-6670(17)67759-0 |
0.365 |
|
| 1975 |
Bertsekas DP. Necessary and sufficient conditions for a penalty method to be exact Mathematical Programming. 9: 87-99. DOI: 10.1007/Bf01681332 |
0.477 |
|
| 1974 |
Bertsekas D. Partial conjugate gradient methods for a class of optimal control problems Ieee Transactions On Automatic Control. 19: 209-217. DOI: 10.1109/Tac.1974.1100556 |
0.486 |
|
| 1974 |
Bertsekas DP. Necessary and sufficient conditions for existence of an optimal portfolio Journal of Economic Theory. 8: 235-247. DOI: 10.1016/0022-0531(74)90016-7 |
0.364 |
|
| 1973 |
Bertsekas DP, Mitter SK. A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals Siam Journal On Control. 11: 637-652. DOI: 10.1137/0311049 |
0.561 |
|
| 1973 |
Bertsekas D. Linear convex stochastic control problems over an infinite horizon Ieee Transactions On Automatic Control. 18: 314-315. DOI: 10.1109/Tac.1973.1100298 |
0.517 |
|
| 1973 |
Bertsekas D, Rhodes I. Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems Ieee Transactions On Automatic Control. 18: 117-124. DOI: 10.1109/Tac.1973.1100241 |
0.473 |
|
| 1973 |
Bertsekas DP. Stochastic optimization problems with nondifferentiable cost functionals Journal of Optimization Theory and Applications. 12: 218-231. DOI: 10.1007/Bf00934819 |
0.492 |
|
| 1972 |
Bertsekas D. Infinite time reachability of state-space regions by using feedback control Ieee Transactions On Automatic Control. 17: 604-613. DOI: 10.1109/Tac.1972.1100085 |
0.308 |
|
| 1972 |
Bertsekas DP. Convergence of the feasible region in infinite horizon optimization problems Ieee Transactions On Automatic Control. 10: 287-293. DOI: 10.1109/Jacc.1972.4169730 |
0.46 |
|
| 1971 |
Bertsekas D, Rhodes I. Recursive state estimation for a set-membership description of uncertainty Ieee Transactions On Automatic Control. 16: 117-128. DOI: 10.1109/Tac.1971.1099674 |
0.368 |
|
| 1971 |
Bertsekas DP, Rhodes IB. On the minimax reachability of target sets and target tubes Automatica. 7: 233-247. DOI: 10.1016/0005-1098(71)90066-5 |
0.368 |
|
| 1970 |
Bertsekas D. Note on the design of linear systems with piecewise constant feedback gains Ieee Transactions On Automatic Control. 15: 262-263. DOI: 10.1109/Tac.1970.1099419 |
0.404 |
|
| Show low-probability matches. |