Dimitri P. Bertsekas

From MaRDI portal
Person:378730

Available identifiers

zbMath Open bertsekas.dimitri-pDBLPb/DimitriPBertsekasWikidataQ5277478 ScholiaQ5277478MaRDI QIDQ378730

List of research outcomes





PublicationDate of PublicationType
Lessons from AlphaZero for optimal, model predictive, and adaptive control2024-09-09Paper
https://portal.mardi4nfdi.de/entity/Q58791652023-02-25Paper
ExpertRNA: A New Framework for RNA Secondary Structure Prediction2022-12-01Paper
Affine Monotonic and Risk-Sensitive Models in Dynamic Programming2019-08-12Paper
Robust shortest path planning and semicontractive dynamic programming2019-03-05Paper
An ε-Relaxation method for generalized separable convex cost network flow problems2019-01-11Paper
Proper Policies in Infinite-State Stochastic Shortest Path Problems2018-12-04Paper
https://portal.mardi4nfdi.de/entity/Q45848852018-09-04Paper
Proximal algorithms and temporal difference methods for solving fixed point problems2018-07-20Paper
Stable Optimal Control and Semicontractive Dynamic Programming2018-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45977122017-12-14Paper
Temporal Difference Methods for General Projected Equations2017-08-25Paper
Regular Policies in Abstract Dynamic Programming2017-08-18Paper
Convergence Results for Some Temporal Difference Methods Based on Least Squares2017-08-08Paper
Separable Dynamic Programming and Approximate Decomposition Methods2017-07-27Paper
Comments on “Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules”2017-07-27Paper
Nonlinear programming2016-10-14Paper
Stochastic first-order methods with random constraint projection2016-03-30Paper
A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies2016-01-29Paper
https://portal.mardi4nfdi.de/entity/Q34525872015-11-13Paper
https://portal.mardi4nfdi.de/entity/Q34525862015-11-13Paper
Centralized and Distributed Newton Methods for Network Optimization and Extensions2015-07-02Paper
Incremental constraint projection methods for variational inequalities2015-04-16Paper
Dynamic programming and optimal control. Vol. 22014-10-22Paper
https://portal.mardi4nfdi.de/entity/Q31895572014-09-11Paper
Dynamic programming and suboptimal control: a survey from ADP to MPC2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q51688622014-07-21Paper
On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems2014-07-11Paper
Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems2014-07-11Paper
Q-learning and policy iteration algorithms for stochastic shortest path problems2013-11-12Paper
A Quasi Monte Carlo Method for Large-Scale Inverse Problems2013-07-31Paper
Approximate policy iteration: a survey and some new methods2012-06-01Paper
Q-learning and enhanced policy iteration in discounted dynamic programming2012-05-24Paper
https://portal.mardi4nfdi.de/entity/Q31028002011-11-25Paper
Incremental proximal methods for large scale convex optimization2011-11-07Paper
A Unifying Polyhedral Approximation Framework for Convex Optimization2011-06-06Paper
Error Bounds for Approximations from Projected Linear Equations2011-04-27Paper
Neuro-Dynamic Programming: An Overview and Recent Results2011-04-07Paper
The effect of deterministic noise in subgradient methods2010-10-13Paper
Extended monotropic programming and duality2009-04-24Paper
Projected equation methods for approximate solution of large linear systems2009-04-21Paper
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP2008-05-27Paper
Set intersection theorems and existence of optimal solutions2007-05-10Paper
https://portal.mardi4nfdi.de/entity/Q54935702006-10-23Paper
Enhanced Fritz John Conditions for Convex Programming2006-05-30Paper
https://portal.mardi4nfdi.de/entity/Q33766982006-03-24Paper
https://portal.mardi4nfdi.de/entity/Q33766972006-03-24Paper
Rollout algorithms for combinatorial optimization2005-10-13Paper
The relation between pseudonormality and quasiregularity in constrained optimization2005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q48303732004-12-09Paper
https://portal.mardi4nfdi.de/entity/Q44646812004-05-27Paper
An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems2004-01-27Paper
A conflict sense routing protocol and its performance for hypercubes2003-06-25Paper
Least squares policy evaluation algorithms with linear function approximation2003-05-11Paper
Pseudonormality and a Lagrange multiplier theory for constrained optimization2003-03-10Paper
Distributed asynchronous incremental subgradient methods2002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q31511742002-10-22Paper
Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms2002-06-23Paper
Convergence rate of incremental subgradient algorithms2002-05-14Paper
Incremental subgradient methods for nondifferentiable optimization2002-04-23Paper
Learning algorithms for Markov decision processes with average cost2001-10-29Paper
Gradient Convergence in Gradient methods with Errors2000-10-19Paper
Rollout algorithms for stochastic scheduling problems1999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42572161999-08-09Paper
Stochastic Shortest Path Games1999-06-24Paper
https://portal.mardi4nfdi.de/entity/Q42253951999-01-13Paper
A note on error bounds for convex and nonconvex programs1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42092221998-10-05Paper
Implementation of efficient algorithms for globally optimal trajectories1998-08-23Paper
Incremental Least Squares Methods and the Extended Kalman Filter1998-05-19Paper
A New Value Iteration method for the Average Cost Dynamic Programming Problem1998-05-10Paper
A New Class of Incremental Gradient Methods for Least Squares Problems1998-02-10Paper
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems1998-02-10Paper
https://portal.mardi4nfdi.de/entity/Q43770451998-02-08Paper
https://portal.mardi4nfdi.de/entity/Q43631621997-12-14Paper
https://portal.mardi4nfdi.de/entity/Q43687221997-12-07Paper
Finite termination of asynchronous iterative algorithms1997-02-27Paper
Thevenin decomposition and large-scale optimization1997-01-07Paper
https://portal.mardi4nfdi.de/entity/Q48934151996-11-20Paper
Parallel asynchronous label-correcting methods for shortest paths1996-08-06Paper
Transposition of banded matrices in hypercubes: A nearly isotropic task1996-04-29Paper
An auction algorithm for the max-flow problem1996-02-21Paper
Generic rank-one corrections for value iteration in Markovian decision problems1996-01-16Paper
Parallel shortest path auction algorithms1995-10-29Paper
https://portal.mardi4nfdi.de/entity/Q48453671995-09-11Paper
Partial Proximal Minimization Algorithms for Convex Pprogramming1995-08-08Paper
Polynomial auction algorithms for shortest paths1995-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43119011995-05-09Paper
A simple and fast label correcting algorithm for shortest paths1994-05-09Paper
The auction algorithm: A distributed relaxation method for the assignment problem1994-04-20Paper
Parallel Asynchronous Hungarian Methods for the Assignment Problem1994-03-24Paper
A generic auction algorithm for the minimum cost network flow problem1994-03-10Paper
On the convergence of the exponential multiplier method for convex programming1993-11-01Paper
Reverse Auction and the Solution of Inequality Constrained Assignment Problems1993-08-11Paper
A forward/reverse auction algorithm for asymmetric assignment problems1993-06-29Paper
Auction algorithms for network flow problems: A tutorial introduction1993-02-14Paper
Communication algorithms for isotropic tasks in hypercubes and wraparound meshes1993-01-19Paper
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators1993-01-16Paper
Parallel primal-dual methods for the minimum cost flow problem1993-01-01Paper
An Auction Algorithm for Shortest Paths1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40015231992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q40033761992-09-18Paper
An Analysis of Stochastic Shortest Path Problems1992-06-27Paper
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints1992-06-27Paper
Parallel synchronous and asynchronous implementations of the auction algorithm1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33618661992-01-01Paper
Some aspects of parallel and distributed iterative algorithms - a survey1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33620791991-01-01Paper
Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems1990-01-01Paper
Relaxation methods for monotropic programs1990-01-01Paper
Adaptive aggregation methods for infinite horizon dynamic programming1989-01-01Paper
The auction algorithm for the transportation problem1989-01-01Paper
Dual coordinate step methods for linear network flow problems1988-01-01Paper
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37955231987-01-01Paper
Relaxation Methods for Linear Programs1987-01-01Paper
Asymptotic optimality of shortest path routing algorithms1987-01-01Paper
Relaxation methods for problems with strictly convex separable costs and linear constraints1987-01-01Paper
Relaxation Methods for Network Flow Problems with Convex Arc Costs1987-01-01Paper
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38135951987-01-01Paper
Distributed asynchronous optimal routing in data networks1986-01-01Paper
Distributed asynchronous deterministic and stochastic gradient optimization algorithms1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37024991986-01-01Paper
A unified framework for primal-dual methods in minimum cost network flow problems1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37720351985-01-01Paper
Two-Metric Projection Methods for Constrained Optimization1984-01-01Paper
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks1984-01-01Paper
Dynamic control of session input rates in communication networks1984-01-01Paper
Optimal short-term scheduling of large-scale power systems1983-01-01Paper
Projected Newton methods and optimization of multicommodity flows1983-01-01Paper
Distributed asynchronous computation of fixed points1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36905801982-01-01Paper
Projection methods for variational inequalities with application to the traffic assignment problem1982-01-01Paper
Enlarging the region of convergence of Newton's method for constrained optimization1982-01-01Paper
Projected Newton Methods for Optimization Problems with Simple Constraints1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36864361982-01-01Paper
Distributed dynamic programming1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33372031982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33371851982-01-01Paper
Dynamic behavior of shortest path routing algorithms for communication networks1982-01-01Paper
A new algorithm for the assignment problem1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39013141980-01-01Paper
Universally Measurable Policies in Dynamic Programming1979-01-01Paper
Convexification procedures and decomposition methods for nonconvex optimization problems1979-01-01Paper
Existence of optimal stationary policies in deterministic optimal control1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39009371979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39066851979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38643171979-01-01Paper
Stochastic optimal control. The discrete time case1978-01-01Paper
On the convergence properties of second-order multiplier methods1978-01-01Paper
Alternative Theoretical Frameworks for Finite Horizon Discrete-Time Stochastic Optimal Control1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39087881978-01-01Paper
Approximation procedures based on the method of multipliers1977-01-01Paper
Monotone Mappings with Application in Dynamic Programming1977-01-01Paper
Dynamic programming and stochastic control1976-01-01Paper
Multiplier methods: A survey1976-01-01Paper
On the Goldstein-Levitin-Polyak gradient projection method1976-01-01Paper
On Penalty and Multiplier Methods for Constrained Minimization1976-01-01Paper
Combined Primal–Dual and Penalty Methods for Convex Programming1976-01-01Paper
A new algorithm for solution of resistive networks involving diodes1976-01-01Paper
Necessary and sufficient conditions for a penalty method to be exact1975-01-01Paper
Convergence of discretization procedures in dynamic programming1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41639681975-01-01Paper
Combined Primal-Dual and Penalty Methods for Constrained Minimization1975-01-01Paper
On the method of multipliers for convex programming1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40855031975-01-01Paper
Partial conjugate gradient methods for a class of optimal control problems1974-01-01Paper
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals1973-01-01Paper
Stochastic optimization problems with nondifferentiable cost functionals1973-01-01Paper
Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems1973-01-01Paper
Linear convex stochastic control problems over an infinite horizon1973-01-01Paper
Infinite time reachability of state-space regions by using feedback control1972-01-01Paper
On the minimax reachability of target sets and target tubes1971-01-01Paper
Proximal Algorithms and Temporal Differences for Large Linear Systems: Extrapolation, Approximation, and SimulationN/APaper

Research outcomes over time

This page was built for person: Dimitri P. Bertsekas