Jonathan Eckstein

56 papers A* 2A 1Journal 51

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