Jonathan Eckstein - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersStephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, Jonathan Eckstein. ftml, 3(1):1-122, 2011. [doi]

2010

Boosting Classifiers with Tightened L0-Relaxation PenaltiesNoam Goldberg, Jonathan Eckstein. icml 2010: 383-390 [doi]

2009

General Projective Splitting Methods for Sums of Maximal Monotone OperatorsJonathan Eckstein, Benar Fux Svaiter. siamco, 48(2):787-811, 2009. [doi]

2008

Arrival Rate Approximation by Nonnegative Cubic SplinesFarid Alizadeh, Jonathan Eckstein, Nilay Noyan, GÃ¡bor Rudolf. ior, 56(1):140-156, 2008. [doi]

A family of projective splitting methods for the sum of two maximal monotone operatorsJonathan Eckstein, Benar Fux Svaiter. mp, 111(1-2):173-199, 2008. [doi]

Monitoring an Information Source Under a Politeness ConstraintJonathan Eckstein, Avigdor Gal, Sarit Reiner. informs, 20(1):3-20, 2008. [doi]

2007

Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programmingJonathan Eckstein, Mikhail Nediak. heuristics, 13(5):471-503, 2007. [doi]

2005

Depth-Optimized Convexity CutsJonathan Eckstein, Mikhail Nediak. anor, 139(1):95-129, 2005. [doi]

2003

A practical general approximation criterion for methods of multipliers based on Bregman distancesJonathan Eckstein. mp, 96(1):61-86, 2003. [doi]

2001

Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized DistancesPaulo José da Silva e Silva, Jonathan Eckstein, Carlos Humes Jr.. siamjo, 12(1):238-261, 2001. [doi]

Managing periodically updated data in relational databases: a stochastic modeling approachAvigdor Gal, Jonathan Eckstein. JACM, 48(6):1141-1183, 2001. [doi]

1998

Approximate iterations in Bregman-function-based proximal algorithmsJonathan Eckstein. mp, 83:113-123, 1998.

Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal ControlJonathan Eckstein, Michael C. Ferris. informs, 10(2):218-235, 1998. [doi]

1997

How Much Communication Does Parallel Branch and Bound Need?Jonathan Eckstein. informs, 9(1):15-29, 1997. [doi]

1995

Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2Jonathan Eckstein, I. Ilkay Boduroglu, Lazaros C. Polymenakos, Donald Goldfarb. informs, 7(4):402-416, 1995. [doi]

1994

Control strategies for parallel mixed integer branch and boundJonathan Eckstein. sc 1994: 41-48 [doi]

1993

The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2Jonathan Eckstein. informs, 5(1):84-96, 1993. [doi]

1992

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operatorsJonathan Eckstein, Dimitri P. Bertsekas. mp, 55:293-318, 1992.