{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:41:25Z","timestamp":1757544085379,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["DMS-1619884"],"award-info":[{"award-number":["DMS-1619884"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2088"],"award-info":[{"award-number":["N00014-20-1-2088"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10957-020-01680-3","type":"journal-article","created":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T17:04:17Z","timestamp":1589821457000},"page":"903-926","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles"],"prefix":"10.1007","volume":"185","author":[{"given":"Deyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-2579","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,18]]},"reference":[{"key":"1680_CR1","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D Bertsekas","year":"1989","unstructured":"Bertsekas, D., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, New York (1989)"},{"issue":"5","key":"1680_CR2","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1287\/opre.33.5.989","volume":"33","author":"J Birge","year":"1985","unstructured":"Birge, J.: Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs. Oper. Res. 33(5), 989\u20131007 (1985)","journal-title":"Oper. Res."},{"key":"1680_CR3","volume-title":"Decomposition Techniques in Mathematical Programming: Engineering and Science Applications","author":"A Connejo","year":"2006","unstructured":"Connejo, A., M\u00ednguez, R., Castillo, E., Garc\u00eda-Bertrand, R.: Decomposition Techniques in Mathematical Programming: Engineering and Science Applications. Springer, New York (2006)"},{"issue":"8","key":"1680_CR4","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1109\/JSAC.2006.879350","volume":"24","author":"D Palomar","year":"2006","unstructured":"Palomar, D., Chiang, M.: A tutorial on decomposition methods for network utility maximization. IEEE J. Sel. Areas Commun. 24(8), 1439\u20131451 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1680_CR5","unstructured":"Kojima, M., Megiddo, N., Mizuno, S., Shindoh, S.: Horizontal and vertical decomposition in interior point methods for linear programs. Technical report, Information Sciences, Tokyo Institute of Technology, Tokyo (1993)"},{"key":"1680_CR6","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S1052623401387349","volume":"12","author":"M Fukuda","year":"2002","unstructured":"Fukuda, M., Kojima, M., Shida, M.: Lagrangian dual interior-point methods for semidefinite programs. SIAM J. Optim. 12, 1007\u20131031 (2002)","journal-title":"SIAM J. Optim."},{"key":"1680_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-003-0471-x","volume":"102","author":"G Zhao","year":"2005","unstructured":"Zhao, G.: A Lagrangian dual method with self-concordant barriers for multistage stochastic convex programming. Math. Program. 102, 1\u201324 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"1680_CR8","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10957-009-9566-8","volume":"143","author":"I Necoara","year":"2009","unstructured":"Necoara, I., Suykens, J.: Interior-point Lagrangian decomposition method for separable convex optimization. J. Optim. Theory and Appl. 143(3), 567\u2013588 (2009)","journal-title":"J. Optim. Theory and Appl."},{"issue":"1","key":"1680_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/11085311X","volume":"23","author":"Q Tran-Dinh","year":"2013","unstructured":"Tran-Dinh, Q., Necoara, I., Savorgnan, C., Diehl, M.: An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization. SIAM J. Optim. 23(1), 95\u2013125 (2013)","journal-title":"SIAM J. Optim."},{"key":"1680_CR10","unstructured":"Bitlislioglu, A., Pejcic, I., Jones, C.: Interior-point decomposition for multi-agent optimization. In: 20th IFAC World Congress, EPFL-CONF-228343 (2017)"},{"key":"1680_CR11","first-page":"569","volume":"50","author":"M Fukuda","year":"2000","unstructured":"Fukuda, M., Kojima, M.: Interior-point methods for Lagrangian duals of semidefinite programs. Inst. Technol. 50, 569 (2000)","journal-title":"Inst. Technol."},{"issue":"3","key":"1680_CR12","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1023\/A:1023065319772","volume":"116","author":"BV Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, B.V., T\u00fct\u00fcnc\u00fc, R.H.: An interior-point method for a class of saddle-point problems. J. Optim. Theory Appl. 116(3), 559\u2013590 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1680_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/10556788.2016.1213839","volume":"32","author":"SK Pakazad","year":"2017","unstructured":"Pakazad, S.K., Hansson, A., Andersen, M.S.: Distributed primal-dual interior-point methods for solving loosely coupled problems using message passing. Optim. Method Softw. 32(3), 401\u2013435 (2017)","journal-title":"Optim. Method Softw."},{"issue":"1","key":"1680_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1080\/02331930701779096","volume":"57","author":"M Shida","year":"2008","unstructured":"Shida, M.: An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming. Optimization 57(1), 183\u2013200 (2008)","journal-title":"Optimization"},{"key":"1680_CR15","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Fujisawa, K., Fukuda, M., Kobayashi, K., Nakta, K., Nakata, M.: Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, chap. Latest developments in the SDPA Family for solving large-scale SDPs, pp. 687\u2013714. Springer-Verlag, New York, USA (2011)","DOI":"10.1007\/978-1-4614-0769-0_24"},{"key":"1680_CR16","first-page":"697","volume":"35","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-point polynomial algorithms in convex programming. Soc. Ind. Math. 35, 697 (1994)","journal-title":"Soc. Ind. Math."},{"issue":"4","key":"1680_CR17","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/130944539","volume":"24","author":"Q Tran-Dinh","year":"2014","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: An inexact proximal path-following algorithm for constrained convex minimization. SIAM J. Optim. 24(4), 1718\u20131745 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1680_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sciences"},{"key":"1680_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course, Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, Applied Optimization, vol. 87. Kluwer Academic Publishers, London (2004)"},{"key":"1680_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0421-3","volume":"127","author":"Y Nesterov","year":"2011","unstructured":"Nesterov, Y.: Barrier subgradient method. Math. Program. Ser. B 127, 31\u201356 (2011)","journal-title":"Math. Program. Ser. B"},{"issue":"1\u20132","key":"1680_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10107-018-1264-6","volume":"177","author":"Q Tran-Dinh","year":"2019","unstructured":"Tran-Dinh, Q., Sun, T., Lu, S.: Self-concordant inclusions: A unified framework for path-following generalized Newton-type algorithms. Math. Program. 177(1\u20132), 173\u2013223 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"1680_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1680_CR23","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1680_CR24","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1680_CR25","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1287\/moor.2017.0907","volume":"43","author":"Q Tran-Dinh","year":"2018","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: A single phase proximal path-following framework. Math. Oper. Res. 43(4), 1326\u20131347 (2018)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1680_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"1680_CR27","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Todd, M., T\u00fct\u00fcnc\u00fc, R.: On the implementation and usage of SDPT3\u2013a Matlab software package for semidefinite-quadratic-linear programming. Techical Report, vol. 4, NUS Singapore (2010)","DOI":"10.1007\/978-1-4614-0769-0_25"},{"issue":"10","key":"1680_CR28","doi-asserted-by":"publisher","first-page":"4825","DOI":"10.1109\/TSP.2008.927460","volume":"56","author":"P Tsiaflakis","year":"2008","unstructured":"Tsiaflakis, P., Diehl, M., Moonen, M.: Distributed spectrum management algorithms for multi-user DSL networks. IEEE Trans. Signal Process. 56(10), 4825\u20134843 (2008)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01680-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-020-01680-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01680-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T23:12:31Z","timestamp":1621293151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-020-01680-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,18]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1680"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01680-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2020,5,18]]},"assertion":[{"value":"26 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}