1.
Incremental proximal methods for large scale convex optimization
by Bertsekas, Dimitri P
Mathematical programming, 2011-06-11, Vol.129 (2), p.163-195
2.
Incremental constraint projection methods for variational inequalities
by Wang, Mengdi
Mathematical programming, 2014-05-17, Vol.150 (2), p.321-363
3.
The effect of deterministic noise in subgradient methods
by Nedić, Angelia
Mathematical programming, 2009-01-06, Vol.125 (1), p.75-99
4.
Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming
by Bertsekas, Dimitri P.
Mathematics of operations research, 2012-02, Vol.37 (1), p.66-94
5.
Error Bounds for Approximations from Projected Linear Equations
by Yu, Huizhen
Mathematics of operations research, 2010-05, Vol.35 (2), p.306-329
6.
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC
by Bertsekas, Dimitri P
European journal of control, 2005, Vol.11 (4-5), p.310-334
7.
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP
by Yu, Huizhen
Mathematics of operations research, 2008-02-01, Vol.33 (1), p.1-11
8.
Set intersection theorems and existence of optimal solutions
by BERTSEKAS, Dimitri P
Mathematical programming, 2007, Vol.110 (2), p.287-314
9.
Rollout Algorithms for Stochastic Scheduling Problems
by Bertsekas, Dimitri P
Journal of heuristics, 1999-04-01, Vol.5 (1), p.89
10.
Rollout Algorithms for Combinatorial Optimization
by Bertsekas, Dimitri P
Journal of heuristics, 1997-11-01, Vol.3 (3), p.245-262
11.
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
by ECKSTEIN, J
Mathematical programming, 1992, Vol.55 (3), p.293-318
12.
An Analysis of Stochastic Shortest Path Problems
by Bertsekas, Dimitri P
Mathematics of operations research, 1991-08-01, Vol.16 (3), p.580-595
13.
Auction algorithms for network flow problems: A tutorial introduction
by Bertsekas, Dimitri P.
Computational optimization and applications, 1992-10, Vol.1 (1), p.7-66
14.
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
by Bertsekas, Dimitri P
Operations research, 1988-01-01, Vol.36 (1), p.93-114
15.
On the convergence of the exponential multiplier method for convex programming
by TSENG, P
Mathematical programming, 1993, Vol.60 (1), p.1-19
16.
An ε-relaxation method for separable convex cost generalized network flow problems
by Tseng, Paul
Mathematical programming, 2000-06, Vol.88 (1), p.85-104
20.
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
by Tseng, Paul
Mathematics of operations research, 1991-08-01, Vol.16 (3), p.462-481
