{"id":363,"date":"2020-07-09T16:51:59","date_gmt":"2020-07-09T16:51:59","guid":{"rendered":"http:\/\/sites.rutgers.edu\/eckstein\/?page_id=363"},"modified":"2025-10-27T20:37:06","modified_gmt":"2025-10-27T20:37:06","slug":"publications","status":"publish","type":"page","link":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"
Google Scholar citations<\/a><\/h5>\n


\nNote:<\/strong> This list is fairly comprehensive but not completely exhaustive. I am the first or sole author unless otherwise indicated.<\/p>\n

Textbook<\/h3>\n
    \n
  1. Introductory Relational Database Design for Business, with Microsoft Access<\/a>, with Bonnie R. Schultz,<\/a> Wiley<\/a>, 2018 (student companion website<\/a> and instructor companion website<\/a> available from the publisher).<\/li>\n<\/ol>\n

    Peer-Reviewed Journal and Conference Proceeding Articles<\/h3>\n
      \n
    1. Stochastic Projective Splitting<\/a>, with Patrick R. Johnstone<\/a> (first author). Computational Optimization and Applications<\/em><\/a>, 87(4):397-437 (2024).<\/li>\n
    2. Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation<\/a>, with Jean-Paul Watson<\/a> and David L. Woodruff<\/a>. \u00a0Operations Research<\/a> 73(1):311-324.\u00a0 Earlier version available as Optimization Online working paper 2018-10-6895<\/a>.<\/li>\n
    3. Projective Splitting with Forward Steps<\/a>, with Patrick R. Johnstone<\/a> (first author). Mathematical Programming<\/em><\/a> 191(2):631-670 (2022).<\/li>\n
    4. Single-Forward-Step Projective Splitting: Exploiting Cocoercivity<\/a>, with Patrick R. Johnstone<\/a> (first author). Computational Optimization and Applications<\/em><\/a>, 78(1):125-166 (2021).<\/li>\n
    5. Deriving Solution Value Bounds from the ADMM<\/a> Optimization Letters<\/em><\/a> 14(6), 1289-1303 (2020).<\/li>\n
    6. Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms<\/a>, with M. Marques Alves<\/a> (first author), Marina Geremia<\/a>, and Jefferson G. Melo<\/a>. \u00a0 Computational Optimization and Applications<\/em><\/a>, 75(2):389-422 (2020).<\/li>\n
    7. Projective Splitting with Forward Steps Only Requires Continuity<\/a>, with Patrick R. Johnstone<\/a> (first author). Optimization Letters<\/em><\/a> 14(1):229-247 (2020).<\/li>\n
    8. Convergence Rates for Projective Splitting<\/a>, with Patrick R. Johnstone<\/a> (first author). SIAM Journal on Optimization<\/a><\/em> 29(3):1931-1957 (2019).<\/li>\n
    9. REPR: Rule-Enhanced Penalized Regression<\/a>, with Ai Kagawa<\/a> and Noam Goldberg<\/a>. INFORMS Journal on Optimization<\/em><\/a> 1(2):143-163 (2019).<\/li>\n
    10. Relative-Error Approximate Versions of Douglas-Rachford Splitting and Special Cases of the ADMM<\/a>, with Wang Yao<\/a>.\u00a0 Mathematical Programming<\/em><\/a>, 170(2):417-444 (2018).<\/li>\n
    11. Asynchronous Block-Iterative Primal-Dual Decomposition Methods for Monotone Inclusions<\/a>, with Patrick L. Combettes<\/a> (first author). Mathematical Programming<\/em><\/a> 168(1-2):645-672 (2018).<\/li>\n
    12. Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement<\/a>, with Noam Goldberg<\/a> and Ai Kagawa<\/a>. Proceedings of the 34th International Conference on Machine Learning (ICML 2017)<\/a>, appearing as Proceedings of Machine Learning Research 70:1059-1067 (2017).<\/li>\n
    13. Approximate ADMM Algorithms Derived from Lagrangian Splitting<\/a>, with Wang Yao<\/a>.\u00a0 Computational Optimization and Applications<\/em><\/a>, 68(2):363-405 (2017).<\/li>\n
    14. A Simplified Form of Block-Iterative Operator Splitting, and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers<\/a>.\u00a0 Journal of Optimization Theory and Applications<\/a>, 173(1):155-182 (2017). Corrections to one of the proofs are in a “forum” note in the same journal<\/a>.<\/li>\n
    15. Multilevel Optimization Modeling for Risk-Averse Stochastic Programming<\/a>, with Deniz Eskandani<\/a> and Jingnan Fan<\/a>.\u00a0 INFORMS Journal on Computing<\/em><\/a>, 28(1):112-128 (2016), plus online supplement<\/a>.<\/li>\n
    16. PEBBL: An Object-Oriented Framework for Scalable Parallel Branch and Bound<\/a>, with William E. Hart<\/a> and Cynthia A. Phillips<\/a>.\u00a0 Mathematical Programming Computation<\/em><\/a>, 7(4):429-429 (2015).<\/li>\n
    17. Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives<\/a>, with Wang Yao<\/a>.\u00a0 Pacific Journal on Optimization<\/a>, 11(4):619-644 (2015). Expanded version<\/a> available at Optimization Online<\/a>.<\/li>\n
    18. A Practical Relative Error Criterion for Augmented Lagrangians<\/a> with Paulo J.S. Silva<\/a>.\u00a0 Mathematical Programming<\/em><\/a> 141(1):319-348 (2013).<\/li>\n
    19. An Improved Branch-and-Bound Method for Maximum Monomial Agreement<\/a> with Noam Goldberg<\/a>. \u00a0INFORMS Journal on Computing<\/em><\/a>, 24(2):328-341 (2012).<\/li>\n
    20. Sparse Weighted Voting Classifier Selection and its LP Relaxations<\/a> with\u00a0Noam Goldberg<\/a> (first author). Information Processing Letters<\/a><\/em> 112:481-486 (2012)<\/li>\n
    21. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers<\/a> with Stephen Boyd<\/a> (first author), Neal Parikh<\/a>, Eric Chu<\/a>, and Borja Peleato<\/a>. Foundations and Trends in Machine Learning<\/em><\/a>, 3(1):1-122 (2011).<\/li>\n
    22. Boosting Classifiers with Tightened L<\/em>0<\/sub>-Relaxation Penalties<\/a>, with Noam Goldberg<\/a>. Proceedings of the the 27th<\/sup> International Conference on Machine Learning<\/a><\/em> (ICML 2010), 383-390 (2010).\u00a0 [Apology: the ICML 2010 site appears to have many broken links at this time]<\/li>\n
    23. Proximal Methods for Nonlinear Programming: Double Regularization and Inexact Subproblems<\/a>, with Paulo J.S. Silva<\/a>. Computational Optimization and Applications<\/em><\/a>, 46(2):279-304 (2010).<\/li>\n
    24. General Projective Splitting Methods for Sums of Maximal Monotone Operators<\/a> with B.F. Svaiter<\/a>, SIAM Journal on Control and Optimization<\/em><\/a>, 48(2):787-811 (2009).<\/li>\n
    25. An Improved Branch-and-Bound Method for Maximum Monomial Agreement<\/a> with Noam Goldberg<\/a>. OPT 2008 Optimization for Machine Learning Workshop<\/a>, Neural Information Processing Systems Workshop (NIPS08)<\/a>, December 2008.\u00a0 [Apology: the OPT 2008 sub-site does not seem to be operating]<\/li>\n
    26. Optimal Information Monitoring under a Politeness Constraint<\/a> with Avigdor Gal<\/a>, and Sarit Reiner<\/a>. INFORMS Journal on Computing<\/em><\/a> 20(1):3-20 (2008).<\/li>\n
    27. Arrival Rate Approximation by Nonnegative Cubic Splines<\/a> with Farid Alizadeh<\/a> (first author), Nilay Noyan<\/a>, and Gabor Rudolf<\/a>. Operations Research<\/a><\/em>, 56(1):140-156 (2008).<\/li>\n
    28. A Family of Projective Splitting Methods for the Sum of Two Maximal Monotone Operators<\/a> with B.F. Svaiter<\/a>. Mathematical Programming<\/em><\/a> 111(1-2):173-199 (2008).<\/li>\n
    29. Pivot, Cut, and Dive: A Heuristic for Mixed 0-1 Integer Programming<\/a> with Mikhail Nediak<\/a>. Journal of Heuristics<\/a><\/em> 13(5):471-503 (2007).<\/li>\n
    30. Double-Regularization Proximal Methods, with Complementarity Applications<\/a>, with Paulo J.S. Silva<\/a> (first author). Computational Optimization and Applications<\/em><\/a> 33(2-3):115-156 (2006).<\/li>\n
    31. Depth-Optimized Convexity Cuts<\/a> with Mikhail Nediak<\/a>. Annals of Operations Research<\/a><\/em> 139:95-129 (2005)<\/li>\n
    32. Scheduling of Data Transcription in Periodically Connected Databases<\/a> with Avigdor Gal <\/a> (first author) and Zachary Stoumbos<\/a>, Stochastic Analysis and Applications<\/a><\/em> 21(5):1021-1058 (2003).<\/li>\n
    33. A Practical General Approximation Criterion for Methods of Multipliers Based on Bregman Distances<\/a> Mathematical Programming<\/em><\/a> 96(1):61-86 (2003).<\/li>\n
    34. The Maximum Box Problem and its Application to Data Analysis<\/a> with Peter L. Hammer<\/a>, Ying Liu, Mikhail Nediak<\/a>, and Bruno Simeone<\/a>. Computational Optimization and Applications<\/em><\/a>, 23(3):285-298 (2002).<\/li>\n
    35. YASAI: Yet Another Add-In for Teaching Elementary Monte Carlo Simulation in EXCEL<\/a> with Steven T. Riedmueller. INFORMS Transactions on Education<\/em><\/a> 2(2):12-26 (2002).<\/li>\n
    36. Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach<\/a> with Avigdor Gal <\/a> (first author). Journal of the ACM<\/em><\/a>, 46(6):1141-1183 (2001).<\/li>\n
    37. PICO: An Object-Oriented Framework for Parallel Branch and Bound with\u00a0Cynthia A. Phillips<\/a> and William E. Hart<\/a>.\u00a0 Proceedings of the Workshop on Inherently Parallel Algorithms in Optimization and Feasibility and their Applications<\/em><\/a>, Studies in Computational Mathematics, Elsevier Scientific, 219-265 (2001).<\/li>\n
    38. Rescaling and Stepsize Selection in Proximal Methods using Separable Generalized Distances<\/a> with\u00a0Paulo J.S. Silva<\/a> (first author) and Carlos Humes Jr.<\/a>. SIAM Journal on Optimization<\/em><\/a>, 12(1):238-261 (2001).<\/li>\n
    39. Smooth Methods of Multipliers for Monotone Complementarity Problems<\/a> with Michael C. Ferris<\/a>. Mathematical Programming<\/em><\/a>, 86(1):65-90 (1999).<\/li>\n
    40. Approximate Iterations in Bregman-Function-Based Proximal Algorithms<\/a> Mathematical Programming<\/em><\/a>, 83(1) 113-123 (1998).<\/li>\n
    41. Operator Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control<\/a>, with Michael C. Ferris<\/a>. \u00a0INFORMS Journal on Computing<\/em><\/a>, 10(2):218-235 (1998).<\/li>\n
    42. Resource Management in a Parallel Mixed Integer Programming Package, with William E. Hart<\/a> and Cynthia A. Phillips<\/a>. \u00a0 Proceedings of the Intel Supercomputer Users Group Conference, Albuquerque, NM, June 11-13, 1997.<\/li>\n
    43. How Much Communication Does Parallel Branch and Bound Need?<\/a> INFORMS Journal on Computing<\/em><\/a>, 9(1):15-29 (1997).<\/li>\n
    44. Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5<\/a>. Computational Optimization and Applications<\/em><\/a>, 7(2):199-220 (1997).<\/li>\n
    45. Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2<\/a>, with I. Ilkay Boduroglu<\/a>, Lazaros Polymenakos, and Donald Goldfarb<\/a>. ORSA Journal on Computing<\/em><\/a> 7(4):402-416 (1995).<\/li>\n
    46. Control Strategies for Parallel Mixed Integer Branch and Bound<\/a>. Supercomputing ’94:Proceedings of the 1994 ACM\/IEEE Conference on Supercomputing<\/em><\/a>, IEEE Computer Society Press, Los Alamitos, CA, 41-48 (1994).<\/li>\n
    47. Parallel Branch-and-Bound Methods for Mixed-Integer Programming on the CM-5<\/a>.\u00a0 SIAM Journal on Optimization\u00a0<\/a><\/em> 4(4):794-814 (1994).<\/li>\n
    48. Some Reformulations and Applications of the Alternating Direction Method of Multipliers<\/a>, with Masao Fukushima<\/a>. In Large Scale Optimization: State of the Art<\/em><\/a>, W. W. Hager, D. W. Hearn, P. M. Pardalos, eds., Kluwer Academic, Dordrecht, 115-134 (1994).<\/li>\n
    49. Some Saddle-Function Splitting Methods for Convex Programming<\/a>. Optimization Methods and Software<\/a><\/em> 4(1):75-83 (1994).<\/li>\n
    50. Parallel Alternating Direction Multiplier Decomposition of Convex Programs<\/a>. Journal of Optimization Theory and Applications<\/a><\/em> 80(1):39-62 (1994).<\/li>\n
    51. Stochastic Dedication: Designing Fixed-Income Portfolios using Massively Parallel Benders Decomposition<\/a>, with Randall S. Hiller (first author). Management Science<\/em><\/a> 39(11):1422-1438 (1993).<\/li>\n
    52. The Alternating Step Method for Monotropic Programming on the Connection Machine 2<\/a>.\u00a0 ORSA Journal on Computing<\/em><\/a> 5(1):84-96 (1993).<\/li>\n
    53. Nonlinear Proximal Point Algorithms using Bregman Functions, with Applications to Convex Programming<\/a>.\u00a0 Mathematics of Operations Research<\/em><\/a> 18(1):202-226 (1993).<\/li>\n
    54. On the Douglas-Rachford Splitting Method and the Proximal Point Algorithm for Maximal Monotone Operators,<\/a> with Dimitri P. Bertsekas<\/a>. Mathematical Programming<\/em><\/a> 55(3):293-318 (1992).<\/li>\n
    55. Dual Coordinate Step Methods for Linear Network Flow Problems<\/a>, with Dimitri P. Bertsekas<\/a> (first author).\u00a0 Mathematical Programming<\/em><\/a> 42(2):203-243 (1988).<\/li>\n
    56. Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems<\/a> with Dimitri P. Bertsekas<\/a> (first author). \u00a0 Proceedings of the International Federation of Automatic Control<\/em> <\/a>(IFAC) 20(issue 5, part 7):103-114 (1987).<\/li>\n
    57. Optimization of Group Line-Haul Operations for Motor Carriers Using Twin Trailers, with Yosef Sheffi<\/a>. Transportation Research Record<\/em><\/a> 1120:12-23 (1987).<\/li>\n<\/ol>\n

      Doctoral Dissertation<\/h3>\n

      Splitting Methods for Monotone Operators, with Applications to Parallel Optimization<\/a>, MIT, 1989.<\/p>\n

      Non-Refereed Book Chapters, Selected Technical Reports, and Other Publications<\/h3>\n

      Also see Open-Source Software<\/a> for software documentation<\/p>\n

        \n
      1. Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization<\/a>, with Chang Yu<\/a>.\u00a0 ArXiv preprint 2503.11809, March 2025 (with updates July and September 2025).<\/li>\n
      2. A covering decomposition algorithm for power grid cyber-network segmentation<\/a>, with Emma S. Johnson<\/a> (first author), Santanu S. Dey<\/a>, Cynthia A. Phillips<\/a>, and John D. Siirola<\/a> Optimization Online preprint 2021-12-8725, December 2021.<\/li>\n
      3. Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting<\/a>, with Patrick R. Johnstone<\/a> (first author) Optimization Online working paper 2018-03-6533 and ArXiv preprint 1803.07043<\/a>, March 2018.<\/li>\n
      4. Approximate Versions of the Alternating Direction Method of Multipliers<\/a>, with Wang Yao<\/a>.\u00a0 Optimization Online working paper 2016-01-5276, January 2016.<\/li>\n
      5. A Bundle Method for Exploiting Additive Structure in Difficult Optimization Problems<\/a>, with Welington de Oliveira<\/a> (first author) Optimization Online working paper 2015-05-4935, May 2015.<\/li>\n
      6. Object-Parallel Infrastructure for Implementing First-Order Methods, with an Example Application to LASSO<\/a>, with Gy\u00f6rgy M\u00e1ty\u00e1sfalvi. Optimization Online working paper 2015-01-4748, January 2015.<\/li>\n
      7. Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives<\/a>, with Wang Yao<\/a>.\u00a0 Optimization Online working paper 2015-06-4954, June\/October 2015.<\/li>\n
      8. Massively Parallel Mixed-Integer Programming: Algorithms and Applications<\/a>, with William E.Hart<\/a> and Cynthia A. Phillips<\/a>.\u00a0 In Parallel Processing for Scientific Computing<\/em><\/a>, M.A. Heroux, P. Raghavan, and H.D. Simon, editors, SIAM Books<\/a>, November 2006.<\/li>\n
      9. Parallel Computing<\/a>, Encyclopedia of Operations Research and Management Science<\/em><\/a>, S. I. Gass and C. M. Harris, eds., Kluwer Academic, Boston, 483-485 (1996). Revised for second edition (2001).<\/li>\n
      10. Parallel Computing in Network Optimization<\/a>, with Dimitri P. Bertsekas<\/a> (first author), David Casta\u00f1on<\/a>, and Stavros A. Zenios<\/a>. \u00a0Network Models<\/em><\/a>, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds., Handbooks in Operations Research and Management Science<\/em><\/a> 7, Elsevier Scientific, Amsterdam, 331-399 (1995).<\/li>\n
      11. Parallel Branch-and-Bound Methods for Mixed Integer Programming<\/a>.\u00a0 SIAM News<\/em><\/a> 27(1):1,12-15 (1994). Available in revised form as Chapter 13 of the collection Applications on Advanced Architecture Computers<\/em><\/a>, Greg Astfalk, editor, SIAM Books<\/a>, 1996.<\/li>\n
      12. Large-Scale Parallel Computing, Optimization, and Operations Research: A Survey ORSA Computer Science Technical Section Newsletter<\/em> 14(2), 1, 8-12, 25-28 (1993).<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"

        Google Scholar citations Note: This list is fairly comprehensive but not completely exhaustive. I am the first or sole author unless otherwise indicated. Textbook Introductory Relational Database Design for Business, … Read More<\/a><\/p>\n","protected":false},"author":21,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"footnotes":""},"class_list":["post-363","page","type-page","status-publish","hentry"],"acf":[],"yoast_head":"\nPublications - Jonathan Eckstein<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Publications - Jonathan Eckstein\" \/>\n<meta property=\"og:description\" content=\"Google Scholar citations Note: This list is fairly comprehensive but not completely exhaustive. I am the first or sole author unless otherwise indicated. Textbook Introductory Relational Database Design for Business, … Read More\" \/>\n<meta property=\"og:url\" content=\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/\" \/>\n<meta property=\"og:site_name\" content=\"Jonathan Eckstein\" \/>\n<meta property=\"article:modified_time\" content=\"2025-10-27T20:37:06+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"8 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/\",\"url\":\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/\",\"name\":\"Publications - Jonathan Eckstein\",\"isPartOf\":{\"@id\":\"https:\/\/sites.rutgers.edu\/eckstein\/#website\"},\"datePublished\":\"2020-07-09T16:51:59+00:00\",\"dateModified\":\"2025-10-27T20:37:06+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/sites.rutgers.edu\/eckstein\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Publications\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/sites.rutgers.edu\/eckstein\/#website\",\"url\":\"https:\/\/sites.rutgers.edu\/eckstein\/\",\"name\":\"Jonathan Eckstein\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/sites.rutgers.edu\/eckstein\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Publications - Jonathan Eckstein","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","og_locale":"en_US","og_type":"article","og_title":"Publications - Jonathan Eckstein","og_description":"Google Scholar citations Note: This list is fairly comprehensive but not completely exhaustive. I am the first or sole author unless otherwise indicated. Textbook Introductory Relational Database Design for Business, … Read More","og_url":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","og_site_name":"Jonathan Eckstein","article_modified_time":"2025-10-27T20:37:06+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"8 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","url":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","name":"Publications - Jonathan Eckstein","isPartOf":{"@id":"https:\/\/sites.rutgers.edu\/eckstein\/#website"},"datePublished":"2020-07-09T16:51:59+00:00","dateModified":"2025-10-27T20:37:06+00:00","breadcrumb":{"@id":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/sites.rutgers.edu\/eckstein\/publications\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/sites.rutgers.edu\/eckstein\/"},{"@type":"ListItem","position":2,"name":"Publications"}]},{"@type":"WebSite","@id":"https:\/\/sites.rutgers.edu\/eckstein\/#website","url":"https:\/\/sites.rutgers.edu\/eckstein\/","name":"Jonathan Eckstein","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/sites.rutgers.edu\/eckstein\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/pages\/363"}],"collection":[{"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/users\/21"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/comments?post=363"}],"version-history":[{"count":120,"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/pages\/363\/revisions"}],"predecessor-version":[{"id":599,"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/pages\/363\/revisions\/599"}],"wp:attachment":[{"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/media?parent=363"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}