The following pages link to Dimitri P. Bertsekas (Q378730):
Displaying 50 items.
- A new algorithm for the assignment problem (Q3911685) (← links)
- Projection methods for variational inequalities with application to the traffic assignment problem (Q3936522) (← links)
- Dynamic behavior of shortest path routing algorithms for communication networks (Q3941157) (← links)
- Distributed dynamic programming (Q3955990) (← links)
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751) (← links)
- An Analysis of Stochastic Shortest Path Problems (Q3986758) (← links)
- (Q4001523) (← links)
- (Q4003376) (← links)
- An Auction Algorithm for Shortest Paths (Q4012426) (← links)
- Partial conjugate gradient methods for a class of optimal control problems (Q4049699) (← links)
- On the method of multipliers for convex programming (Q4056628) (← links)
- Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems (Q4059510) (← links)
- Convergence of discretization procedures in dynamic programming (Q4071039) (← links)
- (Q4085503) (← links)
- On Penalty and Multiplier Methods for Constrained Minimization (Q4087862) (← links)
- Necessary and sufficient conditions for a penalty method to be exact (Q4090135) (← links)
- On the Goldstein-Levitin-Polyak gradient projection method (Q4090967) (← links)
- Combined Primal–Dual and Penalty Methods for Convex Programming (Q4099842) (← links)
- A new algorithm for solution of resistive networks involving diodes (Q4124223) (← links)
- Monotone Mappings with Application in Dynamic Programming (Q4133416) (← links)
- (Q4163968) (← links)
- Alternative Theoretical Frameworks for Finite Horizon Discrete-Time Stochastic Optimal Control (Q4191938) (← links)
- Universally Measurable Policies in Dynamic Programming (Q4199855) (← links)
- (Q4209222) (← links)
- (Q4225395) (← links)
- Stochastic Shortest Path Games (Q4253012) (← links)
- (Q4257216) (← links)
- Parallel Asynchronous Hungarian Methods for the Assignment Problem (Q4282279) (← links)
- A simple and fast label correcting algorithm for shortest paths (Q4291478) (← links)
- Partial Proximal Minimization Algorithms for Convex Pprogramming (Q4308555) (← links)
- (Q4311901) (← links)
- (Q4363162) (← links)
- (Q4368722) (← links)
- A New Class of Incremental Gradient Methods for Least Squares Problems (Q4376150) (← links)
- (Q4377045) (← links)
- An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems (Q4377576) (← links)
- A New Value Iteration method for the Average Cost Dynamic Programming Problem (Q4388932) (← links)
- Implementation of efficient algorithms for globally optimal trajectories (Q4396101) (← links)
- A conflict sense routing protocol and its performance for hypercubes (Q4406352) (← links)
- (Q4464681) (← links)
- Gradient Convergence in Gradient methods with Errors (Q4509729) (← links)
- Stochastic Approximation for Nonexpansive Maps: Application to <i>Q</i>-Learning Algorithms (Q4537821) (← links)
- Proper Policies in Infinite-State Stochastic Shortest Path Problems (Q4559523) (← links)
- (Q4584885) (← links)
- (Q4597712) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- The relation between pseudonormality and quasiregularity in constrained optimization (Q4657704) (← links)
- Projected Newton Methods for Optimization Problems with Simple Constraints (Q4744873) (← links)
- (Q4830373) (← links)
- (Q4845367) (← links)
