Jonathan Eckstein
#164,666
Most Influential Person Now
Jonathan Eckstein's AcademicInfluence.com Rankings
Jonathan Ecksteinmathematics Degrees
Mathematics
#7474
World Rank
#10157
Historical Rank
Operations Research
#80
World Rank
#82
Historical Rank
Measure Theory
#2206
World Rank
#2652
Historical Rank
Jonathan Ecksteincomputer-science Degrees
Computer Science
#9775
World Rank
#10255
Historical Rank
Machine Learning
#4371
World Rank
#4421
Historical Rank
Download Badge
Mathematics Computer Science
Why Is Jonathan Eckstein Influential?
(Suggest an Edit or Addition)Jonathan Eckstein's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (2011) (16760)
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators (1992) (2762)
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (1993) (356)
- Splitting methods for monotone operators with applications to parallel optimization (1989) (341)
- Augmented Lagrangian and Alternating Direction Methods for Convex Optimization: A Tutorial and Some Illustrative Computational Results (2012) (262)
- Approximate iterations in Bregman-function-based proximal algorithms (1998) (182)
- Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives (2015) (167)
- Some Saddle-function splitting methods for convex programming (1994) (149)
- Parallel alternating direction multiplier decomposition of convex programs (1994) (146)
- Some Reformulations and Applications of the Alternating Direction Method of Multipliers (1994) (131)
- General Projective Splitting Methods for Sums of Maximal Monotone Operators (2009) (121)
- Dual coordinate step methods for linear network flow problems (1988) (117)
- Pico: An Object-Oriented Framework for Parallel Branch and Bound * (2001) (112)
- A family of projective splitting methods for the sum of two maximal monotone operators (2007) (111)
- Stochastic dedication: designing fixed income portfolios using massively parallel Benders decomposition (1993) (103)
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control (1998) (98)
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 (1994) (96)
- The Maximum Box Problem and its Application to Data Analysis (2002) (91)
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions (2015) (90)
- Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems (1987) (80)
- An Alternating Direction Method for Linear Programming (1990) (70)
- A practical relative error criterion for augmented Lagrangians (2013) (70)
- Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming (2007) (67)
- Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMM (2018) (62)
- Approximate ADMM algorithms derived from Lagrangian splitting (2017) (60)
- Managing periodically updated data in relational databases: a stochastic modeling approach (2000) (56)
- Smooth methods of multipliers for complementarity problems (1999) (52)
- A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers (2017) (41)
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2 (1995) (37)
- Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances (2001) (31)
- Arrival rate approximation by nonnegative cubic splines (2005) (28)
- Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting (2018) (26)
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms (2019) (26)
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2 (1993) (23)
- Control strategies for parallel mixed integer branch and bound (1994) (21)
- YASAI: Yet Another Add-in for Teaching Elementary Monte Carlo Simulation in Excel (2002) (21)
- A practical general approximation criterion for methods of multipliers based on Bregman distances (2003) (19)
- Convergence Rates for Projective Splitting (2018) (19)
- PICO: An Object-Oriented Framework for Branch and Bound (2000) (19)
- Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5 (1997) (18)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (2015) (18)
- Projective splitting with forward steps (2020) (17)
- An Improved Branch-and-Bound Method for Maximum Monomial Agreement (2012) (17)
- Single-forward-step projective splitting: exploiting cocoercivity (2019) (16)
- The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm (1988) (15)
- Double-Regularization Proximal Methods, with Complementarity Applications (2005) (14)
- Sparse weighted voting classifier selection and its linear programming relaxations (2012) (13)
- Parallel Branch-and-Bound Methods for Mixed Integer Programming (1996) (13)
- Monitoring an Information Source Under a Politeness Constraint (2008) (13)
- Proximal methods for nonlinear programming: double regularization and inexact subproblems (2010) (12)
- How Much Communication Does Parallel Branch and Bound Need? (1997) (11)
- Boosting Classifiers with Tightened L0-Relaxation Penalties (2010) (10)
- OPTIMIZATION OF GROUP LINE-HAUL OPERATIONS FOR MOTOR CARRIERS USING TWIN TRAILERS (1987) (10)
- Massively Parallel Mixed-Integer Programming: Algorithms and Applications (2006) (9)
- Multilevel Optimization Modeling for Risk-Averse Stochastic Programming (2016) (9)
- REPR: Rule-Enhanced Penalized Regression (2019) (8)
- Projective splitting with forward steps only requires continuity (2018) (7)
- A Bundle Method for Exploiting Additive Structure in Difficult Optimization Problems (2015) (5)
- Scheduling of Data Transcription in Periodically Connected Databases (2003) (4)
- Depth-Optimized Convexity Cuts (2005) (4)
- Chapter 5 Parallel computing in network optimization (1995) (4)
- Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement (2017) (3)
- Resource Management in a Parallel Mixed Integer Programming Package (1997) (3)
- Efficient Distributed-Memory Parallel Matrix-Vector Multiplication with Wide or Tall Unstructured Sparse Matrices (2018) (3)
- Deriving solution value bounds from the ADMM (2020) (3)
- A Simplified Form of Block-Iterative Operator Splitting , and an Asynchronous Algorithm Resembling the Multi-Block ADMM ∗ (2016) (3)
- Routing Methods for Twin-Trailer Trucks (1986) (2)
- Letters: Teaching Evaluations (2004) (2)
- Complexity of Bilevel Coherent Risk Programming (2012) (1)
- Tightened L 0-Relaxation Penalties for Classification (2009) (1)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (2015) (1)
- Single-forward-step projective splitting: exploiting cocoercivity (2020) (1)
- Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers (2021) (1)
- Sparse Weighted Voting Classifier Selection and its LP Relaxations (2010) (1)
- Hierarchical Parallel MIP. (2013) (0)
- Basic Structured Query Language (SQL) (2017) (0)
- Approximate ADMM algorithms derived from Lagrangian splitting (2017) (0)
- Tightened L 0 -Relaxation Penalties for Classication 1 (2009) (0)
- Many-to-Many Relationships (2017) (0)
- A Covering Decomposition Algorithm for Power Grid Cyber-Network Segmentation (2021) (0)
- Alternating Direction Multiplier Decomposition of Convex Problems (1991) (0)
- Projective Hedging Algorithms for Distributed Optimization under Uncertainty * (2022) (0)
- DIMACS Technical Report 2009-21 November 2009 Tightened L 0-Relaxation Penalties for Classification 1 by (2009) (0)
- A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers (2017) (0)
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms (2020) (0)
- Abstracts for INFORMS Parallel Combinatorial Optimization Session. (2007) (0)
- Coherent Risk-Adjusted Decisions Over Time: a Bilevel Programming Approach (2015) (0)
- Projective Splitting Methods for Pairs of Monotone Operators (2003) (0)
- Introduction to Data Management and Database Design (2017) (0)
- Parallel Solver Framework for Mixed-Integer PDE-Constrained Optimization. (2021) (0)
- Genessee Wire and Cable (1992) (0)
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions (2016) (0)
- Basic Definitions and Concepts (2017) (0)
- Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMM (2017) (0)
- A practical relative error criterion for augmented Lagrangians (2012) (0)
- Smooth Methods of Multipliers for Complementarity Problems Smooth Methods of Multipliers for Complementarity Problems (1997) (0)
- Time Consistency Versus Law Invariance in Multistage Stochastic Optimization with Coherent Risk Measures : Multilevel Optimization Modeling and Computational Complexity (2013) (0)
- Multiple Relationships between the Same Pair of Tables (2017) (0)
- Multiple Tables in Access (2017) (0)
- Parallel Integer and Combinatorial Optimization Library (PICO) (2001) (0)
- Methods for Sums of Maximal Monotone Operators (2007) (0)
- Object-Parallel Infrastructure for Implementing First-Order Methods , with an Example Application to LASSO (2015) (0)
- Teaching Evaluations [2] (multiple letters) (2004) (0)
- Operations for Motor Carriers Using Twin Trailers (2017) (0)
- Deriving solution value bounds from the ADMM (2020) (0)
- METHODS OF TEMPORAL DIFFERENCES FOR RISK-AVERSE DYNAMIC PROGRAMMING AND LEARNING (2020) (0)
- Advanced Query Techniques (2017) (0)
- Dual Coordinate Ascent Methods for Linear Network Flow Problems (0)
- Beginning Fundamentals of Relational Databases and MS Access (2017) (0)
- The perturbed generalized proximal point algorithm (2017) (0)
- RISK-AVERSE DECISION MAKING AND BILEVEL STOCHASTIC PROGRAMMING WITH APPLICATIONS (2019) (0)
- Comments on a Simplified Form of Block-Iterative Operator Splitting, and an Asynchronous Algorithm Resembling the Multi-block Alternating Direction Method of Multipliers (2018) (0)
- Comments on a Simplified Form of Block-Iterative Operator Splitting, and an Asynchronous Algorithm Resembling the Multi-block Alternating Direction Method of Multipliers (2018) (0)
- The built heritage (1992) (0)
- PICO's New Hierarchical Branch-and Bound System for Massively Parallel Integer Programming. (2012) (0)
- Projective splitting with forward steps only requires continuity (2019) (0)
- More about Forms and Navigation (2017) (0)
- Combinatorial optimization for national security applications. (2014) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Jonathan Eckstein?
Jonathan Eckstein is affiliated with the following schools:
