Suivre
Jonathan Eckstein
Jonathan Eckstein
Professor of Management Science and Information Systems, Rutgers University
Adresse e-mail validée de business.rutgers.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Distributed optimization and statistical learning via the alternating direction method of multipliers
S Boyd, N Parikh, E Chu, B Peleato, J Eckstein
Foundations and Trends® in Machine learning 3 (1), 1-122, 2011
191462011
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
J Eckstein, DP Bertsekas
Mathematical programming 55, 293-318, 1992
30141992
Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming
J Eckstein
Mathematics of Operations Research 18 (1), 202-226, 1993
4261993
Splitting methods for monotone operators with applications to parallel optimization
J Eckstein
Massachusetts Institute of Technology, 1989
3841989
Augmented Lagrangian and alternating direction methods for convex optimization: A tutorial and some illustrative computational results
J Eckstein, W Yao
RUTCOR Research Reports 32 (3), 44, 2012
2842012
Approximate iterations in Bregman-function-based proximal algorithms
J Eckstein
Mathematical programming 83, 113-123, 1998
2081998
Understanding the convergence of the alternating direction method of multipliers: Theoretical and computational perspectives
J Eckstein, W Yao
Pac. J. Optim. 11 (4), 619-644, 2015
1952015
Parallel alternating direction multiplier decomposition of convex programs
J Eckstein
Journal of Optimization Theory and Applications 80 (1), 39-62, 1994
1741994
PICO: An object-oriented framework for parallel branch and bound
J Eckstein, CA Phillips, WE Hart
Studies in Computational Mathematics 8, 219-265, 2001
1572001
Some reformulations and applications of the alternating direction method of multipliers
J Eckstein, M Fukushima
Large Scale Optimization: State of the Art, 115-134, 1994
1551994
Some saddle-function splitting methods for convex programming
J Eckstein
Optimization Methods and Software 4 (1), 75-83, 1994
1411994
Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5
J Eckstein
SIAM journal on optimization 4 (4), 794-814, 1994
1331994
Dual coordinate step methods for linear network flow problems
DP Bertsekas, J Eckstein
Mathematical Programming 42 (1-3), 203-243, 1988
1311988
Stochastic dedication: Designing fixed income portfolios using massively parallel Benders decomposition
RS Hiller, J Eckstein
Management Science 39 (11), 1422-1438, 1993
1251993
A family of projective splitting methods for the sum of two maximal monotone operators
J Eckstein, BF Svaiter
Mathematical Programming 111, 173-199, 2008
1112008
General projective splitting methods for sums of maximal monotone operators
J Eckstein, BF Svaiter
SIAM Journal on Control and Optimization 48 (2), 787-811, 2009
1062009
Distributed asynchronous relaxation methods for linear network flow problems
DP Bertsekas, J Eckstein
IFAC Proceedings Volumes 20 (5), 103-114, 1987
1051987
Operator-splitting methods for monotone affine variational inequalities, with a parallel application to optimal control
J Eckstein, MC Ferris
INFORMS Journal on Computing 10 (2), 218-235, 1998
1021998
The maximum box problem and its application to data analysis
J Eckstein, PL Hammer, Y Liu, M Nediak, B Simeone
Computational Optimization and Applications 23 (3), 285-298, 2002
932002
Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
PL Combettes, J Eckstein
Mathematical Programming 168, 645-672, 2018
812018
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20