Jonathan Eckstein

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 23

Top Topics

Wavelet Synopses

Operator Splitting

Decomposition Methods

Branch And Bound

Top Venues

Comput. Optim. Appl.

J. Optim. Theory Appl.

Publications

Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, Shinjae Yoo
Correction to: Stochastic projective splitting. Comput. Optim. Appl. 87 (2) (2024)
Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, Shinjae Yoo
Stochastic projective splitting. Comput. Optim. Appl. 87 (2) (2024)
Patrick R. Johnstone, Jonathan Eckstein
Projective splitting with forward steps. Math. Program. 191 (2) (2022)
Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, Shinjae Yoo
Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers. CoRR (2021)
Patrick R. Johnstone, Jonathan Eckstein
Single-forward-step projective splitting: exploiting cocoercivity. Comput. Optim. Appl. 78 (1) (2021)
Patrick R. Johnstone, Jonathan Eckstein
Projective splitting with forward steps only requires continuity. Optim. Lett. 14 (1) (2020)
Maicon Marques Alves, Jonathan Eckstein, Marina Geremia, Jefferson G. Melo
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms. Comput. Optim. Appl. 75 (2) (2020)
Jonathan Eckstein
Deriving solution value bounds from the ADMM. Optim. Lett. 14 (6) (2020)
Patrick R. Johnstone, Jonathan Eckstein
Convergence Rates for Projective Splitting. SIAM J. Optim. 29 (3) (2019)
Patrick R. Johnstone, Jonathan Eckstein
Single-Forward-Step Projective Splitting: Exploiting Cocoercivity. CoRR (2019)
Jonathan Eckstein, Ai Kagawa, Noam Goldberg
REPR: Rule-Enhanced Penalized Regression. INFORMS J. Optim. 1 (2) (2019)
Patrick L. Combettes, Jonathan Eckstein
Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions. Math. Program. 168 (1-2) (2018)
Patrick R. Johnstone, Jonathan Eckstein
Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting. CoRR (2018)
Jonathan Eckstein, Wang Yao
Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM. Math. Program. 170 (2) (2018)
Patrick R. Johnstone, Jonathan Eckstein
Projective Splitting with Forward Steps only Requires Continuity. CoRR (2018)
Jonathan Eckstein, Gyorgy Matyasfalvi
Efficient Distributed-Memory Parallel Matrix-Vector Multiplication with Wide or Tall Unstructured Sparse Matrices. CoRR (2018)
Patrick R. Johnstone, Jonathan Eckstein
Convergence Rates for Projective Splitting. CoRR (2018)
Jonathan Eckstein
Comments on a Simplified Form of Block-Iterative Operator Splitting, and an Asynchronous Algorithm Resembling the Multi-block Alternating Direction Method of Multipliers. J. Optim. Theory Appl. 176 (3) (2018)
Jonathan Eckstein
A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers. J. Optim. Theory Appl. 173 (1) (2017)
Jonathan Eckstein, Noam Goldberg, Ai Kagawa
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement. ICML (2017)
Jonathan Eckstein, Wang Yao
Approximate ADMM algorithms derived from Lagrangian splitting. Comput. Optim. Appl. 68 (2) (2017)
Jonathan Eckstein, Deniz Eskandani, Jingnan Fan
Multilevel Optimization Modeling for Risk-Averse Stochastic Programming. INFORMS J. Comput. 28 (1) (2016)
Jonathan Eckstein, William E. Hart, Cynthia A. Phillips
PEBBL: an object-oriented framework for scalable parallel branch and bound. Math. Program. Comput. 7 (4) (2015)
Jonathan Eckstein, Paulo J. S. Silva
A practical relative error criterion for augmented Lagrangians. Math. Program. 141 (1-2) (2013)
Jonathan Eckstein, Noam Goldberg
An Improved Branch-and-Bound Method for Maximum Monomial Agreement. INFORMS J. Comput. 24 (2) (2012)
Noam Goldberg, Jonathan Eckstein
Sparse weighted voting classifier selection and its linear programming relaxations. Inf. Process. Lett. 112 (12) (2012)
Stephen P. Boyd, Neal Parikh, Eric Chu, Borja Peleato, Jonathan Eckstein
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Found. Trends Mach. Learn. 3 (1) (2011)
Jonathan Eckstein, Paulo J. S. Silva
Proximal methods for nonlinear programming: double regularization and inexact subproblems. Comput. Optim. Appl. 46 (2) (2010)
Noam Goldberg, Jonathan Eckstein
Boosting Classifiers with Tightened L0-Relaxation Penalties. ICML (2010)
Jonathan Eckstein, Benar Fux Svaiter
General Projective Splitting Methods for Sums of Maximal Monotone Operators. SIAM J. Control. Optim. 48 (2) (2009)
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, Gábor Rudolf
Arrival Rate Approximation by Nonnegative Cubic Splines. Oper. Res. 56 (1) (2008)
Jonathan Eckstein, Benar Fux Svaiter
A family of projective splitting methods for the sum of two maximal monotone operators. Math. Program. 111 (1-2) (2008)
Jonathan Eckstein, Avigdor Gal, Sarit Reiner
Monitoring an Information Source Under a Politeness Constraint. INFORMS J. Comput. 20 (1) (2008)
Jonathan Eckstein, Mikhail Nediak
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming. J. Heuristics 13 (5) (2007)
Paulo J. S. Silva, Jonathan Eckstein
Double-Regularization Proximal Methods, with Complementarity Applications. Comput. Optim. Appl. 33 (2-3) (2006)
Jonathan Eckstein, Mikhail Nediak
Depth-Optimized Convexity Cuts. Ann. Oper. Res. 139 (1) (2005)
Jonathan Eckstein
A practical general approximation criterion for methods of multipliers based on Bregman distances. Math. Program. 96 (1) (2003)
Jonathan Eckstein, Peter L. Hammer, Ying Liu, Mikhail Nediak, Bruno Simeone
The Maximum Box Problem and its Application to Data Analysis. Comput. Optim. Appl. 23 (3) (2002)
Paulo José da Silva e Silva, Jonathan Eckstein, Carlos Humes Jr.
Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances. SIAM J. Optim. 12 (1) (2001)
Avigdor Gal, Jonathan Eckstein
Managing periodically updated data in relational databases: a stochastic modeling approach. J. ACM 48 (6) (2001)
Avigdor Gal, Jonathan Eckstein
Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach CoRR (2000)
Jonathan Eckstein, Michael C. Ferris
Smooth methods of multipliers for complementarity problems. Math. Program. 86 (1) (1999)
Jonathan Eckstein, Michael C. Ferris
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control. INFORMS J. Comput. 10 (2) (1998)
Jonathan Eckstein
Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83 (1998)
Jonathan Eckstein
How Much Communication Does Parallel Branch and Bound Need? INFORMS J. Comput. 9 (1) (1997)
Jonathan Eckstein
Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5. Comput. Optim. Appl. 7 (2) (1997)
Jonathan Eckstein, I. Ilkay Boduroglu, Lazaros C. Polymenakos, Donald Goldfarb
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. INFORMS J. Comput. 7 (4) (1995)
Jonathan Eckstein
Control strategies for parallel mixed integer branch and bound. SC (1994)
Jonathan Eckstein
Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5. SIAM J. Optim. 4 (4) (1994)
Jonathan Eckstein
The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2. INFORMS J. Comput. 5 (1) (1993)
Jonathan Eckstein
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming. Math. Oper. Res. 18 (1) (1993)
Jonathan Eckstein, Dimitri P. Bertsekas
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55 (1992)
Dimitri P. Bertsekas, Jonathan Eckstein
Dual coordinate step methods for linear network flow problems. Math. Program. 42 (1-3) (1988)