The following pages link to Dimitri P. Bertsekas (Q378730):
Displaying 50 items.
- Q-learning and policy iteration algorithms for stochastic shortest path problems (Q378731) (← links)
- Incremental proximal methods for large scale convex optimization (Q644913) (← links)
- Finite termination of asynchronous iterative algorithms (Q672103) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
- Existence of optimal stationary policies in deterministic optimal control (Q754470) (← links)
- Dynamic programming and stochastic control (Q800282) (← links)
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- Set intersection theorems and existence of optimal solutions (Q879966) (← links)
- Relaxation methods for monotropic programs (Q909583) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Projected equation methods for approximate solution of large linear systems (Q1012492) (← links)
- Extended monotropic programming and duality (Q1014019) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
- Stochastic optimal control. The discrete time case (Q1158123) (← links)
- Parallel synchronous and asynchronous implementations of the auction algorithm (Q1179221) (← links)
- Communication algorithms for isotropic tasks in hypercubes and wraparound meshes (Q1195708) (← links)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- Approximation procedures based on the method of multipliers (Q1233814) (← links)
- On the convergence properties of second-order multiplier methods (Q1240019) (← links)
- Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
- A note on error bounds for convex and nonconvex programs (Q1294805) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- Parallel shortest path auction algorithms (Q1339234) (← links)
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems (Q1591357) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- Polynomial auction algorithms for shortest paths (Q1804574) (← links)
- Rollout algorithms for stochastic scheduling problems (Q1806711) (← links)
- Pseudonormality and a Lagrange multiplier theory for constrained optimization (Q1862183) (← links)
- Least squares policy evaluation algorithms with linear function approximation (Q1870310) (← links)
- Generic rank-one corrections for value iteration in Markovian decision problems (Q1905071) (← links)
- An auction algorithm for the max-flow problem (Q1906750) (← links)
- Transposition of banded matrices in hypercubes: A nearly isotropic task (Q1907153) (← links)
- Parallel asynchronous label-correcting methods for shortest paths (Q1908632) (← links)
- The effect of deterministic noise in subgradient methods (Q1960191) (← links)
- Incremental constraint projection methods for variational inequalities (Q2340334) (← links)
- Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← links)
- On the minimax reachability of target sets and target tubes (Q2545607) (← links)
- Stochastic optimization problems with nondifferentiable cost functionals (Q2556274) (← links)
- Thevenin decomposition and large-scale optimization (Q2564172) (← links)
- Rollout algorithms for combinatorial optimization (Q2567853) (← links)
- (Q2752037) (← links)
- Learning Algorithms for Markov Decision Processes with Average Cost (Q2753225) (← links)
- (Q2768028) (← links)
- Incremental Subgradient Methods for Nondifferentiable Optimization (Q2784405) (← links)
