 | 2008 |
|---|
| 15 |       | Jonathan Eckstein,
Avigdor Gal,
Sarit Reiner:
Monitoring an Information Source Under a Politeness Constraint.
INFORMS Journal on Computing 20(1): 3-20 (2008) |
| 14 | | Jonathan Eckstein,
Benar Fux Svaiter:
A family of projective splitting methods for the sum of two maximal monotone operators.
Math. Program. 111(1-2): 173-199 (2008) |
| 13 | | Farid Alizadeh,
Jonathan Eckstein,
Nilay Noyan,
Gábor Rudolf:
Arrival Rate Approximation by Nonnegative Cubic Splines.
Operations Research 56(1): 140-156 (2008) |
| 2007 |
|---|
| 12 | | Jonathan Eckstein,
Mikhail Nediak:
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming.
J. Heuristics 13(5): 471-503 (2007) |
| 2005 |
|---|
| 11 | | Jonathan Eckstein,
Mikhail Nediak:
Depth-Optimized Convexity Cuts.
Annals OR 139(1): 95-129 (2005) |
| 2003 |
|---|
| 10 | | Jonathan Eckstein:
A practical general approximation criterion for methods of multipliers based on Bregman distances.
Math. Program. 96(1): 61-86 (2003) |
| 2001 |
|---|
| 9 | | Avigdor Gal,
Jonathan Eckstein:
Managing periodically updated data in relational databases: a stochastic modeling approach.
J. ACM 48(6): 1141-1183 (2001) |
| 2000 |
|---|
| 8 | | Avigdor Gal,
Jonathan Eckstein:
Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach
CoRR cs.DB/0007044: (2000) |
| 1998 |
|---|
| 7 | | Jonathan Eckstein,
Michael C. Ferris:
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control.
INFORMS Journal on Computing 10(2): 218-235 (1998) |
| 6 |  | Jonathan Eckstein:
Approximate iterations in Bregman-function-based proximal algorithms.
Math. Program. 83: 113-123 (1998) |
| 1997 |
|---|
| 5 | | Jonathan Eckstein:
How Much Communication Does Parallel Branch and Bound Need?
INFORMS Journal on Computing 9(1): 15-29 (1997) |
| 1995 |
|---|
| 4 | | Jonathan Eckstein,
I. Ilkay Boduroglu,
Lazaros C. Polymenakos,
Donald Goldfarb:
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2.
INFORMS Journal on Computing 7(4): 402-416 (1995) |
| 1994 |
|---|
| 3 | | Jonathan Eckstein:
Control strategies for parallel mixed integer branch and bound.
SC 1994: 41-48 |
| 1993 |
|---|
| 2 | | Jonathan Eckstein:
The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2.
INFORMS Journal on Computing 5(1): 84-96 (1993) |
| 1992 |
|---|
| 1 | | Jonathan Eckstein,
Dimitri P. Bertsekas:
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators.
Math. Program. 55: 293-318 (1992) |
