{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T19:18:49Z","timestamp":1792264729038,"version":"4.4.0"},"reference-count":38,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["ARC DP140100985"],"award-info":[{"award-number":["ARC DP140100985"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["ARC DP140100985"],"award-info":[{"award-number":["ARC DP140100985"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1634597"],"award-info":[{"award-number":["1634597"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We present a new primal-dual algorithm for computing the value of the Lagrangian dual of a stochastic mixed-integer program (SMIP) formed by relaxing its nonanticipativity constraints. This dual is widely used in decomposition methods for the solution of SMIPs. The algorithm relies on the well-known progressive hedging method, but unlike previous progressive hedging approaches for SMIP, our algorithm can be shown to converge to the optimal Lagrangian dual value. The key improvement in the new algorithm is an inner loop of optimized linearization steps, similar to those taken in the classical Frank--Wolfe method. Numerical results demonstrate that our new algorithm empirically outperforms the standard implementation of progressive hedging for obtaining bounds in SMIP.<\/jats:p>","DOI":"10.1137\/16m1076290","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T11:53:02Z","timestamp":1525780382000},"page":"1312-1336","source":"Crossref","is-referenced-by-count":60,"title":["Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming"],"prefix":"10.1137","volume":"28","author":[{"given":"Natashia","family":"Boland","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey","family":"Christiansen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian","family":"Dandurand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Eberhard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabricio","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"atypb1","unstructured":"http:\/\/www.nci.org.au. Last accessed 20 April, 2016."},{"key":"atypb2","unstructured":"http:\/\/www2.isye.gatech.edu\/ sahmed\/siplib\/sslp\/sslp.html. Last accessed 23 December, 2015."},{"key":"atypb3","unstructured":"COmputational INfrastructure for Operations Research\n                      ,http:\/\/www.coin-or.org\/. Last accessed 28 January, 2016."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.12.032"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000004773.66339.df"},{"key":"atypb6","first-page":"259","volume":"232","author":"Veliz F. Badilla","year":"2015","journal-title":"Ann. Oper. Res."},{"key":"atypb7","unstructured":"M. Bodur, S. Dash, O. Gu\u0308nlu\u0308k, and J. Luedtke,\n                      Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse\n                      , preprint,http:\/\/www.optimization-online.org\/DB_FILE\/2014\/03\/4263.pdf, 2014."},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein,\n                      Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers\n                      , Foundations and Trends in Machine Learning, Vol. 3, Issue 1, Now Publishers, Hanover, MA, 2011,http:\/\/dx.doi.org\/10.1561\/2200000016.","DOI":"10.1561\/2200000016"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00050-9"},{"key":"atypb10","unstructured":"J. Chen, C. H. Lim, P. Qian, J. Linderoth, and S. J. Wright,\n                      Validating Sample Average Approximation Solutions with Negatively Dependent Batches\n                      , preprint,http:\/\/arxiv.org\/abs\/1404.7208, 2014."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/060657418"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1000-z"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580219"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499363220"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.3.161"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00247208"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02027380"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.02.003"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00054-6"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"G. Nemhauser and L. Wolsey,\n                      Integer and combinatorial optimization\n                      , Wiley-Intersci. Ser. Discrete Math. Optim., Wiley-Interscience, New York, 1988.","DOI":"10.1002\/9781118627372"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019248506301"},{"key":"atypb27","unstructured":"L. Ntaimo,\n                      Decomposition Algorithms for Stochastic Combinatorial Optimization: Computational Experiments and Extensions\n                      , Ph.D. thesis, University of Arizona, AZ, 2004."},{"key":"atypb28","first-page":"987","volume":"42","author":"Ntaimo L.","year":"2012","journal-title":"J. For. Res."},{"key":"atypb29","first-page":"385","volume":"32","author":"Ntaimo L.","journal-title":"for stochastic combinatorial optimization, J. Global Optim."},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0988"},{"key":"atypb31","unstructured":"M. J. D. Powell,\n                      A method for nonlinear constraints in minimization problems\n                      , in Optimization, R. Fletcher, ed., Academic Press, New York, 1969."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.1.119"},{"key":"atypb33","unstructured":"A. Ruszczyn\u0301ski,\n                      Nonlinear Optimization\n                      , Princeton University Press, Princeton, NJ, 2006."},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.5711\/morj.14.2.19"},{"key":"atypb35","doi-asserted-by":"crossref","unstructured":"N. Shor,\n                      Minimization Methods for Non-Differentiable Functions\n                      , Springer-Verlag, New York, 1985.","DOI":"10.1007\/978-3-642-82118-9"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1109\/59.535691"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/j.mbs.2008.07.006"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584323"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1007\/s10287-010-0125-4"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1076290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:03:15Z","timestamp":1787338995000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1076290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1076290"],"URL":"https:\/\/doi.org\/10.1137\/16m1076290","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}