{"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":"2026-07-28T15:00:53","modified_gmt":"2026-07-28T15:00:53","slug":"publications","status":"publish","type":"page","link":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<h5><a href=\"https:\/\/scholar.google.com\/citations?user=vCYxzygAAAAJ&amp;hl=en&amp;oi=ao\">Google Scholar citations<\/a><\/h5>\n<p><strong><br \/>\nNote:<\/strong> This list is fairly comprehensive but not completely exhaustive. I am the first or sole author unless otherwise indicated.<\/p>\n<h3>Textbook<\/h3>\n<ol>\n<li><a href=\"https:\/\/www.amazon.com\/Introductory-Relational-Database-Business-Microsoft\/dp\/1119329418\">Introductory Relational Database Design for Business, with Microsoft Access<\/a>, with <a href=\"https:\/\/www.amazon.com\/Bonnie-R.-Schultz\/e\/B079329KMH\">Bonnie R. Schultz,<\/a> <a href=\"https:\/\/www.wiley.com\/en-us\">Wiley<\/a>, 2018 (<a href=\"http:\/\/bcs.wiley.com\/he-bcs\/Books?action=index&amp;itemId=1119329418&amp;bcsId=11139\">student companion website<\/a> and <a href=\"http:\/\/bcs.wiley.com\/he-bcs\/Books?action=index&amp;bcsId=11137&amp;itemId=1119329418\">instructor companion website<\/a> available from the publisher).<\/li>\n<\/ol>\n<h3>Peer-Reviewed Journal and Conference Proceeding Articles<\/h3>\n<ol>\n<li><a href=\"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/02331934.2026.2697343\">Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization<\/a>, with Chang Yu.\u00a0 <a href=\"https:\/\/www.tandfonline.com\/journals\/gopt20\">Optimization<\/a>, appeared online July 2026.<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/opre.2022.0228\">Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation<\/a>, with <a href=\"https:\/\/scholar.google.com\/citations?user=yhYHHhoAAAAJ&amp;hl=en\">Jean-Paul Watson<\/a> and <a href=\"https:\/\/gsm.ucdavis.edu\/faculty\/david-woodruff\">David L. Woodruff<\/a>. \u00a0<a href=\"https:\/\/pubsonline.informs.org\/journal\/opre\">Operations Research<\/a> 73(1):311-324 (2025).\u00a0 Earlier version available as <a href=\"http:\/\/www.optimization-online.org\/DB_HTML\/2018\/10\/6895.html\">Optimization Online working paper 2018-10-6895<\/a>.<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00528-6\">Stochastic Projective Splitting<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/proycejohnstone\/\">Patrick R. Johnstone<\/a> (first author). <a href=\"https:\/\/www.springer.com\/journal\/10589\"> <em>Computational Optimization and Applications<\/em><\/a>, 87(4):397-437 (2024).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01565-3\">Projective Splitting with Forward Steps<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/proycejohnstone\/\">Patrick R. Johnstone<\/a> (first author). <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em> Mathematical Programming<\/em><\/a> 191(2):631-670 (2022).<\/li>\n<li><a href=\"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00238-3\">Single-Forward-Step Projective Splitting: Exploiting Cocoercivity<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/proycejohnstone\/\">Patrick R. Johnstone<\/a> (first author). <a href=\"https:\/\/www.springer.com\/journal\/10589\"> <em>Computational Optimization and Applications<\/em><\/a>, 78(1):125-166 (2021).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01584-1\">Deriving Solution Value Bounds from the ADMM<\/a> <a href=\"https:\/\/link.springer.com\/journal\/11590\"><em>Optimization Letters<\/em><\/a> 14(6), 1289-1303 (2020).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10589-019-00165-y\">Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms<\/a>, with <a href=\"http:\/\/mtm.ufsc.br\/~maicon\/\">M. Marques Alves<\/a> (first author), <a href=\"https:\/\/www.facebook.com\/marina.geremia.5\/\">Marina Geremia<\/a>, and <a href=\"https:\/\/scholar.google.com\/citations?user=jq_ArKoAAAAJ&amp;hl=en\">Jefferson G. Melo<\/a>. \u00a0<a href=\"https:\/\/www.springer.com\/journal\/10589\"> <em>Computational Optimization and Applications<\/em><\/a>, 75(2):389-422 (2020).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007%2Fs11590-019-01509-7\">Projective Splitting with Forward Steps Only Requires Continuity<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/proycejohnstone\/\">Patrick R. Johnstone<\/a> (first author). <a href=\"https:\/\/link.springer.com\/journal\/11590\"><em>Optimization Letters<\/em><\/a> 14(1):229-247 (2020).<\/li>\n<li><a href=\"https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/18M1203523\">Convergence Rates for Projective Splitting<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/proycejohnstone\/\">Patrick R. Johnstone<\/a> (first author). <em><a href=\"https:\/\/www.siam.org\/Publications\/Journals\/SIAM-Journal-on-Optimization-SIOPT\">SIAM Journal on Optimization<\/a><\/em> 29(3):1931-1957 (2019).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoo.2019.0015\">REPR: Rule-Enhanced Penalized Regression<\/a>, with <a href=\"https:\/\/www.bnl.gov\/staff\/kagawa\">Ai Kagawa<\/a> and <a href=\"https:\/\/management.biu.ac.il\/en\/node\/1900\">Noam Goldberg<\/a>. <a href=\"https:\/\/pubsonline.informs.org\/journal\/ijoo\"><em>INFORMS Journal on Optimization<\/em><\/a> 1(2):143-163 (2019).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10107-017-1160-5\">Relative-Error Approximate Versions of Douglas-Rachford Splitting and Special Cases of the ADMM<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/wang-yao-2b158621\">Wang Yao<\/a>.\u00a0 <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em> Mathematical Programming<\/em><\/a>, 170(2):417-444 (2018).<\/li>\n<li><a href=\"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1044-0\">Asynchronous Block-Iterative Primal-Dual Decomposition Methods for Monotone Inclusions<\/a>, with <a href=\"https:\/\/math.sciences.ncsu.edu\/people\/pcombet\/\">Patrick L. Combettes<\/a> (first author). <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em>Mathematical Programming<\/em><\/a> 168(1-2):645-672 (2018).<\/li>\n<li><a href=\"https:\/\/icml.cc\/Conferences\/2017\/Schedule?showEvent=604\">Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement<\/a>, with <a href=\"https:\/\/management.biu.ac.il\/en\/node\/1900\">Noam Goldberg<\/a> and <a href=\"https:\/\/www.bnl.gov\/staff\/kagawa\">Ai Kagawa<\/a>. Proceedings of the <a href=\"https:\/\/icml.cc\/Conferences\/2017\">34th International Conference on Machine Learning (ICML 2017)<\/a>, appearing as Proceedings of Machine Learning Research 70:1059-1067 (2017).<\/li>\n<li><a href=\"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9911-z\">Approximate ADMM Algorithms Derived from Lagrangian Splitting<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/wang-yao-2b158621\">Wang Yao<\/a>.\u00a0 <a href=\"https:\/\/www.springer.com\/journal\/10589\"><em>Computational Optimization and Applications<\/em><\/a>, 68(2):363-405 (2017).<\/li>\n<li><a href=\"http:\/\/link.springer.com\/article\/10.1007\/s10957-017-1074-7\">A Simplified Form of Block-Iterative Operator Splitting, and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers<\/a>.\u00a0 <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10957\">Journal of Optimization Theory and Applications<\/a>, 173(1):155-182 (2017). Corrections to one of the proofs are in <a href=\"http:\/\/rdcu.be\/F1zA\">a &#8220;forum&#8221; note in the same journal<\/a>.<\/li>\n<li><a href=\"http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/ijoc.2015.0665\">Multilevel Optimization Modeling for Risk-Averse Stochastic Programming<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/deniz-eskandani\">Deniz Eskandani<\/a> and <a href=\"https:\/\/scholar.google.com\/citations?user=Mwje9C4AAAAJ&amp;hl=en\">Jingnan Fan<\/a>.\u00a0 <a href=\"http:\/\/joc.pubs.informs.org\/\"><em>INFORMS Journal on Computing<\/em><\/a>, 28(1):112-128 (2016), plus <a href=\"http:\/\/pubsonline.informs.org\/doi\/suppl\/10.1287\/ijoc.2015.0665\/suppl_file\/ijoc.2015.0665-sm.pdf\">online supplement<\/a>.<\/li>\n<li><a href=\"http:\/\/link.springer.com\/article\/10.1007\/s12532-015-0087-1\">PEBBL: An Object-Oriented Framework for Scalable Parallel Branch and Bound<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/william-e-hart-3691134\">William E. Hart<\/a> and <a href=\"https:\/\/www.sandia.gov\/ccr\/staff\/cynthia-ann-phillips\/\">Cynthia A. Phillips<\/a>.\u00a0 <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/12532\"> <em>Mathematical Programming Computation<\/em><\/a>, 7(4):429-429 (2015).<\/li>\n<li><a href=\"http:\/\/www.ybook.co.jp\/online2\/oppjo\/vol11\/p619.html\">Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/wang-yao-2b158621\">Wang Yao<\/a>.\u00a0 <a href=\"http:\/\/www.ybook.co.jp\/pjo.html\">Pacific Journal on Optimization<\/a>, 11(4):619-644 (2015). <a href=\"http:\/\/www.optimization-online.org\/DB_HTML\/2015\/06\/4954.html\">Expanded version<\/a> available at <a href=\"http:\/\/www.optimization-online.org\/\">Optimization Online<\/a>.<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10107-012-0528-9\">A Practical Relative Error Criterion for Augmented Lagrangians<\/a> with <a href=\"https:\/\/www.ime.unicamp.br\/~pjssilva\/\">Paulo J.S. Silva<\/a>.\u00a0 <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em>Mathematical Programming<\/em><\/a> 141(1):319-348 (2013).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.1110.0459\">An Improved Branch-and-Bound Method for Maximum Monomial Agreement<\/a> with <a href=\"https:\/\/management.biu.ac.il\/en\/node\/1900\">Noam Goldberg<\/a>. \u00a0<a href=\"http:\/\/joc.pubs.informs.org\/\"><em>INFORMS Journal on Computing<\/em><\/a>, 24(2):328-341 (2012).<\/li>\n<li><a href=\"http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019012000725\">Sparse Weighted Voting Classifier Selection and its LP Relaxations<\/a> with\u00a0<a href=\"https:\/\/management.biu.ac.il\/en\/node\/1900\">Noam Goldberg<\/a> (first author). <em><a href=\"https:\/\/www.sciencedirect.com\/journal\/information-processing-letters\">Information Processing Letters<\/a><\/em> 112:481-486 (2012)<\/li>\n<li><a href=\"http:\/\/www.stanford.edu\/~boyd\/papers\/pdf\/admm_distr_stats.pdf\">Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers<\/a> with <a href=\"http:\/\/www.stanford.edu\/~boyd\/\">Stephen Boyd<\/a> (first author), <a href=\"https:\/\/nparikh.org\/\">Neal Parikh<\/a>, <a href=\"https:\/\/scholar.google.com\/citations?user=3nQ-eq4AAAAJ&amp;hl=en\">Eric Chu<\/a>, and <a href=\"https:\/\/gts.tsc.uc3m.es\/wp-content\/uploads\/2022\/08\/Resume_BorjaPeleato.pdf\">Borja Peleato<\/a>. <a href=\"https:\/\/www.nowpublishers.com\/MAL\"><em>Foundations and Trends in Machine Learning<\/em><\/a>, 3(1):1-122 (2011).<\/li>\n<li><a href=\"http:\/\/www.icml2010.org\/papers\/23.pdf\">Boosting Classifiers with Tightened <em>L<\/em><sub>0<\/sub>-Relaxation Penalties<\/a>, with <a href=\"https:\/\/management.biu.ac.il\/en\/node\/1900\">Noam Goldberg<\/a>. <em>Proceedings of the the <a href=\"http:\/\/www.icml2010.org\/\">27<sup>th<\/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<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10589-009-9274-1\">Proximal Methods for Nonlinear Programming: Double Regularization and Inexact Subproblems<\/a>, with <a href=\"https:\/\/www.ime.unicamp.br\/~pjssilva\/\">Paulo J.S. Silva<\/a>. <a href=\"https:\/\/www.springer.com\/journal\/10589\"> <em>Computational Optimization and Applications<\/em><\/a>, 46(2):279-304 (2010).<\/li>\n<li><a href=\"http:\/\/dx.doi.org\/10.1137\/070698816\">General Projective Splitting Methods for Sums of Maximal Monotone Operators<\/a> with <a href=\"https:\/\/impa.br\/wp-content\/scriptLattes\/membro-6495240035306074.html\">B.F. Svaiter<\/a>, <a href=\"https:\/\/www.siam.org\/publications\/journals\/siam-journal-on-control-and-optimization-sicon\"><em>SIAM Journal on Control and Optimization<\/em><\/a>, 48(2):787-811 (2009).<\/li>\n<li><a href=\"http:\/\/opt2008.kyb.tuebingen.mpg.de\/papers\/eckstein.pdf\">An Improved Branch-and-Bound Method for Maximum Monomial Agreement<\/a> with <a href=\"https:\/\/management.biu.ac.il\/en\/node\/1900\">Noam Goldberg<\/a>. <a href=\"http:\/\/opt2008.kyb.tuebingen.mpg.de\/\">OPT 2008 Optimization for Machine Learning Workshop<\/a>, <a href=\"http:\/\/nips.cc\/Conferences\/2008\/\">Neural Information Processing Systems Workshop (NIPS08)<\/a>, December 2008.\u00a0 [Apology: the OPT 2008 sub-site does not seem to be operating]<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.1060.0207\">Optimal Information Monitoring under a Politeness Constraint<\/a> with <a href=\"https:\/\/dds.technion.ac.il\/academicstaff\/avigdor-gal\/\">Avigdor Gal<\/a>, and <a href=\"https:\/\/il.linkedin.com\/in\/sarit-reiner-frumkes-a5a171178\">Sarit Reiner<\/a>. <a href=\"http:\/\/joc.pubs.informs.org\/\"><em>INFORMS Journal on Computing<\/em><\/a> 20(1):3-20 (2008).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/opre.1070.0443\">Arrival Rate Approximation by Nonnegative Cubic Splines<\/a> with <a href=\"https:\/\/www.business.rutgers.edu\/faculty\/farid-alizadeh\">Farid Alizadeh<\/a> (first author), <a href=\"https:\/\/www.linkedin.com\/in\/nilaynoyan\">Nilay Noyan<\/a>, and <a href=\"https:\/\/gsse.ku.edu.tr\/en\/about-gsse\/faculty\/?detail=true&amp;id=grudolf\">Gabor Rudolf<\/a>. <em><a href=\"https:\/\/pubsonline.informs.org\/journal\/opre\">Operations Research<\/a><\/em>, 56(1):140-156 (2008).<\/li>\n<li><a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-006-0070-8\">A Family of Projective Splitting Methods for the Sum of Two Maximal Monotone Operators<\/a> with <a href=\"https:\/\/impa.br\/wp-content\/scriptLattes\/membro-6495240035306074.html\">B.F. Svaiter<\/a>. <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em>Mathematical Programming<\/em><\/a> 111(1-2):173-199 (2008).<\/li>\n<li><a href=\"http:\/\/dx.doi.org\/10.1007\/s10732-007-9021-7\">Pivot, Cut, and Dive: A Heuristic for Mixed 0-1 Integer Programming<\/a> with <a href=\"https:\/\/smith.queensu.ca\/faculty_and_research\/faculty_list\/mikhail_nediak.php\">Mikhail Nediak<\/a>. <em><a href=\"https:\/\/link.springer.com\/journal\/10732\"> Journal of Heuristics<\/a><\/em> 13(5):471-503 (2007).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10589-005-3065-0\">Double-Regularization Proximal Methods, with Complementarity Applications<\/a>, with <a href=\"https:\/\/www.ime.unicamp.br\/~pjssilva\/\">Paulo J.S. Silva<\/a> (first author). <a href=\"https:\/\/www.springer.com\/journal\/10589\"> <em>Computational Optimization and Applications<\/em><\/a> 33(2-3):115-156 (2006).<\/li>\n<li><a href=\"http:\/\/dx.doi.org\/10.1007\/s10479-005-3445-y\">Depth-Optimized Convexity Cuts<\/a> with <a href=\"https:\/\/smith.queensu.ca\/faculty_and_research\/faculty_list\/mikhail_nediak.php\">Mikhail Nediak<\/a>. <em><a href=\"https:\/\/link.springer.com\/journal\/10479\">Annals of Operations Research<\/a><\/em> 139:95-129 (2005)<\/li>\n<li><a href=\"https:\/\/www.tandfonline.com\/doi\/full\/10.1081\/SAP-120024703\">Scheduling of Data Transcription in Periodically Connected Databases<\/a> with <a href=\"http:\/\/iew3.technion.ac.il\/~avigal\/\">Avigdor Gal <\/a> (first author) and <a href=\"http:\/\/zachary.rutgers.edu\/\">Zachary Stoumbos<\/a>, <em><a href=\"https:\/\/www.tandfonline.com\/journals\/lsaa20\">Stochastic Analysis and Applications<\/a><\/em> 21(5):1021-1058 (2003).<\/li>\n<li><a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-003-0374-x\">A Practical General Approximation Criterion for Methods of Multipliers Based on Bregman Distances<\/a> <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em> Mathematical Programming<\/em><\/a> 96(1):61-86 (2003).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1023\/A:1020546910706\">The Maximum Box Problem and its Application to Data Analysis<\/a> with <a href=\"https:\/\/en.wikipedia.org\/wiki\/Peter_L._Hammer\">Peter L. Hammer<\/a>, Ying Liu, <a href=\"https:\/\/smith.queensu.ca\/faculty_and_research\/faculty_list\/mikhail_nediak.php\">Mikhail Nediak<\/a>, and <a href=\"https:\/\/www.linkedin.com\/pulse\/remembering-bruno-simeone-july-19-1945-october-10-2010-chiara-simeone\">Bruno Simeone<\/a>. <a href=\"https:\/\/www.springer.com\/journal\/10589\"> <em>Computational Optimization and Applications<\/em><\/a>, 23(3):285-298 (2002).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ited.2.2.12\">YASAI: Yet Another Add-In for Teaching Elementary Monte Carlo Simulation in EXCEL<\/a> with Steven T. Riedmueller. <a href=\"http:\/\/ite.informs.org\/\"><em>INFORMS Transactions on Education<\/em><\/a> 2(2):12-26 (2002).<\/li>\n<li><a href=\"http:\/\/portal.acm.org\/citation.cfm?doid=504794.504797\">Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach<\/a> with <a href=\"https:\/\/dds.technion.ac.il\/academicstaff\/avigdor-gal\/\">Avigdor Gal <\/a> (first author). <a href=\"http:\/\/www.acm.org\/jacm\/\"><em>Journal of the ACM<\/em><\/a>, 46(6):1141-1183 (2001).<\/li>\n<li>PICO: An Object-Oriented Framework for Parallel Branch and Bound with\u00a0<a href=\"https:\/\/www.sandia.gov\/ccr\/staff\/cynthia-ann-phillips\/\">Cynthia A. Phillips<\/a> and <a href=\"https:\/\/www.linkedin.com\/in\/william-e-hart-3691134\">William E. Hart<\/a>.\u00a0 <a href=\"https:\/\/shop.elsevier.com\/books\/inherently-parallel-algorithms-in-feasibility-and-optimization-and-their-applications\/butnariu\/978-0-444-50595-8\"><em>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<li><a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623499365784\">Rescaling and Stepsize Selection in Proximal Methods using Separable Generalized Distances<\/a> with\u00a0<a href=\"https:\/\/www.ime.unicamp.br\/~pjssilva\/\">Paulo J.S. Silva<\/a> (first author) and <a href=\"https:\/\/bv.fapesp.br\/en\/pesquisador\/87166\/carlos-humes-junior\/\">Carlos Humes Jr.<\/a>. <a href=\"https:\/\/www.siam.org\/publications\/journals\/siam-journal-on-optimization-siopt\"> <em>SIAM Journal on Optimization<\/em><\/a>, 12(1):238-261 (2001).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s101079900076\">Smooth Methods of Multipliers for Monotone Complementarity Problems<\/a> with <a href=\"https:\/\/pages.cs.wisc.edu\/~ferris\/\">Michael C. Ferris<\/a>. <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em>Mathematical Programming<\/em><\/a>, 86(1):65-90 (1999).<\/li>\n<li><a href=\"http:\/\/link.springer.com\/article\/10.1007%2FBF02680553\">Approximate Iterations in Bregman-Function-Based Proximal Algorithms<\/a> <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em> Mathematical Programming<\/em><\/a>, 83(1) 113-123 (1998).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.10.2.218\">Operator Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control<\/a>, with <a href=\"https:\/\/pages.cs.wisc.edu\/~ferris\/\">Michael C. Ferris<\/a>. \u00a0<a href=\"http:\/\/joc.pubs.informs.org\/\"><em>INFORMS Journal on Computing<\/em><\/a>, 10(2):218-235 (1998).<\/li>\n<li>Resource Management in a Parallel Mixed Integer Programming Package, with <a href=\"https:\/\/www.linkedin.com\/in\/william-e-hart-3691134\">William E. Hart<\/a> and <a href=\"https:\/\/www.sandia.gov\/ccr\/staff\/cynthia-ann-phillips\/\">Cynthia A. Phillips<\/a>. \u00a0 Proceedings of the Intel Supercomputer Users Group Conference, Albuquerque, NM, June 11-13, 1997.<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/ijoc.9.1.15\">How Much Communication Does Parallel Branch and Bound Need?<\/a> <a href=\"http:\/\/joc.pubs.informs.org\/\"><em>INFORMS Journal on Computing<\/em><\/a>, 9(1):15-29 (1997).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1023\/A:1008699010646\">Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5<\/a>. <a href=\"https:\/\/www.springer.com\/journal\/10589\"><em>Computational Optimization and Applications<\/em><\/a>, 7(2):199-220 (1997).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.7.4.402\">Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2<\/a>, with <a href=\"https:\/\/tr.linkedin.com\/in\/ilkayboduroglu\">I. Ilkay Boduroglu<\/a>, Lazaros Polymenakos, and <a href=\"https:\/\/www.engineering.columbia.edu\/faculty\/donald-goldfarb\">Donald Goldfarb<\/a>. <a href=\"http:\/\/joc.pubs.informs.org\/\"> <em>ORSA Journal on Computing<\/em><\/a> 7(4):402-416 (1995).<\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/344264\">Control Strategies for Parallel Mixed Integer Branch and Bound<\/a>. <a href=\"https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/1005\/proceeding\"><em>Supercomputing &#8217;94:Proceedings of the 1994 ACM\/IEEE Conference on Supercomputing<\/em><\/a>, IEEE Computer Society Press, Los Alamitos, CA, 41-48 (1994).<\/li>\n<li><a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/0804046\">Parallel Branch-and-Bound Methods for Mixed-Integer Programming on the CM-5<\/a>.\u00a0 <em><a href=\"https:\/\/www.siam.org\/Publications\/Journals\/SIAM-Journal-on-Optimization-SIOPT\">SIAM Journal on Optimization\u00a0<\/a><\/em> 4(4):794-814 (1994).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4613-3632-7_7\">Some Reformulations and Applications of the Alternating Direction Method of Multipliers<\/a>, with <a href=\"https:\/\/www.kcg.edu\/en\/faculty\/professor\/m-fukushima\">Masao Fukushima<\/a>. In <a href=\"https:\/\/link.springer.com\/book\/10.1007\/978-1-4613-3632-7\"><em>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<li><a href=\"https:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10556789408805578\">Some Saddle-Function Splitting Methods for Convex Programming<\/a>. <em><a href=\"https:\/\/www.tandfonline.com\/journals\/goms20\"> Optimization Methods and Software<\/a><\/em> 4(1):75-83 (1994).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/BF02196592\">Parallel Alternating Direction Multiplier Decomposition of Convex Programs<\/a>. <em><a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10957\">Journal of Optimization Theory and Applications<\/a><\/em> 80(1):39-62 (1994).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/mnsc.39.11.1422\">Stochastic Dedication: Designing Fixed-Income Portfolios using Massively Parallel Benders Decomposition<\/a>, with Randall S. Hiller (first author). <a href=\"http:\/\/mansci.pubs.informs.org\/\"><em>Management Science<\/em><\/a> 39(11):1422-1438 (1993).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/ijoc.5.1.84\">The Alternating Step Method for Monotropic Programming on the Connection Machine 2<\/a>.\u00a0 <a href=\"http:\/\/joc.pubs.informs.org\/\"> <em>ORSA Journal on Computing<\/em><\/a> 5(1):84-96 (1993).<\/li>\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/moor.18.1.202\">Nonlinear Proximal Point Algorithms using Bregman Functions, with Applications to Convex Programming<\/a>.\u00a0 <a href=\"https:\/\/pubsonline.informs.org\/journal\/moor\"> <em>Mathematics of Operations Research<\/em><\/a> 18(1):202-226 (1993).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/BF01581204\">On the Douglas-Rachford Splitting Method and the Proximal Point Algorithm for Maximal Monotone Operators,<\/a> with <a href=\"https:\/\/www.mit.edu\/~dimitrib\/home.html\">Dimitri P. Bertsekas<\/a>. <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em> Mathematical Programming<\/em><\/a> 55(3):293-318 (1992).<\/li>\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/BF01589405\">Dual Coordinate Step Methods for Linear Network Flow Problems<\/a>, with <a href=\"https:\/\/www.mit.edu\/~dimitrib\/home.html\">Dimitri P. Bertsekas<\/a> (first author).\u00a0 <a href=\"http:\/\/www.springer.com\/mathematics\/journal\/10107\"><em>Mathematical Programming<\/em><\/a> 42(2):203-243 (1988).<\/li>\n<li><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1474667017551356\">Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems<\/a> with <a href=\"https:\/\/www.mit.edu\/~dimitrib\/home.html\">Dimitri P. Bertsekas<\/a> (first author). \u00a0 <a href=\"https:\/\/www.sciencedirect.com\/journal\/ifac-proceedings-volumes\/vol\/20\/issue\/5\/part\/P7\"><em>Proceedings of the International Federation of Automatic Control<\/em> <\/a>(IFAC) 20(issue 5, part 7):103-114 (1987).<\/li>\n<li>Optimization of Group Line-Haul Operations for Motor Carriers Using Twin Trailers, with <a href=\"https:\/\/sheffi.mit.edu\/\">Yosef Sheffi<\/a>. <a href=\"https:\/\/journals.sagepub.com\/home\/trr\"><em>Transportation Research Record<\/em><\/a> 1120:12-23 (1987).<\/li>\n<\/ol>\n<h3>Doctoral Dissertation<\/h3>\n<p><a href=\"https:\/\/rutgers.box.com\/s\/w8jy2pzufr5xjhp351g7mpr0omjlrnqw\">Splitting Methods for Monotone Operators, with Applications to Parallel Optimization<\/a>, MIT, 1989.<\/p>\n<h3>Non-Refereed Book Chapters, Selected Technical Reports, Selected Preprints, and Other Publications<\/h3>\n<p>Also see <a href=\"https:\/\/sites.rutgers.edu\/eckstein\/resources\/\">Open-Source Software<\/a> for software documentation.\u00a0 The list below includes some preprints and technical reports that overlap substantially with refereed publications, but contain more details or are organized differently.\u00a0 \u00a0Preprints and technical reports that are essentially identical to the journal or conference publications listed above are not shown.<\/p>\n<ol>\n<li><a href=\"https:\/\/arxiv.org\/abs\/2607.24535\">Using Subproblem Objective Gaps in Inexact Augmented Lagrangian and ADMM Algorithms, with Applications to Stochastic Mixed Integer Programming<\/a>, ArXiv preprint 2607.24535, July 2026.<\/li>\n<li><a href=\"https:\/\/optimization-online.org\/2021\/12\/8725\/\">A Covering Decomposition Algorithm for Power Grid Cyber-Network Segmentation<\/a>, with <a href=\"https:\/\/www.sandia.gov\/research\/publications\/search\/?per-page=50&amp;authors%5B%5D=emma-johnson\">Emma S. Johnson<\/a> (first author), <a href=\"https:\/\/www2.isye.gatech.edu\/~sdey30\/\">Santanu S. Dey<\/a>, <a href=\"https:\/\/www.sandia.gov\/ccr\/staff\/cynthia-ann-phillips\/\">Cynthia A. Phillips<\/a>, and <a href=\"https:\/\/www.sandia.gov\/ccr\/staff\/john-daniel-siirola\/\"> John D. Siirola<\/a> Optimization Online preprint 2021-12-8725, December 2021.<\/li>\n<li><a href=\"https:\/\/optimization-online.org\/2018\/03\/6533\/\">Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/proycejohnstone\/\">Patrick R. Johnstone<\/a> (first author) Optimization Online working paper 2018-03-6533 and <a href=\"https:\/\/arxiv.org\/abs\/1803.07043\">ArXiv preprint 1803.07043<\/a>, March 2018.<\/li>\n<li><a href=\"https:\/\/optimization-online.org\/2016\/01\/5276\/\">Approximate Versions of the Alternating Direction Method of Multipliers<\/a>, with <a href=\"https:\/\/sites.google.com\/site\/yaowang74\/home\/about-me\">Wang Yao<\/a>.\u00a0 Optimization Online working paper 2016-01-5276, January 2016.<\/li>\n<li><a href=\"https:\/\/optimization-online.org\/2015\/05\/4935\/\">A Bundle Method for Exploiting Additive Structure in Difficult Optimization Problems<\/a>, with <a href=\"http:\/\/www.oliveira.mat.br\/\">Welington de Oliveira<\/a> (first author) Optimization Online working paper 2015-05-4935, May 2015.<\/li>\n<li><a href=\"http:\/\/www.optimization-online.org\/DB_HTML\/2015\/01\/4748.html\">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<li><a href=\"https:\/\/optimization-online.org\/2015\/06\/4954\/\">Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/wang-yao-2b158621\">Wang Yao<\/a>.\u00a0 Optimization Online working paper 2015-06-4954, June\/October 2015.<\/li>\n<li><a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9780898718133.ch17\">Massively Parallel Mixed-Integer Programming: Algorithms and Applications<\/a>, with <a href=\"https:\/\/www.linkedin.com\/in\/william-e-hart-3691134\">William E.Hart<\/a> and <a href=\"https:\/\/www.sandia.gov\/ccr\/staff\/cynthia-ann-phillips\/\">Cynthia A. Phillips<\/a>.\u00a0 In <a href=\"https:\/\/epubs.siam.org\/doi\/book\/10.1137\/1.9780898718133\"><em>Parallel Processing for Scientific Computing<\/em><\/a>, M.A. Heroux, P. Raghavan, and H.D. Simon, editors, <a href=\"http:\/\/www.siam.org\/books\/\">SIAM Books<\/a>, November 2006.<\/li>\n<li><a href=\"https:\/\/link.springer.com\/referenceworkentry\/10.1007\/978-1-4419-1153-7_728\">Parallel Computing<\/a>, <a href=\"https:\/\/link.springer.com\/referencework\/10.1007\/978-1-4419-1153-7\"> <em>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<li><a href=\"https:\/\/pdf.sciencedirectassets.com\/273390\/1-s2.0-S0927050705X01177\/1-s2.0-S0927050705801227\/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEEYaCXVzLWVhc3QtMSJGMEQCIGbQMYlTVCQfTes14PxXk2uHs7YGKdXc5hTZhC%2BxScMIAiAuOGU%2BXNAvEfmWeKYPmnb7KZtuCuRHATYYQy3tB9dz0SqzBQhPEAUaDDA1OTAwMzU0Njg2NSIMTgfaS8LO9F4OfK5zKpAFy2fSdP256PsyGE1Dxl7fI2Ae9tKwu490vPLhc69WNSq8pEx3kq%2FgSwKsWjllGYzUXAlNWN1U8hwAGVIIsC6XmA6%2BiPn2LW6MJEPshsblns6DJStvsFQmO7jcDMFmVBbTvNERHb4IegpSvUvRG4a5%2BCYIF%2FGej%2BD%2FmRjvTTBc8NS5gFaNz7ssA%2FdE5mp1Fu0nw7%2FUkeDuQIdppG%2BRaHrgW4hFl7tA3FKu3gil1YwYwpXML1mGhYE5YZP3GYJIXWlVoGiJWf7cBbstdviBqUvmeh64HxT01zXCiqVmiQccEhhXHyVscaEVAD3bhjF1yzyJDwrADohHruiHZRX5O6E0%2F1aJP9yV20a%2BIOpiNELbsTLovaY9cTwPF3OQ%2BwlGxfYPLaaG1iT2ZOZjhbizug0po%2BWbxN4AAJnX5EirQJPzpnZcwGFzvmxXxUAyQaY%2Fhp7Yv368DBFJgqC2ucaIof19zT1Ud15%2Fht%2FUUzzT3%2FlCVFHG66%2BacV1Od6KkSbydUHgU8rS78ZWe2WtDElPPINIjls4IVnBqKF3JBAyPvL%2BHZGsyfLAh%2Fct3Fd2t425ulbH%2F9FHYI83eciLMbaZvV0mBezhAWef9pxz76jhfiMHsb2Q2eAQzizldeVqvdrC38I4Vo0GyP%2Bm4gR5vUFsxLi1lSpThqtKNn%2Fzlaew9IIZt8CcyCIWdD9cOVpXw%2BkdOGJCOaNUhR4Pcrk9H1VI%2FE0HdYK7Itl7Q5YeoJIcDrShOs9YKn5LGanRmuyNiKIbP7D%2FJUZyiIhRVv%2FWpiWBcjBxWjTvksFqMxYeEkgvZNUKakpNM4Ff10qUOzhTY8T0r9x6o7pjI6LNjtKz7or1IswDzc0bkjfcUehNsAoG41wZPDxIw0JjDrwY6sgG0ROhOKejJXlmwOAzWgTr0k0Zbmb8%2F0%2BSwEbT777RH5GEEgFHhOCg1jbioXvLxptWWCkRkQi84QmGdv65IxKjIOFR1JBLr0Kcon7Q6dPGvGp91rJxI%2B38w3r8Izt3WJ%2FzrPEKeTnGw7dUfs3dflIzlqqGNSTQwnXv849WNzpBqsXD%2FoS%2Bxw55MhcZZ0ugMmRKSOwVEZTjHleijhMwutZZahGd7zLKbvJK%2BbiTmjMDRIXqG&amp;X-Amz-Algorithm=AWS4-HMAC-SHA256&amp;X-Amz-Date=20240312T225946Z&amp;X-Amz-SignedHeaders=host&amp;X-Amz-Expires=300&amp;X-Amz-Credential=ASIAQ3PHCVTY44PNTG4Z%2F20240312%2Fus-east-1%2Fs3%2Faws4_request&amp;X-Amz-Signature=a3be30add260702cef51cd8f0b0976034db5bd89d1a11777b684e1188e1143dc&amp;hash=242a2bbb5ce2624203f68c0de566cffc683cae243b3600f58c3a792a2a653df4&amp;host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&amp;pii=S0927050705801227&amp;tid=spdf-332504ac-58b6-495a-9bf7-a5060372e2df&amp;sid=a29ebc085213114c8c3813539f0413c625abgxrqa&amp;type=client&amp;tsoh=d3d3LnNjaWVuY2VkaXJlY3QuY29t&amp;ua=0f115c58575954505b52&amp;rr=863765847c408cd4&amp;cc=us\">Parallel Computing in Network Optimization<\/a>, with <a href=\"http:\/\/web.mit.edu\/dimitrib\/www\/home.html\">Dimitri P. Bertsekas<\/a> (first author), <a href=\"https:\/\/www.bu.edu\/eng\/profile\/david-castanon\/\">David Casta\u00f1on<\/a>, and <a href=\"https:\/\/www.ucy.ac.cy\/directory\/en\/profile\/zenioss\">Stavros A. Zenios<\/a>. \u00a0<a href=\"https:\/\/www.sciencedirect.com\/handbook\/handbooks-in-operations-research-and-management-science\/vol\/7\/suppl\/C\"><em>Network Models<\/em><\/a>, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds., <a href=\"https:\/\/www.sciencedirect.com\/handbook\/handbooks-in-operations-research-and-management-science\"><em>Handbooks in Operations Research and Management Science<\/em><\/a> 7, Elsevier Scientific, Amsterdam, 331-399 (1995).<\/li>\n<li><a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9780898719659.ch13\">Parallel Branch-and-Bound Methods for Mixed Integer Programming<\/a>.\u00a0 <a href=\"https:\/\/www.siam.org\/publications\/siam-news\"><em>SIAM News<\/em><\/a> 27(1):1,12-15 (1994). Available in revised form as Chapter 13 of the collection <a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9780898719659\"><em> Applications on Advanced Architecture Computers<\/em><\/a>, Greg Astfalk, editor, <a href=\"http:\/\/www.siam.org\/books\/\">SIAM Books<\/a>, 1996.<\/li>\n<li>Large-Scale Parallel Computing, Optimization, and Operations Research: A Survey <em>ORSA Computer Science Technical Section Newsletter<\/em> 14(2), 1, 8-12, 25-28 (1993).<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>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, &hellip; <a href=\"https:\/\/sites.rutgers.edu\/eckstein\/publications\/\" class=\"\">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":"<!-- This site is optimized with the Yoast SEO plugin v23.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Publications - 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, &hellip; 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=\"2026-07-28T15:00:53+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\":\"2026-07-28T15:00:53+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, &hellip; Read More","og_url":"https:\/\/sites.rutgers.edu\/eckstein\/publications\/","og_site_name":"Jonathan Eckstein","article_modified_time":"2026-07-28T15:00:53+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":"2026-07-28T15:00:53+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":124,"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/pages\/363\/revisions"}],"predecessor-version":[{"id":604,"href":"https:\/\/sites.rutgers.edu\/eckstein\/wp-json\/wp\/v2\/pages\/363\/revisions\/604"}],"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}]}}