Jonathan Eckstein

Publications104
h-index28
Citations17,652
Highly Influential Citations3,326
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • P. L. Combettes
  • 205 Publications • 16,508 Citations
  • D. Bertsekas
  • 298 Publications • 49,371 Citations
  • B. Svaiter
  • 150 Publications • 6,312 Citations
  • A. Ruszczynski
  • 188 Publications • 11,308 Citations
  • Publications
  • Influence
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
TLDR
The alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas. Expand
  • 12,265
  • 2868
  • PDF
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
TLDR
This paper shows, by means of an operator called asplitting operator, that the Douglas—Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Expand
  • 2,311
  • 255
  • PDF
Splitting methods for monotone operators with applications to parallel optimization
  • 280
  • 27
Augmented Lagrangian and Alternating Direction Methods for Convex Optimization: A Tutorial and Some Illustrative Computational Results
The alternating direction of multipliers (ADMM) is a form of augmented Lagrangian algorithm that has experienced a renaissance in recent years due to its applicability to optimization problems… Expand
  • 198
  • 20
  • PDF
Some Saddle-function splitting methods for convex programming
Consider two variations of the method of multipliers, or classical augmented Lagrangian method for convex programming. The proximal method of multipliers adjoins quadratic primal proximal terms to… Expand
  • 116
  • 18
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
TLDR
A Bregman function is a strictly convex, differentiable function that induces a well-behaved distance measure or D-function on Euclidean space, and a nonlinear version of the proximal point algorithm for convex programming . Expand
  • 315
  • 17
Approximate iterations in Bregman-function-based proximal algorithms
TLDR
This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed only approximately. Expand
  • 161
  • 14
Parallel alternating direction multiplier decomposition of convex programs
This paper describes two specializations of the alternating direction method of multipliers: the alternating step method and the epigraphic projection method. The alternating step method applies to… Expand
  • 131
  • 11
Pico: An Object-Oriented Framework for Parallel Branch and Bound *
TLDR
This paper describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms on a wide range of parallel computing platforms. Expand
  • 112
  • 10
An Alternating Direction Method for Linear Programming
This paper presents a new, simple, massively parallel algorithm for linear programming, called the alternating step method. The algorithm is unusual in that it does not maintain primal feasibility,… Expand
  • 56
  • 10
...
1
2
3
4
5
...