Publications: Dimitri Bertsekas
Download CSV for Dimitri Bertsekas
| Title | Year | Citations | Score |
|---|---|---|---|
|
Nonlinear programming
Athena Scientific, 1999 View Details |
1999 | 19821 | 100.0% |
|
Data networks
Prentice-hall, 1987 View Details |
1987 | 12682 | 100.0% |
|
Dynamic programming and optimal control
Athena Scientific, 1995 View Details |
1995 | 16114 | 100.0% |
|
Parallel and distributed computation
Prentice Hall Inc., 1989 View Details |
1989 | 9295 | 99.9% |
|
Constrained optimization and Lagrange multiplier methods
Academic press, 2014 View Details |
2014 | 6529 | 99.9% |
|
Neuro-dynamic programming
Decision and Control, 1995., Proceedings of the 34th IEEE Conference on, 1996 View Details |
1996 | 8171 | 99.9% |
|
Dynamic programming and stochastic control
Systems, Man and Cybernetics, IEEE Transactions on, 1976 View Details |
1976 | 4587 | 99.7% |
|
Introduction to linear optimization
Athena scientific 6, 479-530, 1997 View Details |
1997 | 4365 | 99.6% |
|
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
Mathematical Programming 55 (1-3), 293-318, 1992 View Details |
1992 | 3238 | 99.5% |
|
Convex analysis and optimization
Athena Scientific, 2003 View Details |
2003 | 3061 | 99.4% |
|
Stochastic optimal control: the discrete-time case
Athena Scientific, 1996 View Details |
1996 | 2753 | 99.3% |
|
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
IEEE transactions on automatic control 31 (9), 803-812, 1986 View Details |
1986 | 2286 | 99.0% |
|
Reinforcement learning and optimal control
Athena Scientific, 2019 View Details |
2019 | 826 | 99.0% |
|
Approximate dynamic programming
(No Title), 2018 View Details |
2018 | 951 | 98.8% |
|
Convex optimization theory
Athena Scientific, 2009 View Details |
2009 | 1137 | 98.3% |
|
Abstract dynamic programming
Athena Scientific, 2022 View Details |
2022 | 205 | 98.3% |
|
Convex optimization algorithms
Athena Scientific, 2015 View Details |
2015 | 814 | 98.3% |
|
Network optimization: continuous and discrete models
Athena Scientific, 1998 View Details |
1998 | 1347 | 98.0% |
|
Recursive state estimation for a set-membership description of uncertainty
IEEE Transactions on Automatic Control 16 (2), 117-128, 1971 View Details |
1971 | 930 | 98.0% |
|
Introduction to Probability
Athena Scientific, 2002 View Details |
2002 | 1354 | 98.0% |
|
Projected Newton methods for optimization problems with simple constraints
SIAM Journal on control and Optimization 20 (2), 221-246, 1982 View Details |
1982 | 884 | 97.7% |
|
On the Goldstein-Levitin-Polyak gradient projection method
IEEE Transactions on automatic control 21 (2), 174-184, 1976 View Details |
1976 | 771 | 97.0% |
|
On the minimax reachability of target sets and target tubes
Automatica 7 (2), 233-247, 1971 View Details |
1971 | 561 | 96.7% |
|
The auction algorithm: A distributed relaxation method for the assignment problem
Annals of operations research 14 (1), 105-123, 1988 View Details |
1988 | 772 | 96.6% |
|
An analysis of stochastic shortest path problems
Mathematics of Operations Research 16 (3), 580-595, 1991 View Details |
1991 | 691 | 96.0% |
|
Linear network optimization: algorithms and codes
MIT press, 1991 View Details |
1991 | 650 | 95.6% |
|
Incremental subgradient methods for nondifferentiable optimization
SIAM Journal on Optimization 12 (1), 109-138, 2001 View Details |
2001 | 746 | 95.5% |
|
Distributed algorithms for generating loop-free routes in networks with frequently changing topology
IEEE transactions on communications 29 (1), 11-18, 1981 View Details |
1981 | 536 | 95.4% |
|
Incremental gradient, subgradient, and proximal methods for convex optimization: A survey
Optimization for Machine Learning 2010 (1-38), 3, 2011 View Details |
2011 | 508 | 95.3% |
|
Multiplier methods: A survey
Automatica 12 (2), 133-145, 1976 View Details |
1976 | 484 | 95.0% |
|
Auction algorithms for network flow problems: A tutorial introduction
Computational optimization and applications 1, 7-66, 1992 View Details |
1992 | 561 | 94.7% |
|
Projection methods for variational inequalities with application to the traffic assignment problem
Nondifferential and variational techniques in optimization, 139-159, 2009 View Details |
2009 | 485 | 94.6% |
|
A new algorithm for the assignment problem
Mathematical Programming 21 (1), 152-171, 1981 View Details |
1981 | 406 | 93.8% |
|
Gradient convergence in gradient methods with errors
SIAM Journal on Optimization 10 (3), 627-642, 2000 View Details |
2000 | 575 | 93.7% |
|
Dynamic programming and optimal control
Journal of the Operational Research Society 47 (6), 833-833, 1996 View Details |
1996 | 481 | 93.6% |
|
Incremental proximal methods for large scale convex optimization
Mathematical programming 129 (2), 163-195, 2011 View Details |
2011 | 382 | 93.4% |
|
Infinite time reachability of state-space regions by using feedback control
IEEE Transactions on Automatic Control 17 (5), 604-613, 1972 View Details |
1972 | 331 | 93.3% |
|
Necessary and sufficient conditions for a penalty method to be exact
Mathematical programming 9 (1), 87-99, 1975 View Details |
1975 | 262 | 92.2% |
|
Distributed asynchronous computation of fixed points
Mathematical Programming 27 (1), 107-120, 1983 View Details |
1983 | 339 | 92.1% |
|
Athena Scientific optimization and computation series
Athena Scientific, 1999 View Details |
1999 | 446 | 92.1% |
|
Two-metric projection methods for constrained optimization
SIAM Journal on Control and Optimization 22 (6), 936-964, 1984 View Details |
1984 | 314 | 92.0% |
|
Rollout algorithms for stochastic scheduling problems
Journal of Heuristics 5, 89-108, 1999 View Details |
1999 | 443 | 92.0% |
|
Optimal short-term scheduling of large-scale power systems
IEEE Transactions on Automatic Control 28 (1), 1-11, 1983 View Details |
1983 | 332 | 91.9% |
|
The auction algorithm for assignment and other network flow problems: A tutorial
Interfaces 20 (4), 133-149, 1990 View Details |
1990 | 347 | 91.8% |
|
Distributed dynamic programming
IEEE transactions on Automatic Control 27 (3), 610-616, 1982 View Details |
1982 | 300 | 91.6% |
|
Approximate policy iteration: A survey and some new methods
Journal of Control Theory and Applications 9, 310-335, 2011 View Details |
2011 | 308 | 91.5% |
|
Dynamic programming and suboptimal control: A survey from ADP to MPC
European Journal of Control 11 (4-5), 310-334, 2005 View Details |
2005 | 377 | 91.4% |
|
A new class of incremental gradient methods for least squares problems
SIAM Journal on Optimization 7 (4), 913-926, 1997 View Details |
1997 | 371 | 91.0% |
|
Reinforcement learning for dynamic channel allocation in cellular telephone systems
Advances in neural information processing systems 9, 1996 View Details |
1996 | 352 | 91.0% |
|
Lessons from AlphaZero for optimal, model predictive, and adaptive control
Athena Scientific, 2022 View Details |
2022 | 52 | 90.9% |
|
Multiagent reinforcement learning: Rollout and policy iteration
IEEE/CAA Journal of Automatica Sinica 8 (2), 249-272, 2021 View Details |
2021 | 83 | 90.8% |
|
Convergence of discretization procedures in dynamic programming
IEEE Transactions on Automatic Control 20 (3), 415-419, 1975 View Details |
1975 | 227 | 90.8% |
|
Rollout algorithms for combinatorial optimization
Journal of Heuristics 3, 245-262, 1997 View Details |
1997 | 354 | 90.5% |
|
A distributed algorithm for the assignment problem
Lab. for Information and Decision Systems Working Paper, MIT, 1979 View Details |
1979 | 256 | 90.1% |
|
Relaxation methods for minimum cost ordinary and generalized network flow problems
Operations research 36 (1), 93-114, 1988 View Details |
1988 | 278 | 89.3% |
|
Rollout, policy iteration, and distributed reinforcement learning
Athena Scientific, 2021 View Details |
2021 | 73 | 89.2% |
|
Solution of large-scale optimal unit commitment problems
IEEE Transactions on Power Apparatus and Systems, 79-86, 1982 View Details |
1982 | 236 | 89.1% |
|
Value and policy iterations in optimal control and adaptive dynamic programming
IEEE transactions on neural networks and learning systems 28 (3), 500-509, 2015 View Details |
2015 | 193 | 89.1% |
|
The auction algorithm for the transportation problem
Annals of Operations Research 20 (1), 67-96, 1989 View Details |
1989 | 255 | 88.7% |
|
Routing and wavelength assignment in optical networks
IEEE/ACM transactions on networking 11 (2), 259-272, 2003 View Details |
2003 | 330 | 88.7% |
|
Second derivative algorithms for minimum delay distributed routing in networks
IEEE Transactions on Communications 32 (8), 911-919, 1984 View Details |
1984 | 224 | 88.4% |
|
Adaptive aggregation methods for infinite horizon dynamic programming
Dept. of Electrical Engineering and Computer Science, Laboratory for …, 1988 View Details |
1988 | 256 | 88.4% |
|
Convergence rate of incremental subgradient algorithms
Stochastic optimization: algorithms and applications, 223-264, 2001 View Details |
2001 | 314 | 88.2% |
|
Parallel synchronous and asynchronous implementations of the auction algorithm
Parallel Computing 17 (6-7), 707-732, 1991 View Details |
1991 | 244 | 87.7% |
|
On the convergence of the exponential multiplier method for convex programming
Mathematical programming 60 (1-3), 1-19, 1993 View Details |
1993 | 233 | 87.3% |
|
Feature-based aggregation and deep reinforcement learning: A survey and some new implementations
IEEE/CAA Journal of Automatica Sinica 6 (1), 1-31, 2018 View Details |
2018 | 130 | 87.2% |
|
On penalty and multiplier methods for constrained minimization
SIAM Journal on Control and Optimization 14 (2), 216-235, 1976 View Details |
1976 | 201 | 86.9% |
|
Augmented lagrangian methods
Parallel and distributed computation: numerical methods. Prentice hall …, 1989 View Details |
1989 | 217 | 86.9% |
|
Control of uncertain systems with a set-membership description of the uncertainty.
Massachusetts Institute of Technology, 1971 View Details |
1971 | 132 | 86.3% |
|
Distributed asynchronous optimal routing in data networks
IEEE Transactions on Automatic Control 31 (4), 325-332, 1986 View Details |
1986 | 196 | 86.0% |
|
Some aspects of parallel and distributed iterative algorithms—a survey
Automatica 27 (1), 3-21, 1991 View Details |
1991 | 212 | 85.9% |
|
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed computing 11 (4), 263-275, 1991 View Details |
1991 | 211 | 85.9% |
|
A neuro-dynamic programming approach to retailer inventory management
Proceedings of the 36th IEEE Conference on Decision and Control 4, 4052-4057, 1997 View Details |
1997 | 234 | 85.7% |
|
Incremental least squares methods and the extended Kalman filter
SIAM Journal on Optimization 6 (3), 807-822, 1996 View Details |
1996 | 228 | 85.7% |
|
Dynamic behavior of shortest path routing algorithms for communication networks
IEEE Transactions on Automatic Control 27 (1), 60-74, 1982 View Details |
1982 | 176 | 85.6% |
|
A descent numerical method for optimization problems with nondifferentiable cost functionals
SIAM Journal on Control 11 (4), 637-652, 1973 View Details |
1973 | 149 | 85.5% |
|
Learning algorithms for Markov decision processes with average cost
SIAM Journal on Control and Optimization 40 (3), 681-698, 2001 View Details |
2001 | 252 | 85.3% |
|
Stochastic optimization problems with nondifferentiable cost functionals
Journal of Optimization Theory and Applications 12 (2), 218-231, 1973 View Details |
1973 | 147 | 85.3% |
|
Least squares policy evaluation algorithms with linear function approximation
Discrete Event Dynamic Systems 13 (1-2), 79-110, 2003 View Details |
2003 | 249 | 85.1% |
|
A simple and fast label correcting algorithm for shortest paths
Networks 23 (8), 703-709, 1993 View Details |
1993 | 196 | 85.1% |
|
A new penalty function method for constrained minimization
Proceedings of the 1972 ieee conference on decision and control and 11th …, 1972 View Details |
1972 | 137 | 84.6% |
|
Combined primal-dual and penalty methods for constrained minimization
SIAM Journal on Control 13 (3), 521-544, 1975 View Details |
1975 | 138 | 84.0% |
|
Projected Newton methods and optimization of multicommodity flows
IEEE Transactions on Automatic Control 28 (12), 1090-1096, 1983 View Details |
1983 | 157 | 83.8% |
|
Min common/max crossing duality: A geometric view of conjugacy in convex optimization. Lab. for Information and Decision Systems
MIT, Tech. Rep. Report LIDS-P-2796, 2009 View Details |
2009 | 179 | 83.4% |
|
Linear network optimization
MIT Press, 1991 View Details |
1991 | 174 | 83.4% |
|
Dynamic Programming: Determinist. and Stochast. Models
Prentice-Hall, 1987 View Details |
1987 | 156 | 82.9% |
|
Nondifferentiable optimization via approximation
Nondifferentiable optimization, 1-25, 2009 View Details |
2009 | 174 | 82.9% |
|
A forward/reverse auction algorithm for asymmetric assignment problems
Computational Optimization and Applications 1, 277-297, 1992 View Details |
1992 | 167 | 82.6% |
|
Convexification procedures and decomposition methods for nonconvex optimization problems
Journal of Optimization Theory and Applications 29 (2), 169-197, 1979 View Details |
1979 | 139 | 82.5% |
|
An auction algorithm for shortest paths
SIAM Journal on Optimization 1 (4), 425-447, 1991 View Details |
1991 | 156 | 81.9% |
|
Distributed asynchronous incremental subgradient methods
Studies in Computational Mathematics 8 (C), 381-407, 2001 View Details |
2001 | 197 | 81.6% |
|
Relaxation methods for network flow problems with convex arc costs
SIAM Journal on Control and Optimization 25 (5), 1219-1243, 1987 View Details |
1987 | 140 | 81.3% |
|
Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems
IEEE Transactions on Automatic Control 18 (2), 117-124, 1973 View Details |
1973 | 110 | 81.2% |
|
Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
Journal of Optimization Theory and Applications 63 (1), 23-38, 1989 View Details |
1989 | 143 | 80.7% |
|
Dynamic control of session input rates in communication networks
IEEE Transactions on Automatic Control 29 (11), 1009-1016, 1984 View Details |
1984 | 121 | 80.0% |
|
Temporal differences-based policy iteration and applications in neuro-dynamic programming
Lab. for Info. and Decision Systems Report LIDS-P-2349, MIT, Cambridge, MA 14, 1996 View Details |
1996 | 156 | 79.9% |
|
RELAX-IV: A faster version of the RELAX code for solving minimum cost flow problems
Massachusetts Institute of Technology, Laboratory for Information and …, 1994 View Details |
1994 | 149 | 79.9% |
|
Distributed asynchronous relaxation methods for convex network flow problems
SIAM Journal on Control and Optimization 25 (1), 74-85, 1987 View Details |
1987 | 129 | 79.9% |
|
Combined primal–dual and penalty methods for convex programming
SIAM Journal on Control and Optimization 14 (2), 268-294, 1976 View Details |
1976 | 109 | 79.8% |
|
Dual coordinate step methods for linear network flow problems
Mathematical Programming 42 (1-3), 203-243, 1988 View Details |
1988 | 137 | 79.3% |
|
Necessary and sufficient conditions for existence of an optimal portfolio
Journal of Economic Theory 8 (2), 235-247, 1974 View Details |
1974 | 96 | 78.8% |
|
Optimal scheduling of large hydrothermal power systems
IEEE Transactions on Power Apparatus and Systems, 286-294, 1985 View Details |
1985 | 122 | 78.8% |
|
Convergence results for some temporal difference methods based on least squares
IEEE Transactions on Automatic Control 54 (7), 1515-1531, 2009 View Details |
2009 | 130 | 77.5% |
|
The relax codes for linear minimum cost network flow problems
Annals of Operations Research 13 (1), 125-190, 1988 View Details |
1988 | 123 | 77.3% |
|
Distributed dynamic programming
1981 20th IEEE Conference on Decision and Control including the Symposium on …, 1981 View Details |
1981 | 103 | 77.3% |
|
Distributed asynchronous relaxation methods for linear network flow problems
IFAC Proceedings Volumes 20 (5), 103-114, 1987 View Details |
1987 | 107 | 76.6% |
|
Optimization and Computation Series
Dynamic programming and optimal control 1, 2000 View Details |
2000 | 150 | 76.5% |
|
Auction Algorithms.
Encyclopedia of optimization 1, 73-77, 2009 View Details |
2009 | 118 | 75.6% |
|
Partially asynchronous, parallel algorithms for network flow and other problems
SIAM Journal on Control and Optimization 28 (3), 678-710, 1990 View Details |
1990 | 109 | 75.5% |
|
Approximation procedures based on the method of multipliers
Journal of Optimization Theory and Applications 23 (4), 487-510, 1977 View Details |
1977 | 87 | 75.2% |
|
R. Gallager Data Networks
Prentice Hall, E nglewood C liffs, New J ersey 1, 987, 1992 View Details |
1992 | 105 | 74.7% |
|
Nondifferentiable optimization
(No Title), 1975 View Details |
1975 | 79 | 74.5% |
|
Dynamic programming and optimal control. Belmont
MA: Athena Scientific, 2000 View Details |
2000 | 128 | 73.5% |
|
Missile defense and interceptor allocation by neuro-dynamic programming
IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and …, 2000 View Details |
2000 | 127 | 73.3% |
|
Convergence rate and termination of asynchronous iterative algorithms
Proceedings of the 3rd International Conference on Supercomputing, 461-470, 1989 View Details |
1989 | 93 | 73.3% |
|
Reverse auction and the solution of inequality constrained assignment problems
SIAM Journal on Optimization 3 (2), 268-297, 1993 View Details |
1993 | 95 | 73.0% |
|
A distributed asynchronous relaxation algorithm for the assignment problem
1985 24th IEEE Conference on Decision and Control, 1703-1704, 1985 View Details |
1985 | 87 | 72.6% |
|
Reinforcement learning for POMDP: Partitioned rollout and policy iteration with application to autonomous sequential repair problems
IEEE Robotics and Automation Letters 5 (3), 3967-3974, 2020 View Details |
2020 | 40 | 72.1% |
|
Parallel asynchronous label-correcting methods for shortest paths
Journal of Optimization Theory and Applications 88 (2), 297-320, 1996 View Details |
1996 | 98 | 71.4% |
|
Stochastic first-order methods with random constraint projection
SIAM Journal on Optimization 26 (1), 681-717, 2016 View Details |
2016 | 66 | 70.9% |
|
A unified framework for primal-dual methods in minimum cost network flow problems
Mathematical Programming 32 (2), 125-145, 1985 View Details |
1985 | 77 | 70.3% |
|
Rollout algorithms for discrete optimization: A survey
Handbook of combinatorial optimization 5, 2989-3013, 2013 View Details |
2013 | 78 | 70.2% |
|
Comments on “Coordination of groups of mobile autonomous agents using nearest neighbor rules”
IEEE Transactions on Automatic Control 52 (5), 968-969, 2007 View Details |
2007 | 96 | 70.1% |
|
Relaxation methods for problems with strictly convex separable costs and linear constraints
Mathematical Programming 38 (3), 303-321, 1987 View Details |
1987 | 75 | 69.7% |
|
Incremental constraint projection methods for variational inequalities
Mathematical Programming 150, 321-363, 2015 View Details |
2015 | 68 | 69.5% |
|
Pseudonormality and a Lagrange multiplier theory for constrained optimization
Journal of Optimization Theory and Applications 114, 287-343, 2002 View Details |
2002 | 101 | 69.3% |
|
Multiagent rollout algorithms and reinforcement learning
arXiv preprint arXiv:1910.00120, 2019 View Details |
2019 | 42 | 68.7% |
|
Improved temporal difference methods with linear function approximation
Learning and Approximate Dynamic Programming, 231-255, 2004 View Details |
2004 | 97 | 68.6% |
|
The effect of deterministic noise in subgradient methods
Mathematical programming 125 (1), 75-99, 2010 View Details |
2010 | 84 | 68.4% |
|
A counterexample to temporal differences learning
Neural computation 7 (2), 270-279, 1995 View Details |
1995 | 80 | 68.3% |
|
Stochastic approximation for nonexpansive maps: Application to Q-learning algorithms
SIAM Journal on Control and Optimization 41 (1), 1-22, 2002 View Details |
2002 | 94 | 67.8% |
|
An alternating direction method for linear programming
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1990 View Details |
1990 | 73 | 67.8% |
|
Alternative theoretical frameworks for finite horizon discrete-time stochastic optimal control
SIAM Journal on control and optimization 16 (6), 953-978, 1978 View Details |
1978 | 58 | 67.4% |
|
Nonlinear programming
SIAM Review 40 (3), 740-740, 1998 View Details |
1998 | 83 | 67.2% |
|
Multiplier methods for convex programming
1973 IEEE Conference on Decision and Control including the 12th Symposium on …, 1973 View Details |
1973 | 50 | 66.7% |
|
Universally measurable policies in dynamic programming
Mathematics of Operations Research 4 (1), 15-30, 1979 View Details |
1979 | 60 | 66.7% |
|
A class of optimal routing algorithms for communication networks
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1980 View Details |
1980 | 58 | 66.5% |
|
Distributed power control algorithms for wireless networks
IEEE Transactions on Vehicular Technology 50 (2), 504-514, 2001 View Details |
2001 | 85 | 65.9% |
|
Stochastic shortest path games
SIAM Journal on Control and Optimization 37 (3), 804-824, 1999 View Details |
1999 | 78 | 65.2% |
|
Projected equation methods for approximate solution of large linear systems
Journal of Computational and Applied Mathematics 227 (1), 27-50, 2009 View Details |
2009 | 73 | 64.9% |
|
Multiagent value iteration algorithms in dynamic programming and reinforcement learning
Results in Control and Optimization 1, 100003, 2020 View Details |
2020 | 30 | 64.6% |
|
Monotone mappings with application in dynamic programming
SIAM Journal on Control and Optimization 15 (3), 438-464, 1977 View Details |
1977 | 52 | 64.5% |
|
Error bounds for approximations from projected linear equations
Mathematics of Operations Research 35 (2), 306-329, 2010 View Details |
2010 | 71 | 64.5% |
|
Convergence rate of penalty and multiplier methods
1973 IEEE Conference on Decision and Control including the 12th Symposium on …, 1973 View Details |
1973 | 44 | 64.1% |
|
Finite termination of asynchronous iterative algorithms
Parallel Computing 22 (1), 39-56, 1996 View Details |
1996 | 67 | 64.0% |
|
Convergence of a gradient projection method
Laboratory for Information and Decision Systems, 1982 View Details |
1982 | 53 | 64.0% |
|
Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
Parallel Computing 18 (11), 1233-1257, 1992 View Details |
1992 | 61 | 63.7% |
|
Partial proximal minimization algorithms for convex pprogramming
SIAM Journal on Optimization 4 (3), 551-572, 1994 View Details |
1994 | 64 | 63.6% |
|
Parallel and distributed computation. Old Tappan
NJ (USA), 1989 View Details |
1989 | 57 | 63.6% |
|
Implementation of efficient algorithms for globally optimal trajectories
IEEE Transactions on Automatic Control 43 (2), 278-283, 1998 View Details |
1998 | 69 | 63.5% |
|
A generic auction algorithm for the minimum cost network flow problem
Computational Optimization and Applications 2, 229-259, 1993 View Details |
1993 | 57 | 62.6% |
|
Robust shortest path planning and semicontractive dynamic programming
Naval Research Logistics (NRL) 66 (1), 15-37, 2019 View Details |
2019 | 33 | 62.3% |
|
Partial conjugate gradient methods for a class of optimal control problems
IEEE Transactions on Automatic Control 19 (3), 209-217, 1974 View Details |
1974 | 40 | 62.2% |
|
Dynamic programming and optimal control. 2nd
Athena Scientific, 2000 View Details |
2000 | 73 | 62.2% |
|
Parallel asynchronous Hungarian methods for the assignment problem
ORSA Journal on Computing 5 (3), 261-274, 1993 View Details |
1993 | 56 | 62.2% |
|
Distributed relaxation methods for linear network flow problems
1986 25th IEEE Conference on Decision and Control, 2101-2106, 1986 View Details |
1986 | 50 | 62.1% |
|
Multiagent rollout and policy iteration for POMDP with application to multi-robot repair problems
Conference on Robot Learning, 1814-1828, 2021 View Details |
2021 | 20 | 62.0% |
|
Arpanet routing algorithm improvements
Bolt Beranek and Newman Incorporated, 1978 View Details |
1978 | 45 | 62.0% |
|
Incremental constraint projection-proximal methods for nonsmooth convex optimization
SIAM J. Optim.(to appear), 2013 View Details |
2013 | 55 | 61.6% |
|
Q-learning and enhanced policy iteration in discounted dynamic programming
Mathematics of Operations Research 37 (1), 66-94, 2012 View Details |
2012 | 58 | 61.3% |
|
Neuro-dynamic programming. 1996
Athena Scientific, 1996 View Details |
1996 | 58 | 61.2% |
|
Dynamic programming and optimal control
Athena Scientific, 1995 View Details |
1995 | 56 | 61.0% |
|
Temporal difference methods for general projected equations
IEEE Transactions on Automatic Control 56 (9), 2128-2139, 2011 View Details |
2011 | 59 | 60.8% |
|
Estimates of the duality gap for large-scale separable nonconvex optimization problems
1982 21st IEEE conference on decision and control, 782-785, 1982 View Details |
1982 | 45 | 60.6% |
|
Incremental aggregated proximal and augmented Lagrangian algorithms
arXiv preprint arXiv:1509.09257, 2015 View Details |
2015 | 48 | 60.5% |
|
Discretized approximations for POMDP with average cost
arXiv preprint arXiv:1207.4154, 2012 View Details |
2012 | 56 | 60.3% |
|
On the method of multipliers for convex programming
IEEE transactions on automatic control 20 (3), 385-388, 1975 View Details |
1975 | 38 | 60.2% |
|
Dynamic programming and optimal control 4th edition, volume ii
Athena Scientific, 2015 View Details |
2015 | 47 | 60.0% |
|
A new value iteration method for the average cost dynamic programming problem
SIAM journal on control and optimization 36 (2), 742-759, 1998 View Details |
1998 | 58 | 59.9% |
|
Algorithms for nonlinear multicommodity network flow problems
International Symposium on Systems Optimization and Analysis, 1979 View Details |
1979 | 42 | 59.6% |
|
Nonlinear programming. athena scientific belmont
Massachusets, USA, 1999 View Details |
1999 | 59 | 59.5% |
|
Q-learning and policy iteration algorithms for stochastic shortest path problems
Annals of Operations Research 208 (1), 95-132, 2013 View Details |
2013 | 50 | 59.1% |
|
Polynomial auction algorithms for shortest paths
Computational Optimization and Applications 4 (2), 99-125, 1995 View Details |
1995 | 51 | 58.8% |
|
A unifying polyhedral approximation framework for convex optimization
SIAM Journal on Optimization 21 (1), 333-360, 2011 View Details |
2011 | 54 | 58.7% |
|
Differential training of rollout policies
PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND …, 1997 View Details |
1997 | 55 | 58.5% |
|
Athena scientific
Nonlinear programming 4, 1995 View Details |
1995 | 50 | 58.4% |
|
Newton’s method for reinforcement learning and model predictive control
Results in Control and Optimization 7, 100121, 2022 View Details |
2022 | 11 | 58.4% |
|
Optimal solution of integer multicommodity flow problems with application in optical networks
Frontiers in global optimization, 411-435, 2004 View Details |
2004 | 58 | 57.7% |
|
Subgradient methods for convex minimization
Massachusetts Institute of Technology, 2002 View Details |
2002 | 56 | 57.3% |
|
Dynamic Programming and Optimal Control, 2nd Edn, Vols. 1 and 2
Athena Scientific, Belmont, MA, 2001 View Details |
2001 | 54 | 56.7% |
|
Basis function adaptation methods for cost approximation in MDP
2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement …, 2009 View Details |
2009 | 50 | 56.1% |
|
Parallel computing in network optimization
Handbooks in Operations Research and Management Science 7, 331-399, 1995 View Details |
1995 | 44 | 55.7% |
|
Dynamic programming and optimal control, ser
Optimization and Computation Series. Belmont, Massachusetts, USA: Athena …, 2000 View Details |
2000 | 52 | 55.6% |
|
Enlarging the region of convergence of Newton's method for constrained optimization
Journal of optimization theory and applications 36 (2), 221-252, 1982 View Details |
1982 | 35 | 55.5% |
|
On the minimax feedback control of uncertain dynamic systems
1971 IEEE conference on decision and control, 451-455, 1971 View Details |
1971 | 24 | 55.2% |
|
Introduction to probability vol. 1
View Details |
2002 | 49 | 54.6% |
|
Relaxation methods for problems with strictly convex costs and linear constraints
Mathematics of operations research 16 (3), 462-481, 1991 View Details |
1991 | 37 | 54.1% |
|
Rollout algorithms for constrained dynamic programming
Lab. for Information and Decision Systems Report 2646, 2005 View Details |
2005 | 47 | 54.1% |
|
Tsitsiklis, parallel and distributed computation
Prentice Hall, 1989 View Details |
1989 | 35 | 53.7% |
|
An ϵ-relaxation method for separable convex cost network flow problems
SIAM Journal on Optimization 7 (3), 853-870, 1997 View Details |
1997 | 41 | 52.9% |
|
Steepest descent for optimization problems with nondifferentiable cost functionals
Proc. 5th Annual Princeton Confer. Inform. Sci. Systems, Princeton, NJ, 347-351, 1971 View Details |
1971 | 21 | 52.7% |
|
On near optimality of the set of finite-state controllers for average cost POMDP
Mathematics of Operations Research 33 (1), 1-11, 2008 View Details |
2008 | 43 | 52.2% |
|
J.. N. Tsitsiklis
Neuro-dynamic Programming, 1996 View Details |
1996 | 36 | 51.6% |
|
Q-learning algorithms for optimal stopping based on least squares
2007 European Control Conference (ECC), 2368-2375, 2007 View Details |
2007 | 42 | 51.6% |
|
Multiagent reinforcement learning for autonomous routing and pickup problem with adaptation to variable demand
2023 IEEE International Conference on Robotics and Automation (ICRA), 3524-3531, 2023 View Details |
2023 | 5 | 51.6% |
|
Extended monotropic programming and duality
Journal of optimization theory and applications 139 (2), 209-225, 2008 View Details |
2008 | 41 | 51.2% |
|
Tsitsiklis
J. $ N $.: Neuro-Dynamic Programming, Athena Scientific, 1996 View Details |
1996 | 35 | 51.2% |
|
Stochastic shortest path problems under weak conditions
Lab. for Information and Decision Systems Report LIDS-P-2909, MIT, 2013 View Details |
2013 | 36 | 50.8% |
|
A new algorithm for solution of resistive networks involving diodes
IEEE transactions on circuits and systems 23 (10), 599-608, 1976 View Details |
1976 | 25 | 50.3% |
|
Optimal routing and flow control methods for communication networks
Analysis and Optimization of Systems: Proceedings of the Fifth International …, 2006 View Details |
2006 | 39 | 50.2% |
|
OPTIMAL SCHEDULING OF LARGE SCALE HYDROTHERMAL POWER SYSTEMS.
View Details |
1982 | 27 | 49.9% |
|
An ε-relaxation method for separable convex cost generalized network flow problems
Mathematical Programming 88 (1), 85-104, 2000 View Details |
2000 | 38 | 49.6% |
|
Validation of algorithms for optimal routing of flow in networks
1978 IEEE Conference on Decision and Control including the 17th Symposium on …, 1979 View Details |
1979 | 25 | 49.5% |
|
Relaxation methods for linear programs
Mathematics of Operations Research 12 (4), 569-596, 1987 View Details |
1987 | 28 | 49.5% |
|
Relaxation methods for minimum cost network flow problems
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1983 View Details |
1983 | 24 | 48.7% |
|
Affine monotonic and risk-sensitive models in dynamic programming
IEEE Transactions on Automatic Control 64 (8), 3117-3128, 2019 View Details |
2019 | 20 | 48.3% |
|
Dynamic models of shortest path routing algorithms for communication networks with multiple destinations
1979 18th IEEE Conference on Decision and Control including the Symposium on …, 1979 View Details |
1979 | 23 | 47.8% |
|
Two-metric projection problems and descent methods for asymmetric variational inequality problems
Math. Program 53, 99-110, 1984 View Details |
1984 | 23 | 47.7% |
|
The relation between pseudonormality and quasiregularity in constrained optimization
Optimization Methods and Software 19 (5), 493-506, 2004 View Details |
2004 | 35 | 47.7% |
|
Asymptotic optimality of shortest path routing algorithms
IEEE transactions on information theory 33 (1), 83-90, 1987 View Details |
1987 | 25 | 47.4% |
|
On boundedness of Q-learning iterates for stochastic shortest path problems
Mathematics of Operations Research 38 (2), 209-227, 2013 View Details |
2013 | 31 | 47.2% |
|
An auction algorithm for the max-flow problem
Journal of Optimization Theory and Applications 87, 69-101, 1995 View Details |
1995 | 28 | 47.1% |
|
Minimax methods based on approximations
Proceedings 1976 John Hopkins Conf. Inform. Sciences and Systems, 1976 View Details |
1976 | 21 | 47.1% |
|
Notes on Nonlinear Programming and Discrete--time Optimal Control
Laboratory for Information and Decision Systems, Department of Electrical …, 1979 View Details |
1979 | 22 | 46.8% |
|
Relaxation methods for monotropic programs
Mathematical Programming 46 (1-3), 127-151, 1990 View Details |
1990 | 24 | 45.9% |
|
Lambda‐Policy Iteration: A Review and a New Implementation
Reinforcement learning and approximate dynamic programming for feedback …, 2012 View Details |
2012 | 30 | 45.5% |
|
Performance of hypercube routing schemes with or without buffering
IEEE/ACM Transactions on Networking 2 (3), 299-311, 1994 View Details |
1994 | 26 | 45.5% |
|
Parallel shortest path auction algorithms
Parallel Computing 20 (9), 1221-1247, 1994 View Details |
1994 | 26 | 45.5% |
|
Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1984 View Details |
1984 | 20 | 44.8% |
|
Reinforcement Learning Methods for Wordle: A POMDP/Adaptive Control Approach
arXiv preprint arXiv:2211.10298, 2022 View Details |
2022 | 7 | 44.6% |
|
Separable dynamic programming and approximate decomposition methods
IEEE Transactions on automatic control 52 (5), 911-916, 2007 View Details |
2007 | 29 | 44.2% |
|
Parallel primal-dual methods for the minimum cost flow problem
Computational Optimization and Applications 2, 317-336, 1993 View Details |
1993 | 22 | 44.0% |
|
Parallel and Distributed Computation-Numerical Methods. 1989
Englewood Clifffs, New Jersey: Printice-Hall, 1997 View Details |
1997 | 25 | 43.8% |
|
Convergence theories of distributed iterative processes: A survey
Stochastic Programming, 107-139, 2005 View Details |
2005 | 27 | 43.4% |
|
Nonlinear programming, athena scientific, 1999
REFER ˆENCIAS BIBLIOGR AFICAS 89, 2006 View Details |
2006 | 27 | 43.2% |
|
Linear convex stochastic control problems over an infinite horizon
IEEE Transactions on Automatic Control 18 (3), 314-315, 1973 View Details |
1973 | 16 | 43.2% |
|
Multinode broadcast in hypercubes and rings with randomly distributed length of packets
IEEE Transactions on Parallel and Distributed systems 4 (2), 144-154, 1993 View Details |
1993 | 21 | 43.1% |
|
Set intersection theorems and existence of optimal solutions
Mathematical programming 110, 287-314, 2007 View Details |
2007 | 27 | 42.8% |
|
Distributed asynchronous policy iteration in dynamic programming
2010 48th Annual Allerton Conference on Communication, Control, and …, 2010 View Details |
2010 | 26 | 42.4% |
|
Incremental subgradient methods for nondifferentiable optimization
Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No …, 1999 View Details |
1999 | 24 | 42.3% |
|
Dynamic broadcasting in parallel computing
IEEE transactions on parallel and distributed systems 6 (2), 120-131, 1995 View Details |
1995 | 21 | 42.2% |
|
Convexity, duality, and lagrange multipliers
Lecture Notes, MIT Press, Cambridge, Mass, USA, 2001 View Details |
2001 | 24 | 42.0% |
|
Admission control for wireless networks
IEEE Trans. Veh. Technol 50, 504-514, 2001 View Details |
2001 | 24 | 42.0% |
|
Stable optimal control and semicontractive dynamic programming
SIAM Journal on Control and Optimization 56 (1), 231-252, 2018 View Details |
2018 | 18 | 41.6% |
|
VARIABLE METRIC METHODS FOR CONSTRAINED OPTIMIZATION USING DIFFERENTIABLE EXACT PENALTY FUNCTIONS.
Proc Annu Allerton Conf Commun Control Comput 18th, 1981 View Details |
1981 | 16 | 40.8% |
|
Augmented Lagrangian and differentiable exact penalty methods
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1981 View Details |
1981 | 16 | 40.8% |
|
Enhanced optimality conditions and exact penalty functions
Proceedings of Allerton conference, 2000 View Details |
2000 | 23 | 40.8% |
|
Neuro-dynamic Programming, ser
Optimization and Neural Computation Series. Belmont, Massachusetts: Athena …, 1996 View Details |
1996 | 19 | 40.2% |
|
Expertrna: A new framework for RNA secondary structure prediction
INFORMS Journal on Computing 34 (5), 2464-2484, 2022 View Details |
2022 | 6 | 39.9% |
|
relaxt-III: A new and improved version of the relax code
Massachusetts Institute of Technology, Laboratory for Information and …, 1990 View Details |
1990 | 17 | 39.9% |
|
A mixed value and policy iteration method for stochastic control with universally measurable policies
Mathematics of Operations Research 40 (4), 926-968, 2015 View Details |
2015 | 21 | 39.7% |
|
Penalty and multiplier methods
View Details |
1980 | 14 | 39.7% |
|
Parallel and Distributed Computation: Numerical Methods, Prentice Hall
New Jersey: Englewood Cliffs, 1989 View Details |
1989 | 17 | 39.5% |
|
Multiplier methods: A survey
IFAC Proceedings Volumes 8 (1), 351-363, 1975 View Details |
1975 | 13 | 39.4% |
|
Introduction to probability, ser
Athena Scientific optimization and computation series. Athena Scientific, 2008 View Details |
2008 | 22 | 39.3% |
|
Enhanced Fritz John conditions for convex programming
SIAM Journal on Optimization 16 (3), 766-797, 2006 View Details |
2006 | 21 | 38.9% |
|
Weighted sup-norm contractions in dynamic programming: A review and some new applications
Dept. Elect. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA …, 2012 View Details |
2012 | 22 | 38.8% |
|
Adaptive multi-platform scheduling in a risky environment
Advances in Enterprise Control Symp. Proc, 121-128, 1999 View Details |
1999 | 19 | 38.4% |
|
A least squares Q-learning algorithm for optimal stopping problems
Lab. for Information and Decision Systems Report 2731, 2006 View Details |
2006 | 20 | 38.1% |
|
Existence of optimal stationary policies in deterministic optimal control
Journal of Mathematical Analysis and Applications 69 (2), 607-620, 1979 View Details |
1979 | 14 | 37.8% |
|
An auction/sequential shortest path algorithm for the minimum cost network flow problem
Massachusetts Institute of Technology, Laboratory for Information and …, 1992 View Details |
1992 | 16 | 37.7% |
|
Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes
Journal of Parallel and Distributed Computing 23 (2), 177-189, 1994 View Details |
1994 | 16 | 36.8% |
|
Computer science and applied mathematics
Constrained Optimization and Lagrange Multiplier Methods 1, 1982 View Details |
1982 | 13 | 36.6% |
|
Data Communications
Prentice Hall, 1992 View Details |
1992 | 15 | 36.4% |
|
Dynamic programming and optimal control, i and ii, athena scientific, belmont, massachusetts
New York-San Francisco-London, 1995 View Details |
1995 | 15 | 36.0% |
|
Dynamic programming in Borel spaces
Dynamic programming and its applications, 115-130, 1978 View Details |
1978 | 11 | 36.0% |
|
Stabilization of stochastic iterative methods for singular and nearly singular linear systems
Mathematics of Operations Research 39 (1), 1-30, 2014 View Details |
2014 | 18 | 35.9% |
|
ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems
Network Optimization, 103-126, 1997 View Details |
1997 | 15 | 35.3% |
|
Distributed asynchronous policy iteration for sequential zero-sum games and minimax control
arXiv preprint arXiv:2107.10406, 2021 View Details |
2021 | 8 | 35.1% |
|
A Course in Reinforcement Learning
Athena Scientific, 2023 View Details |
2023 | 3 | 35.0% |
|
Nonlinear Programming, Athena Scientific, Belmont, MA, 1999
MR2182753 (2006h: 49001), 2008 View Details |
2008 | 17 | 35.0% |
|
A survey of some aspects of parallel and distributed iterative algorithms
Massachusetts Institute of Technology, Laboratory for Information and …, 1989 View Details |
1989 | 13 | 34.6% |
|
Path assignment for virtual circuit routing
Proceedings of the symposium on Communications Architectures & Protocols, 21-25, 1983 View Details |
1983 | 11 | 34.6% |
|
On the convergence properties of second-order multiplier methods
Journal of Optimization Theory and Applications 25 (3), 443-449, 1978 View Details |
1978 | 10 | 34.6% |
|
John N. Tsitsiklis
Introduction to Probability, 2002 View Details |
2002 | 15 | 34.1% |
|
Weighted Bellman equations and their applications in approximate dynamic programming
Lab. for Information and Decision Systems Report LIDS-P-2876, MIT, 2012 View Details |
2012 | 17 | 34.1% |
|
Routing in data networks
Data Networks, 401-403, 1992 View Details |
1992 | 13 | 34.0% |
|
Regular policies in abstract dynamic programming
SIAM Journal on Optimization 27 (3), 1694-1727, 2017 View Details |
2017 | 14 | 34.0% |
|
RG G allager
Data Networks. Prantice Hall, 1987 View Details |
1987 | 11 | 33.4% |
|
Parallel and distributed computation: numerical methods
New Jersey: PrentiieeHall, Ine, 1989 View Details |
1989 | 12 | 33.1% |
|
Min common/max crossing duality: A simple geometric framework for convex optimization and minimax theory
Rep. LIDS-P-2536, 2002 View Details |
2002 | 14 | 33.1% |
|
Optimal and Neuro—Dynamic Programming Solutions for a Stochastic Inventory Transportation Problem
Models, Methods and Decision Support for Management: Essays in Honor of Paul …, 2001 View Details |
2001 | 13 | 32.7% |
|
Rollout algorithms: An overview
Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No …, 1999 View Details |
1999 | 13 | 32.5% |
|
Approximate simulation-based solution of large-scale least squares problems
Lab. for Information and Decision Systems Report LIDS-P-2819, MIT, 2009 View Details |
2009 | 14 | 32.2% |
|
Some issues in distributed asynchronous routing in virtual circuit data networks
1986 25th IEEE Conference on Decision and Control, 1335-1337, 1986 View Details |
1986 | 10 | 32.1% |
|
Constrained multiagent rollout and multidimensional assignment with the auction algorithm
arXiv preprint arXiv:2002.07407, 2020 View Details |
2020 | 9 | 32.0% |
|
On error bounds for successive approximation methods
IEEE Transactions on Automatic Control 21 (3), 394-396, 1976 View Details |
1976 | 9 | 32.0% |
|
Biased aggregation, rollout, and enhanced policy improvement for reinforcement learning
arXiv preprint arXiv:1910.02426, 2019 View Details |
2019 | 10 | 31.6% |
|
Traffic behavior and queuing in a QoS environment
OPNETWORK 2005, Session 1813, 2005 View Details |
2005 | 13 | 31.6% |
|
Multiaccess communication
Data networks, 1992 View Details |
1992 | 11 | 31.2% |
|
Nonlinear programming, 3rd
Athena Scientific, 2016 View Details |
2016 | 13 | 31.1% |
|
Projected Newton methods for optimization problems with simple constraints
1981 20th IEEE Conference on Decision and Control including the Symposium on …, 1981 View Details |
1981 | 9 | 31.0% |
|
Stochastic optimization problems with nondifferentiable cost functionals with an application in stochastic programming
Proceedings of the 1972 IEEE Conference on Decision and Control and 11th …, 1972 View Details |
1972 | 8 | 30.8% |
|
Proper policies in infinite-state stochastic shortest path problems
IEEE Transactions on Automatic Control 63 (11), 3787-3792, 2018 View Details |
2018 | 11 | 30.6% |
|
Local convex conjugacy and Fenchel duality
IFAC Proceedings Volumes 11 (1), 1079-1084, 1978 View Details |
1978 | 8 | 30.4% |
|
Projected equations, variational inequalities, and temporal difference methods
Lab. for Information and Decision Systems Report LIDS-P-2808, MIT, 2009 View Details |
2009 | 12 | 29.9% |
|
c, and AE Ozdaglar
Convex Analysis and Optimization, 2003 View Details |
2003 | 11 | 29.9% |
|
Introduction to Probability: Athena Scientific
Belmont Massachusetts: Massachusetts Institute of Technology, 2002 View Details |
2002 | 11 | 29.6% |
|
On the solution of some minimax problems
Proceedings of the 1972 IEEE Conference on Decision and Control and 11th …, 1972 View Details |
1972 | 7 | 28.6% |
|
Note on the design of linear systems with piecewise constant feedback gains
IEEE Transactions on Automatic Control 15 (2), 262-263, 1970 View Details |
1970 | 6 | 28.5% |
|
Monotone mappings in dynamic programming
1975 IEEE Conference on Decision and Control including the 14th Symposium on …, 1975 View Details |
1975 | 7 | 28.0% |
|
Data-driven rollout for deterministic optimal control
2021 60th IEEE Conference on Decision and Control (CDC), 2169-2176, 2021 View Details |
2021 | 6 | 27.9% |
|
On-line policy iteration for infinite horizon dynamic programming
arXiv preprint arXiv:2106.00746, 2021 View Details |
2021 | 6 | 27.9% |
|
Computation of production control policies by a dynamic programming technique
Analysis and Optimization of Systems: Proceedings of the Fifth International …, 2006 View Details |
2006 | 10 | 27.7% |
|
Routing and wavelength assignment in optical networks
US Patent 7,716,271, 2010 View Details |
2010 | 11 | 27.7% |
|
Corrections for the book nonlinear programming
Belmont, MA, USA: Athena Scientific, 1999 View Details |
1999 | 9 | 26.7% |
|
A note on error bounds for convex and nonconvex programs
Computational Optimization: A Tribute to Olvi Mangasarian Volume I, 41-51, 1999 View Details |
1999 | 9 | 26.7% |
|
Parallel asynchronous primal-dual methods for the minimum cost flow problem
Massachusetts Institute of Technology, Laboratory for Information and …, 1990 View Details |
1990 | 8 | 26.7% |
|
Second derivative algorithms for minimum delay distributed routing in networks
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1981 View Details |
1981 | 7 | 26.5% |
|
Dynamic programming and optimal control, ch. 1
Belmont, MA 148, 1995 View Details |
1995 | 8 | 26.0% |
|
Solution of large systems of equations using approximate dynamic programming methods
Lab. for Information and Decision Systems Report LIDS-P-2754, MIT, 2007 View Details |
2007 | 9 | 25.4% |
|
with A. Nedic and A. Ozdaglar
Convex analysis and optimization, 2003 View Details |
2003 | 8 | 25.3% |
|
Introduction to Probability: International Edition
Athena Scientific, Belmont, Massachusetts, 2002 View Details |
2002 | 8 | 25.0% |
|
Proximal algorithms and temporal difference methods for solving fixed point problems
Computational Optimization and Applications 70 (3), 709-736, 2018 View Details |
2018 | 8 | 24.9% |
|
Pathologies of temporal difference methods in approximate dynamic programming
49th IEEE Conference on Decision and Control (CDC), 3034-3039, 2010 View Details |
2010 | 9 | 24.8% |
|
Bertsekas
Dynamic programming and optimal control 1, 2, 1976 View Details |
1976 | 6 | 24.5% |
|
Newton's method for linear optimal control problems
IFAC Proceedings Volumes 9 (3), 353-359, 1976 View Details |
1976 | 6 | 24.5% |
|
Thevenin decomposition and large-scale optimization
Journal of optimization theory and applications 89 (1), 1-15, 1996 View Details |
1996 | 7 | 24.3% |
|
A conflict sense routing protocol and its performance for hypercubes
IEEE transactions on computers 45 (6), 693-703, 1996 View Details |
1996 | 7 | 24.3% |
|
Approximate solution of large-scale linear inverse problems with Monte Carlo simulation
Lab. for Information and Decision Systems Report, MIT, 2009 View Details |
2009 | 8 | 24.2% |
|
A quasi Monte Carlo method for large-scale inverse problems
Monte Carlo and Quasi-Monte Carlo Methods 2010, 623-637, 2012 View Details |
2012 | 9 | 24.2% |
|
Introduction to probability. 2002
Athena Scientific, 1995 View Details |
1995 | 7 | 23.9% |
|
Nonlinear Programming, ser. optimization and computation
Belmont, Massachusetts: Athena Scientific, 1995 View Details |
1995 | 7 | 23.9% |
|
Volume II, Dynamic programming and optimal control
Belmont (MA): Athena Scientific, 2007 View Details |
2007 | 8 | 23.7% |
|
Notes on optimal routing and flow control for communication networks
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1981 View Details |
1981 | 6 | 23.7% |
|
Projection methods for minimum cost network flow problems
Mathematical Programming Study 17, 1-22, 1981 View Details |
1981 | 6 | 23.7% |
|
Optimal short-term scheduling of large-scale power systems
1981 20th IEEE Conference on Decision and Control including the Symposium on …, 1981 View Details |
1981 | 6 | 23.7% |
|
Neuro-dynamic programming, Encyclopedia of Optimization
vol 27, 1687-1692, 2001 View Details |
2001 | 7 | 23.6% |
|
Gradient convergence in gradient methods
Massachusetts Institute of Technology, Laboratory for Information and …, 1997 View Details |
1997 | 7 | 23.4% |
|
with Nedic, A
Ozdaglar, AE: Convex Analysis and Optimization. Athena Scientific, Belmont, 2003 View Details |
2003 | 7 | 23.4% |
|
Adaptive aggregation methods for discounted dynamic programming
1986 25th IEEE Conference on Decision and Control, 1840-1845, 1986 View Details |
1986 | 6 | 23.1% |
|
Chapter 1-introduction
Constrained optimization and Lagrange multiplier methods, 1-94, 1982 View Details |
1982 | 6 | 23.0% |
|
Nonlinear Programming, Athena Scientific, Belmont, MA, 1999.[7] EG Birgin, JM Martnez, and M. Raydan, Nonmonotone spectral projected gradient methods on convex sets
SIAM J. Optim 10, 11961211, 2000 View Details |
2000 | 7 | 22.9% |
|
Auction-Based Learning for Question Answering over Knowledge Graphs
Information 14 (6), 336, 2023 View Details |
2023 | 2 | 21.8% |
|
Neuro-Dynamic Programming (Athena Scientific, Nashua, NH)
Google Scholar Google Scholar Digital Library Digital Library, 1996 View Details |
1996 | 6 | 21.7% |
|
Parallel and distributed iterative algorithms: a selective survey
Massachusetts Institute of Technology, Laboratory for Information and …, 1988 View Details |
1988 | 6 | 21.6% |
|
Flow control
Data Networks, 493-535, 1992 View Details |
1992 | 6 | 21.3% |
|
Generic rank-one corrections for value iteration in Markovian decision problems
Operations research letters 17 (3), 111-119, 1995 View Details |
1995 | 6 | 21.3% |
|
Play selection in American football: A case study in neuro-dynamic programming
Advances in Computational and Stochastic Optimization, Logic Programming …, 1998 View Details |
1998 | 6 | 21.2% |
|
Enlarging the region of convergence of Newton's method for constrained optimization
View Details |
1980 | 5 | 21.1% |
|
The bivariate normal distribution
Introduction to probability, 1st edition, Athena Scientific, 247-253, 2002 View Details |
2002 | 6 | 21.0% |
|
Rollout Algorithms and Approximate Dynamic Programming for Bayesian Optimization and Sequential Estimation
arXiv preprint arXiv:2212.07998, 2022 View Details |
2022 | 3 | 21.0% |
|
Convex Optimization Algorithms Athena Scientific
Belmot, Massachusetts 693, 1999 View Details |
1999 | 6 | 20.9% |
|
Nonlinear Programming (Athena Scientific, Nashua, NH)
View Details |
1999 | 6 | 20.9% |
|
On the convergence of simulation-based iterative methods for solving singular linear systems
Stochastic Systems 3 (1), 38-95, 2013 View Details |
2013 | 7 | 20.8% |
|
Convex optimization theory athena scientific, 2009
Cited on, 9, 2014 View Details |
2014 | 7 | 20.6% |
|
Convex optimization theory
Belmont: Athena Scientific, 2009 View Details |
2009 | 6 | 20.3% |
|
Markov chains
Introduction to Probability, 339-405, 2008 View Details |
2008 | 6 | 20.0% |
|
Dynamic Programming and Optimal Control: Vol I. Nashua
NH, USA: Athena Scientific, 2007 View Details |
2007 | 6 | 19.8% |
|
Reservation-based session routing for broadband communication networks with strict QoS requirements
Proceedings 15th International Conference on Information Networking, 593-600, 2001 View Details |
2001 | 5 | 18.6% |
|
Mathematical Equivalence of the Auction Algorithm for Assignment and the∊-Relaxation (Preflow-Push) Method for Min Cost Flow
Large Scale Optimization: State of the Art, 26-44, 1992 View Details |
1992 | 5 | 18.5% |
|
Ten simple rules for mathematical writing
Massachusetts Inst. Technol, 2002 View Details |
2002 | 5 | 18.4% |
|
Transposition of banded matrices in hypercubes: A nearly isotropic task
Parallel computing 21 (2), 243-264, 1995 View Details |
1995 | 5 | 18.3% |
|
Dynamic Controlling and Optimal Control
Athena Scientific 2, 1995 View Details |
1995 | 5 | 18.3% |
|
Learning and Approximate Dynamic Programming
IEEE Press, 2004 View Details |
2004 | 5 | 18.2% |
|
Preconditioned conjugate gradient methods for optimal control problems with delays with application in hydroelectric power systems scheduling
The 22nd IEEE Conference on Decision and Control, 1434-1442, 1983 View Details |
1983 | 4 | 17.0% |
|
Proximal algorithms and temporal differences for large linear systems: extrapolation, approximation, and simulation
arXiv preprint arXiv:1610.05427, 2016 View Details |
2016 | 5 | 16.4% |
|
Relaxation methods for problems with strictly convex costs and linear inequality constraints
Massachusetts Institute of Technology, Laboratory for Information and …, 1987 View Details |
1987 | 4 | 16.1% |
|
Dynamic programming and suboptimal control: From ADP to MPC
Proceedings of the 44th IEEE Conference on Decision and Control, 10-10, 2005 View Details |
2005 | 4 | 15.7% |
|
Nonhnear Programming
Belmont, MA: Athena Scientific, 1995 View Details |
1995 | 4 | 15.3% |
|
Nonlinear Programming Athena
Cambridge, Ma, 1999 View Details |
1999 | 4 | 15.3% |
|
データネットワーク
オーム社, 1990 View Details |
1990 | 4 | 15.2% |
|
New value iteration and Q-learning methods for the average cost dynamic programming problem
Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No …, 1998 View Details |
1998 | 4 | 15.2% |
|
Dynamic programming methods for adaptive multi-platform scheduling in a risky environment
Advances in Enterprise Control Proceedings, Symposium Sponsored by JFACC …, 2000 View Details |
2000 | 4 | 15.1% |
|
Reinforcement Learning and Optimal Control
Athena scientific, 2018 View Details |
2018 | 4 | 14.8% |
|
Convergence of iterative simulation-based methods for singular linear systems
Lab. for Information and Decision Systems Report LIDS-P-2879, MIT, 2011 View Details |
2011 | 4 | 14.5% |
|
Incremental gradient, subgradient, and proximal methods for convex optimization
Optimization for Machine Learning, Neural Information Processing Series, 85-119, 2012 View Details |
2012 | 4 | 14.1% |
|
Equivalent stochastic and deterministic optimal control problems
1976 IEEE Conference on Decision and Control including the 15th Symposium on …, 1976 View Details |
1976 | 3 | 13.9% |
|
Centralized and distributed Newton methods for network optimization and extensions
arXiv preprint arXiv:1507.00702, 2015 View Details |
2015 | 4 | 13.9% |
|
Stochastic optimal control: the discrete time case: the discrete time case
Elsevier, 1978 View Details |
1978 | 3 | 13.6% |
|
Recursive state estimation for a set membership representation of uncertainty
IEEE Transactions on Automatic Control 16 (2), 1971 View Details |
1971 | 3 | 12.8% |
|
Convergence of the feasible region in infinite horizon optimization problems
Joint Automatic Control Conference, 287-293, 1972 View Details |
1972 | 3 | 12.3% |
|
Distributed computation of fixed points
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1981 View Details |
1981 | 3 | 12.2% |
|
New Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning
arXiv preprint arXiv:2207.09588, 2022 View Details |
2022 | 2 | 12.1% |
|
Neuro-dynamic programming. Optimization and neural computation series, 3. Athena Scientific
View Details |
1996 | 3 | 11.9% |
|
An ε-Relaxation method for generalized separable convex cost network flow problems
Integer Programming and Combinatorial Optimization: 5th International IPCO …, 1996 View Details |
1996 | 3 | 11.9% |
|
Parallel Shortest Paths Methods for Globally Optimal Trajectories
Advances in Parallel Computing 10, 303-315, 1995 View Details |
1995 | 3 | 11.8% |
|
Neuro-dynamic programming: An overview and recent results
Operations Research Proceedings 2006: Selected Papers of the Annual …, 2007 View Details |
2007 | 3 | 11.4% |
|
6.253 Convex Analysis and Optimization, Spring 2010
View Details |
2010 | 3 | 11.3% |
|
A general method for approximation based on the method of multipliers
Proc. of Thirteenth Annual Allerton Conf. on Circuit and System Theory, 1975 View Details |
1975 | 2 | 8.3% |
|
Nondifferentiable Optimization
North-Holland Publishing Company, 1975 View Details |
1975 | 2 | 8.3% |
|
Globally convergent Newton methods for constrained optimization using differentiable exact penalty functions
1980 19th IEEE Conference on Decision and Control including the Symposium on …, 1980 View Details |
1980 | 2 | 8.0% |
|
Mathematical issues in dynamic programming
unpublished paper, 1978 View Details |
1978 | 2 | 7.5% |
|
NEW THEORETICAL FRAMEWORK FOR FINITE HORIZON STOCHASTIC CONTROL.
Proc Annu Allerton Conf Circuit Syst Theory 14th, 1976 View Details |
1976 | 2 | 7.5% |
|
Distributed Reinforcement Learning, Rollout, and Approximate Policy Iteration
Athena Scientific, 2020 View Details |
2020 | 2 | 7.3% |
|
Neuro-dynamic Optimal Control of a L-lysine Fed-batch Fermentation
Biotechnology & Biotechnological Equipment 20 (3), 204-207, 2006 View Details |
2006 | 2 | 6.9% |
|
Introduction to probability: Athena Scientific Nashua
NH, 2002 View Details |
2002 | 2 | 6.9% |
|
An Efficient Discriminative Training Method for Generative Models
6th International Workshop on Mining and Learning with Graphs, 2008 View Details |
2008 | 2 | 6.9% |
|
Neuro-dynamic Programming, Athena Sientific
Atena Scientific, Cambridge, Mass, 1996 View Details |
1996 | 2 | 6.9% |
|
Stochastičeskoje optimal'noje upravlenije: Slučaj diskretnogo vremeni
Nauka, 1985 View Details |
1985 | 2 | 6.8% |
|
Modified auction algorithms for shortest paths
Massachusetts Institute of Technology, Laboratory for Information and …, 1992 View Details |
1992 | 2 | 6.7% |
|
Williams-Baird counterexample for Q-factor asynchronous policy iteration
online at http://web. mit. edu/dimitrib/www/Williams-Baird-Counterexample. pdf, 2010 View Details |
2010 | 2 | 6.6% |
|
Intelligent optimal control
Massachusetts Institute of Technology, Laboratory for Information and …, 1995 View Details |
1995 | 2 | 6.6% |
|
Efficient algorithms for continuous-space shortest path problems
Massachusetts Institute of Technology, Laboratory for Information and …, 1995 View Details |
1995 | 2 | 6.6% |
|
Parallel and Dzst~ buted Algorithms
Prentice-Hall, Englewood Cliffs, NJ, 1988 View Details |
1988 | 2 | 6.4% |
|
Infinite-space shortest path problems and semicontractive dynamic programming
Massachusetts Institute of Technology, Cambridge, MA, USA, Technical Report …, 2014 View Details |
2014 | 2 | 6.3% |
|
Parallel and Distributed
Numerical Methods, Parentice-Hall, Englewood Cliffs, NJ, 1989 View Details |
1989 | 2 | 6.2% |
|
Convergence Analysis of Distributed Asynchronous Iterative Processes
IFAC Proceedings Volumes 17 (2), 1145-1146, 1984 View Details |
1984 | 1 | 0.0% |
|
Seti peredači dannych
Mir, 1989 View Details |
1989 | 1 | 0.0% |
|
Convex Analysis and Optimization Chapter 1 Solutions
Athena Scientific, 2008 View Details |
2008 | 1 | 0.0% |
|
Class notes for ASU course CSE 691; Spring 2022 topics in reinforcement learning
View Details |
2022 | 1 | 0.0% |
|
A hybrid incremental gradient method for least squares problems
Massachusetts Institute of Technology, Laboratory for Information and …, 1994 View Details |
1994 | 1 | 0.0% |
|
A value iteration method for the average cost dynamic programming problem
Massachusetts Institute of Technology, Laboratory for Information and …, 1995 View Details |
1995 | 1 | 0.0% |
|
Separable convex cost network flow
Network Optim 450, 103, 2012 View Details |
2012 | 1 | 0.0% |
|
Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation
Laboratory for Information and Decision Systems, Massachusetts Institute of …, 1984 View Details |
1984 | 1 | 0.0% |
|
Communication issues in parallel and distributed optimization algorithms
Proceedings of the 27th IEEE Conference on Decision and Control, 1448 vol. 2, 1988 View Details |
1988 | 1 | 0.0% |
|
Lagrange multipliers with optimal sensitivity properties in constrained optimization
Large-Scale Nonlinear Optimization, 15-23, 2006 View Details |
2006 | 1 | 0.0% |
|
The Auction Algorithm for Assignment
New Trends in Systems Theory: Proceedings of the Università di Genova-The …, 2013 View Details |
2013 | 1 | 0.0% |
|
Reinforcement Learning and Optimal Control and Rollout, Policy Iteration, and Distributed Reinforcement Learning
View Details |
2021 | 1 | 0.0% |
|
MODEL FOR THE OPTIMAL SYNTHESIS AND ANALYSIS OF MAINTENANCE FACILITIES.
AUTOTESTCON (Proceedings), 449-456, 1983 View Details |
1983 | 1 | 0.0% |
|
Play selection in football: a case study in neuro-dynamic programming
Massachusetts Institute of Technology, Laboratory for Information and …, 1996 View Details |
1996 | 1 | 0.0% |
|
Finite-state Average Cost Stochastic Games with Compact Constraint Sets and a Recurrence Condition
SIAM Journal on Control and Optimization, 1998 View Details |
1998 | 1 | 0.0% |
|
Lecture Slides on Nonlinear Programming
MIT Lecture, 2005 View Details |
2005 | 1 | 0.0% |
|
Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming (Revised)
View Details |
2010 | 1 | 0.0% |
|
DISTRIBUTED DETERMINISTIC AND STOCHASTIC OPTIMIZATION ALGORITHMS WITH APPLICATIONS IN SYSTEM IDENTIFICATION.
View Details |
1983 | 1 | 0.0% |
|
A Unified Framework for Primal Dual Methods
Math. Programming 32, 125-145, 1985 View Details |
1985 | 1 | 0.0% |
|
A conflict sense routing protocol and its performance for hypercubes
Massachusetts Institute of Technology, Laboratory for Information and …, 1992 View Details |
1992 | 1 | 0.0% |