Bertsekas Dimitri P.

Dimitri P. Bertsekas

Information about the author Dimitri P. Bertsekas will soon be added to the site.
Found 15 papers in total
Separable dynamic programming and approximate decomposition methods
Separable dynamic programming and approximate decomposition methods
2007
We consider control, planning, and resource allocation problems involving several...
A note on error bounds for convex and nonconvex programs
A note on error bounds for convex and nonconvex programs
1999
Given a single feasible solution x F and a single infeasible solution x l of a...
Rollout algorithms for combinatorial optimization
Rollout algorithms for combinatorial optimization
1997
We consider the approximate solution of discrete optimization problems using...
Generic rank-one corrections for value iteration in Markovian decision problems
Generic rank-one corrections for value iteration in Markovian decision problems
1995
Given a linear iteration of the form x := F ( x ), we consider modified versions of...
Generic rank-one corrections for the value iteration in Markovian decision problems
Generic rank-one corrections for the value iteration in Markovian decision problems
1995
Given a linear iteration of the form x
On the convergence of the exponential multiplier method for convex programming
On the convergence of the exponential multiplier method for convex programming
1993
In this paper, the authors analyze the exponential method of multipliers for convex...
The auction algorithm for assignment and shortest path problems
The auction algorithm for assignment and shortest path problems
1992
The auction algorithm is an intuitive method for solving the classical assignment...
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
1992
This paper shows, by means of an operator called a splitting operator, that the...
Relaxation methods for problems with strictly convex costs and linear constraints
Relaxation methods for problems with strictly convex costs and linear constraints
1991
Consider the problem of minimizing a strictly convex (possibly nondifferentiable and...
Relaxation methods for monotropic programs
Relaxation methods for monotropic programs
1990
The authors propose a dual descent method for the problem of minimizing a convex,...
The auction algorithm for assignment and other network flow problems: A tutorial
The auction algorithm for assignment and other network flow problems: A tutorial
1990
The auction algorithm is an intuitive method for solving the classical assignment...
The auction algorithm for the transportation problem
The auction algorithm for the transportation problem
1989
The auction algorithm is a parallel relaxation method for solving the classical...
Adaptive aggregation methods for infinite horizon dynamic programming
Adaptive aggregation methods for infinite horizon dynamic programming
1989
The authors propose a class of iterative aggregation algorithms for solving infinite...
Dual coordinate step methods for linear network flow problems
Dual coordinate step methods for linear network flow problems
1988
The authors review a class of recently-proposed linear-cost network flow methods which...
The relax codes for linear minimum cost network flow problems
The relax codes for linear minimum cost network flow problems
1988
The authors describe a relaxation algorithm for solving the classical minimum cost...
Papers per page: