Jonathan Eckstein

5.9k total citations · 1 hit paper
58 papers, 3.5k citations indexed

About

Jonathan Eckstein is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Computational Mechanics. According to data from OpenAlex, Jonathan Eckstein has authored 58 papers receiving a total of 3.5k indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 24 papers in Numerical Analysis and 16 papers in Computational Mechanics. Recurrent topics in Jonathan Eckstein's work include Advanced Optimization Algorithms Research (24 papers), Optimization and Variational Analysis (21 papers) and Sparse and Compressive Sensing Techniques (16 papers). Jonathan Eckstein is often cited by papers focused on Advanced Optimization Algorithms Research (24 papers), Optimization and Variational Analysis (21 papers) and Sparse and Compressive Sensing Techniques (16 papers). Jonathan Eckstein collaborates with scholars based in United States, Israel and Brazil. Jonathan Eckstein's co-authors include Dimitri P. Bertsekas, B. F. Svaiter, Michael C. Ferris, Paulo J. S. Silva, Mikhail Nediak, Avigdor Gal, Patrick L. Combettes, Decision Systems., Noam Goldberg and Bruno Simeone and has published in prestigious journals such as Management Science, International Journal of Hydrogen Energy and Operations Research.

In The Last Decade

Jonathan Eckstein

57 papers receiving 3.1k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators

1992 1.9k citations Jonathan Eckstein, Dimitri P. Bertsekas Mathematical Programming profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jonathan Eckstein United States	22	1.5k	1.4k	1.4k	584	418	58	3.5k
Bertrand Mercier France	11	1.4k 0.9×	1.9k 1.3×	1.1k 0.8×	541 0.9×	594 1.4×	23	3.4k
Hédy Attouch France	22	1.9k 1.3×	1.5k 1.1×	1.3k 1.0×	465 0.8×	878 2.1×	44	3.3k
Xiaoming Yuan China	38	1.6k 1.1×	3.8k 2.7×	1.8k 1.3×	1.4k 2.4×	810 1.9×	156	6.2k
Adrian S. Lewis United States	40	2.7k 1.9×	1.9k 1.3×	2.3k 1.7×	494 0.8×	699 1.7×	132	6.0k
Jean‐Baptiste Hiriart‐Urruty France	26	3.0k 2.1×	1.2k 0.8×	2.5k 1.9×	324 0.6×	511 1.2×	79	5.3k
Paul Tseng United States	42	3.5k 2.4×	2.3k 1.6×	3.4k 2.5×	604 1.0×	643 1.5×	103	6.7k
Xiaojun Chen China	43	2.5k 1.7×	2.0k 1.4×	2.5k 1.8×	550 0.9×	577 1.4×	213	5.6k
Defeng Sun Singapore	43	3.0k 2.1×	2.6k 1.8×	3.5k 2.5×	394 0.7×	274 0.7×	125	5.7k
B. T. Polyak Russia	25	2.2k 1.5×	1.9k 1.3×	2.4k 1.7×	655 1.1×	505 1.2×	87	6.7k
J. Frédéric Bonnans France	26	2.6k 1.8×	1.0k 0.7×	2.1k 1.5×	260 0.4×	258 0.6×	119	4.9k

Countries citing papers authored by Jonathan Eckstein

Since Specialization

Citations

This map shows the geographic impact of Jonathan Eckstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jonathan Eckstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jonathan Eckstein more than expected).

Fields of papers citing papers by Jonathan Eckstein

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jonathan Eckstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jonathan Eckstein. The network helps show where Jonathan Eckstein may publish in the future.

Co-authorship network of co-authors of Jonathan Eckstein

This figure shows the co-authorship network connecting the top 25 collaborators of Jonathan Eckstein. A scholar is included among the top collaborators of Jonathan Eckstein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jonathan Eckstein. Jonathan Eckstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Eckstein, Jonathan, et al.. (2025). Performance assessment of a green hydrogen-based household energy system supported by a battery storage at different resolutions of the electrical load profile. International Journal of Hydrogen Energy. 144. 30–41.

Eckstein, Jonathan, Jean‐Paul Watson, & David L. Woodruff. (2023). Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation. Operations Research. 73(1). 311–324. 1 indexed citations

Eckstein, Jonathan, et al.. (2017). Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement.. International Conference on Machine Learning. 1059–1067. 1 indexed citations

Eckstein, Jonathan. (2017). A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers. Journal of Optimization Theory and Applications. 173(1). 155–182. 20 indexed citations

Eckstein, Jonathan & Noam Goldberg. (2011). An Improved Branch-and-Bound Method for Maximum Monomial Agreement. INFORMS journal on computing. 24(2). 328–341. 7 indexed citations

Goldberg, Noam & Jonathan Eckstein. (2010). Boosting Classifiers with Tightened L0-Relaxation Penalties. International Conference on Machine Learning. 383–390. 4 indexed citations

Eckstein, Jonathan & Mikhail Nediak. (2007). Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming. Journal of Heuristics. 13(5). 471–503. 26 indexed citations

Eckstein, Jonathan & B. F. Svaiter. (2007). A family of projective splitting methods for the sum of two maximal monotone operators. Mathematical Programming. 111(1-2). 173–199. 57 indexed citations

Eckstein, Jonathan. (2003). A practical general approximation criterion for methods of multipliers based on Bregman distances. Mathematical Programming. 96(1). 61–86. 11 indexed citations

10.

Eckstein, Jonathan, et al.. (2002). The Maximum Box Problem and its Application to Data Analysis. Computational Optimization and Applications. 23(3). 285–298. 46 indexed citations

11.

Eckstein, Jonathan, et al.. (2002). YASAI: Yet Another Add-in for Teaching Elementary Monte Carlo Simulation in Excel. INFORMS Transactions on Education. 2(2). 12–26. 14 indexed citations

12.

Eckstein, Jonathan & Michael C. Ferris. (1999). Smooth methods of multipliers for complementarity problems. Mathematical Programming. 86(1). 65–90. 36 indexed citations

13.

Eckstein, Jonathan. (1998). Approximate iterations in Bregman-function-based proximal algorithms. Mathematical Programming. 83(1-3). 113–123. 126 indexed citations

14.

Eckstein, Jonathan. (1997). Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5. Computational Optimization and Applications. 7(2). 199–220. 11 indexed citations

15.

Eckstein, Jonathan, et al.. (1995). Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. INFORMS Journal on Computing. 7(4). 402–416. 14 indexed citations

16.

Eckstein, Jonathan. (1994). Control strategies for parallel mixed integer branch and bound. Conference on High Performance Computing (Supercomputing). 41–48. 12 indexed citations

17.

Eckstein, Jonathan, et al.. (1993). Stochastic Dedication: Designing Fixed Income Portfolios Using Massively Parallel Benders Decomposition. Management Science. 39(11). 1422–1438. 50 indexed citations

18.

Eckstein, Jonathan & Dimitri P. Bertsekas. (1992). On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming. 55(1-3). 293–318. 1860 indexed citations breakdown →

19.

Eckstein, Jonathan & Yosef Sheffi. (1987). OPTIMIZATION OF GROUP LINE-HAUL OPERATIONS FOR MOTOR CARRIERS USING TWIN TRAILERS. Transportation Research Record Journal of the Transportation Research Board. 7 indexed citations

20.

Bertsekas, Dimitri P. & Jonathan Eckstein. (1987). Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems. IFAC Proceedings Volumes. 20(5). 103–114. 46 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact