{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:22:12Z","timestamp":1769577732143,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11075-022-01384-x","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T03:38:26Z","timestamp":1660707506000},"page":"2219-2242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7677-9271","authenticated-orcid":false,"given":"Dimitri","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ba\u0306\u0300ng C\u00f4ng","family":"V\u0169","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,17]]},"reference":[{"issue":"1","key":"1384_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming, Series A 87(1), 131\u2013152 (2000)","journal-title":"Mathematical Programming, Series A"},{"issue":"1","key":"1384_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1287\/opre.41.1.203","volume":"41","author":"JR Birge","year":"1993","unstructured":"Birge, J.R., Ho, J.K.: Optimal flows in stochastic dynamic networks with congestion. Oper. Res. 41(1), 203\u2013216 (1993)","journal-title":"Oper. Res."},{"issue":"4","key":"1384_CR3","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1287\/moor.2017.0900","volume":"43","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Nonconvex lagrangian-based optimization: monitoring schemes and global convergence. Math. Oper. Res. 43(4), 1210\u20131232 (2018)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1384_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning 3(1), 1\u2013122 (2010)","journal-title":"Foundations and Trends in Machine Learning"},{"key":"1384_CR5","unstructured":"Burke, J.V., Engle, A.: Line search and trust-region methods for convex-composite optimization, arXiv preprint, arXiv:1806.05218 (2018)"},{"issue":"1","key":"1384_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.35.1.58","volume":"35","author":"M Carey","year":"1987","unstructured":"Carey, M.: Optimal time varying flows on congested networks. Oper. Res. 35(1), 58\u201369 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"1384_CR7","first-page":"324","volume":"193","author":"E Cohen","year":"2021","unstructured":"Cohen, E., Hallak, N., Teboulle, M.: A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints. Journal of Optimization Theory and Applications 193(1), 324\u2013353 (2021)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"1384_CR8","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.jmaa.2011.02.079","volume":"380","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Dung, D., Vu, B.C.: Proximity for sums of composite functions. Journal of Mathematical Analysis and Applications 380(2), 680\u2013688 (2011)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"2","key":"1384_CR9","first-page":"243","volume":"135","author":"R Dacey","year":"2003","unstructured":"Dacey, R.: The S-shaped utility function. Decision Theory 135(2), 243\u2013272 (2003)","journal-title":"Decision Theory"},{"key":"1384_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Computers and Mathematics with Applications 2, 17\u201340 (1976)","journal-title":"Computers and Mathematics with Applications"},{"key":"1384_CR11","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par penalisation-dualit\u00e9, d\u2019une classe de problemes de Dirichlet non lin\u00e9aires. Revue Francaise d\u2019Automatique, Informatique, et Recherche Operationelle 9, 41\u201376 (1975)","journal-title":"Revue Francaise d\u2019Automatique, Informatique, et Recherche Operationelle"},{"key":"1384_CR12","unstructured":"Hearn, D.W.: Bounding flows in traffic assignment models. Research Report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida (1980)"},{"issue":"5","key":"1384_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. Journal of Optimization Theory and Applications 4(5), 303\u2013320 (1969)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4","key":"1384_CR14","first-page":"73","volume":"39","author":"AY Khintchine","year":"1932","unstructured":"Khintchine, A.Y.: Mathematical theory of a stationary queue. Matematicheskii Sbornik 39(4), 73\u201384 (1932)","journal-title":"Matematicheskii Sbornik"},{"key":"1384_CR15","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/0191-2615(95)00016-7","volume":"29","author":"T Larsson","year":"1995","unstructured":"Larsson, T., Patriksson, M.: An augmented Lagrangian dual algorithm link capacity side constrained traffic assignment problems. Transportation Research Part B: Methodological 29, 433\u2013455 (1995)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1\u20132","key":"1384_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Program. 158(1\u20132), 501\u2013546 (2016)","journal-title":"Math. Program."},{"key":"1384_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I - convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1384_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1287\/trsc.12.3.183","volume":"12","author":"DK Merchant","year":"1978","unstructured":"Merchant, D.K., Nemhauser, G.L.: A model and an algorithm for the dynamic traffic assignment problems. Trans. Sci. 12, 183\u2013199 (1978)","journal-title":"Trans. Sci."},{"key":"1384_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0191-2615(03)00010-9","volume":"38","author":"Y Nie","year":"2004","unstructured":"Nie, Y., Zhang, H.M., Lee, D.-H.: Models and algorithms for the traffic assignment problem with link capacity constraints. Transportation Research Part B: Methodological 38, 285\u2013312 (2004)","journal-title":"Transportation Research Part B: Methodological"},{"key":"1384_CR20","doi-asserted-by":"crossref","unstructured":"Orlowski, S., Wessaly, R., Pioro, M., Tomaszewski, A.: SNDlib 1.0 - Survivable network design library. Networks 55, 276-286 (2010)","DOI":"10.1002\/net.20371"},{"key":"1384_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1012827724856","volume":"1","author":"S Peeta","year":"2001","unstructured":"Peeta, S., Ziliaskopoulos, A.K.: Foundations of dynamic traffic assignment: The past, the present and the future. Networks and Spatial Economics 1, 233\u2013265 (2001)","journal-title":"Networks and Spatial Economics"},{"key":"1384_CR22","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF01194620","volume":"32","author":"F Pollaczek","year":"1930","unstructured":"Pollaczek, F.: Uber eine aufgabe der wahrscheinlichkeitstheorie. Mathematische Zeitschrift 32, 64\u2013100 (1930)","journal-title":"Mathematische Zeitschrift"},{"key":"1384_CR23","first-page":"283","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, New York (1969)"},{"issue":"3","key":"1384_CR24","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3(3), 411\u2013430 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1384_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization 2, 101\u2013112 (1992)","journal-title":"Journal of Global Optimization"},{"key":"1384_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics 52, 83\u2013106 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"1384_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer Academic Publishers, Dordrecht, Boston, London (1999)"},{"issue":"3","key":"1384_CR28","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Wang, H.: Global optimization of nonconvex factorable programming problems. Mathematical Programming, Series A 89(3), 459\u2013478 (2001)","journal-title":"Mathematical Programming, Series A"},{"key":"1384_CR29","doi-asserted-by":"crossref","unstructured":"Adams, W.P., Sherali, H.D.: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. In: Guignard, M., Spielberg, K. (Eds.) State-of-the-Art in Integer Programming, Annals of Operations Research, vol. 140, no. 1, pp. 21-47. (2005)","DOI":"10.1007\/s10479-005-3966-4"},{"key":"1384_CR30","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0312021","volume":"12","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM Journal of Control 12, 268\u2013285 (1974)","journal-title":"SIAM Journal of Control"},{"issue":"5","key":"1384_CR31","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/30\/5\/055012","volume":"30","author":"T Valkonen","year":"2014","unstructured":"Valkonen, T.: A primal-dual hybrid gradient method for nonlinear operators with applications to MRI. Inverse Problems 30(5), 055012 (2014)","journal-title":"Inverse Problems"},{"key":"1384_CR32","unstructured":"Vu, B.C., Papadimitriou, D.: A nonlinear ADMM for nonlinear composite problems. Under review (2021)"},{"key":"1384_CR33","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.trb.2018.03.011","volume":"111","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Szeto, W.Y., Han, K., Friesz, T.L.: Dynamic traffic assignment: A review of the methodological advances for environmentally sustainable road transportation applications. Transportation Research Part B: Methodological 111, 370\u2013394 (2018)","journal-title":"Transportation Research Part B: Methodological"},{"key":"1384_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. Journal of Scientific Computing 78, 29\u201363 (2019)","journal-title":"Journal of Scientific Computing"},{"issue":"1","key":"1384_CR35","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/trsc.34.1.37.12281","volume":"34","author":"AK Ziliaskopoulos","year":"2000","unstructured":"Ziliaskopoulos, A.K.: A linear programming model for the single destination system optimum dynamic traffic assignment problem. Trans. Sci. 34(1), 37\u201349 (2000)","journal-title":"Trans. Sci."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01384-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01384-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01384-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T09:18:11Z","timestamp":1679303891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01384-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,17]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1384"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01384-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,17]]},"assertion":[{"value":"7 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}