The following pages link to Dimitri P. Bertsekas (Q378730):
Displaying 50 items.
- Stochastic first-order methods with random constraint projection (Q2796796) (← links)
- Nonlinear programming (Q2825953) (← links)
- Q-learning and enhanced policy iteration in discounted dynamic programming (Q2884305) (← links)
- Approximate policy iteration: a survey and some new methods (Q2887629) (← links)
- Dynamic programming and optimal control. Vol. 2 (Q2925454) (← links)
- A Unifying Polyhedral Approximation Framework for Convex Optimization (Q3004988) (← links)
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems (Q3026703) (← links)
- Asymptotic optimality of shortest path routing algorithms (Q3028855) (← links)
- Projected Newton methods and optimization of multicommodity flows (Q3039012) (← links)
- (Q3102800) (← links)
- Robust shortest path planning and semicontractive dynamic programming (Q3120605) (← links)
- Stable Optimal Control and Semicontractive Dynamic Programming (Q3130440) (← links)
- (Q3151174) (← links)
- Error Bounds for Approximations from Projected Linear Equations (Q3169095) (← links)
- (Q3189557) (← links)
- Combined Primal-Dual and Penalty Methods for Constrained Minimization (Q3212930) (← links)
- Linear convex stochastic control problems over an infinite horizon (Q3212944) (← links)
- Two-Metric Projection Methods for Constrained Optimization (Q3220362) (← links)
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks (Q3335695) (← links)
- (Q3337185) (← links)
- (Q3337203) (← links)
- Dynamic control of session input rates in communication networks (Q3342183) (← links)
- (Q3361866) (← links)
- (Q3362079) (← links)
- (Q3376697) (← links)
- (Q3376698) (← links)
- (Q3452586) (← links)
- (Q3452587) (← links)
- A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies (Q3465941) (← links)
- Distributed asynchronous computation of fixed points (Q3671771) (← links)
- Optimal short-term scheduling of large-scale power systems (Q3673473) (← links)
- A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← links)
- (Q3686436) (← links)
- (Q3690580) (← links)
- (Q3702499) (← links)
- Distributed asynchronous optimal routing in data networks (Q3714925) (← links)
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms (Q3738944) (← links)
- (Q3772035) (← links)
- Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809) (← links)
- Relaxation Methods for Network Flow Problems with Convex Arc Costs (Q3783055) (← links)
- Relaxation Methods for Linear Programs (Q3783839) (← links)
- (Q3795523) (← links)
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (Q3813579) (← links)
- (Q3813595) (← links)
- Adaptive aggregation methods for infinite horizon dynamic programming (Q3830830) (← links)
- (Q3864317) (← links)
- (Q3900937) (← links)
- (Q3901314) (← links)
- (Q3906685) (← links)
- (Q3908788) (← links)
