{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T05:46:36Z","timestamp":1762321596488,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,25]],"date-time":"2016-01-25T00:00:00Z","timestamp":1453680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,25]],"date-time":"2016-01-25T00:00:00Z","timestamp":1453680000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DGE-1147470"],"award-info":[{"award-number":["DGE-1147470"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005492","name":"Stanford University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005492","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10589-015-9819-4","type":"journal-article","created":{"date-parts":[[2016,1,25]],"date-time":"2016-01-25T04:00:20Z","timestamp":1453694420000},"page":"355-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Bounding duality gap for separable problems with linear constraints"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3985-915X","authenticated-orcid":false,"given":"Madeleine","family":"Udell","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,25]]},"reference":[{"issue":"1\u20133","key":"9819_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01587092","volume":"44","author":"E Anderson","year":"1989","unstructured":"Anderson, E., Lewis, A.: An extension of the simplex algorithm for semi-infinite linear programming. Math. Program. 44(1\u20133), 247\u2013269 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"9819_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.1.3.225","volume":"1","author":"J Aubin","year":"1976","unstructured":"Aubin, J., Ekeland, I.: Estimates of the duality gap in nonconvex optimization. Math. Oper. Res. 1(3), 225\u2013245 (1976)","journal-title":"Math. Oper. Res."},{"key":"9819_CR3","volume-title":"A Course in Convexity","author":"A Barvinok","year":"2002","unstructured":"Barvinok, A.: A Course in Convexity, vol. 54. American Mathematical Society, Providence (2002)"},{"issue":"1","key":"9819_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02574037","volume":"13","author":"AI Barvinok","year":"1995","unstructured":"Barvinok, A.I.: Problems of distance geometry and convex properties of quadratic maps. Discret. Comput. Geom. 13(1), 189\u2013202 (1995)","journal-title":"Discret. Comput. Geom."},{"issue":"6","key":"9819_CR5","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/S0036141094265936","volume":"27","author":"J Benoist","year":"1996","unstructured":"Benoist, J., Hiriart-Urruty, J.B.: What is the subdifferential of the closed convex hull of a function? SIAM J. Math. Anal. 27(6), 1661\u20131679 (1996)","journal-title":"SIAM J. Math. Anal."},{"key":"9819_CR6","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"9819_CR7","volume-title":"Convex Optimization Theory","author":"D Bertsekas","year":"2009","unstructured":"Bertsekas, D.: Convex Optimization Theory. Athena Scientific, Belmont (2009)"},{"issue":"1","key":"9819_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TAC.1983.1103136","volume":"28","author":"D Bertsekas","year":"1983","unstructured":"Bertsekas, D., Lauer, G., Sandell, N., Posbergh, T.: Optimal short-term scheduling of large-scale power systems. IEEE Trans. Autom. Control 28(1), 1\u201311 (1983)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9819_CR9","volume-title":"Constrained Optimization and Lagrange Multipler Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multipler Methods. Athena Scientific, Belmont (1982)"},{"issue":"1","key":"9819_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1287\/moor.1110.0481","volume":"36","author":"J Bolte","year":"2011","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S.: Generic optimality conditions for semialgebraic convex programs. Math. Oper. Res. 36(1), 55\u201370 (2011)","journal-title":"Math. Oper. Res."},{"key":"9819_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139087322","volume-title":"Convex Functions: Constructions, Characterizations and Counterexamples","author":"JM Borwein","year":"2010","unstructured":"Borwein, J.M., Vanderwerff, J.D.: Convex Functions: Constructions, Characterizations and Counterexamples. Cambridge University Press, Cambridge (2010)"},{"key":"9819_CR12","doi-asserted-by":"crossref","unstructured":"Bouaziz, S., Tagliasacchi, A., Pauly, M.: Sparse iterative closest point. In: Computer Graphics Forum, vol. 32, pp. 113\u2013123. Wiley Online Library (2013)","DOI":"10.1111\/cgf.12178"},{"issue":"1","key":"9819_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"9819_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"11","key":"9819_CR15","doi-asserted-by":"publisher","first-page":"5810","DOI":"10.1109\/TSP.2012.2208955","volume":"60","author":"R Chartrand","year":"2012","unstructured":"Chartrand, R.: Nonconvex splitting for regularized low-rank $$+$$ sparse decomposition. IEEE Trans. Signal Process. 60(11), 5810\u20135819 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"9819_CR16","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Wohlberg, B.: A nonconvex admm algorithm for group sparsity with sparse groups. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 6009\u20136013. IEEE (2013)","DOI":"10.1109\/ICASSP.2013.6638818"},{"key":"9819_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81\u2013101 (1994)","journal-title":"Math. Program."},{"key":"9819_CR18","unstructured":"Derbinsky, N., Bento, J., Elser, V., Yedidia, J.S.: An improved three-weight message-passing algorithm. arXiv preprint arXiv:1305.1961 (2013)"},{"key":"9819_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"9819_CR20","first-page":"119","volume-title":"Large Scale Optimization: State of the Art","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J., Fukushima, M.: Some reformulations and applications of the alternating direction method of multipliers. Large Scale Optimization: State of the Art, pp. 119\u2013138. Springer, New York (1993)"},{"key":"9819_CR21","doi-asserted-by":"publisher","unstructured":"Fazel, M., Chiang, M.: Network utility maximization with nonconcave utilities using sum-of-squares method. In: Proceedings of the European Control Conference, pp. 1867\u20131874 (2005). doi: 10.1109\/CDC.2005.1582432","DOI":"10.1109\/CDC.2005.1582432"},{"key":"9819_CR22","volume-title":"Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)"},{"key":"9819_CR23","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: On decomposition-coordination methods using an augmented Lagrangian. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)"},{"key":"9819_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF00247655","volume":"1","author":"M Fukushima","year":"1992","unstructured":"Fukushima, M.: Application of the alternating direction method of multipliers to separable convex programming problems. Comput. Optim. Appl. 1, 93\u2013111 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"9819_CR25","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems","author":"D Gabay","year":"1983","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)"},{"key":"9819_CR26","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. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"9819_CR27","unstructured":"Gilimyanov, R., Zhuang, H.: Power allocation in OFDMA networks: An ADMM approach. In: 5th Traditional Youth Summer School on Control, Information, and Optimization (2013)"},{"key":"9819_CR28","doi-asserted-by":"publisher","unstructured":"Glowinski, R.: On alternating direction methods of multipliers: a historical perspective. In: W. Fitzgibbon, Y.A. Kuznetsov, P. Neittaanmki, O. Pironneau (eds.) Modeling, Simulation and Optimization for Science and Technology, Computational Methods in Applied Sciences, vol. 34, pp. 59\u201382. Springer (2014). doi: 10.1007\/978-94-017-9054-3_4","DOI":"10.1007\/978-94-017-9054-3_4"},{"key":"9819_CR29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation, par elements finis d\u2019ordre un, et la resolution, par penalisation-dualit\u00e9, d\u2019une classe de problems de Dirichlet non lineares. Revue Fran\u00e7aise d\u2019Automatique, Informatique, et Recherche Op\u00e9rationelle 9, 41\u201376 (1975)","journal-title":"Revue Fran\u00e7aise d\u2019Automatique, Informatique, et Recherche Op\u00e9rationelle"},{"key":"9819_CR30","unstructured":"Glowinski, R., Tallec, P.L.: Augmented Lagrangian methods for the solution of variational problems. Tech. Rep. 2965, University of Wisconsin-Madison (1987)"},{"key":"9819_CR31","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"9819_CR32","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $${O}(1\/n)$$ convergence rate of the Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"9819_CR33","volume-title":"Convex Analysis and Minimization Algorithms I: Part 1: Fundamentals","author":"JB Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I: Part 1: Fundamentals. Springer, Berlin (1996)"},{"key":"9819_CR34","unstructured":"Hong, M., Luo, Z.Q.: On the linear convergence of the alternating direction method of multipliers. arXiv preprint arXiv:1208.3922 (2012)"},{"key":"9819_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Optimization. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"9819_CR36","doi-asserted-by":"publisher","unstructured":"Kanamori, T., Takeda, A.: Non-convex optimization on Stiefel manifold and applications to machine learning. In: T. Huang, Z. Zeng, C. Li, C. Leung (eds.) Neural Information Processing, Lecture Notes in Computer Science, vol. 7663, pp. 109\u2013116. Springer (2012). doi: 10.1007\/978-3-642-34475-6_14","DOI":"10.1007\/978-3-642-34475-6_14"},{"issue":"3","key":"9819_CR37","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90(3), 399\u2013427 (2001)","journal-title":"Math. Program."},{"key":"9819_CR38","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"9819_CR39","doi-asserted-by":"crossref","unstructured":"Magnusson, S., Weeraddana, P.C., Fischione, C.: A distributed approach for the optimal power flow problem based on ADMM and sequential convex approximations. arXiv preprint arXiv:1401.4621 (2014)","DOI":"10.1109\/TCNS.2015.2399192"},{"key":"9819_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"6","key":"9819_CR41","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1090\/S0002-9939-07-08887-9","volume":"135","author":"AM Oberman","year":"2007","unstructured":"Oberman, A.M.: The convex envelope is the solution of a nonlinear obstacle problem. Proc. Am. Math. Soc. 135(6), 1689\u20131694 (2007)","journal-title":"Proc. Am. Math. Soc."},{"issue":"05","key":"9819_CR42","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1142\/S0218202508002851","volume":"18","author":"AM Oberman","year":"2008","unstructured":"Oberman, A.M.: Computing the convex envelope using a nonlinear partial differential equation. Math. Models Methods Appl. Sci. 18(05), 759\u2013780 (2008)","journal-title":"Math. Models Methods Appl. Sci."},{"key":"9819_CR43","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-61310-2_13","volume-title":"Cone-LP\u2019s and Semidefinite Programs: Geometry and a Simplex-Type Method. Integer Programming and Combinatorial Optimization","author":"G Pataki","year":"1996","unstructured":"Pataki, G.: Cone-LP\u2019s and Semidefinite Programs: Geometry and a Simplex-Type Method. Integer Programming and Combinatorial Optimization, pp. 162\u2013174. Springer, Berlin (1996)"},{"issue":"2","key":"9819_CR44","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2), 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"key":"9819_CR45","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0103003","volume":"3","author":"DW Peaceman","year":"1955","unstructured":"Peaceman, D.W., Rachford, H.H.: The numerical solution of parabolic and elliptic differential equations. J. Soc. Ind. Appl. Math. 3, 28\u201341 (1955)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"9819_CR46","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10(4), 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"9819_CR47","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis, vol. 28. Princeton University Press, Princeton (1970)"},{"issue":"2","key":"9819_CR48","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s11081-009-9101-7","volume":"11","author":"J Skaf","year":"2010","unstructured":"Skaf, J., Boyd, S.: Techniques for exploring the suboptimal set. Optim. Eng. 11(2), 319\u2013337 (2010)","journal-title":"Optim. Eng."},{"key":"9819_CR49","doi-asserted-by":"publisher","first-page":"25","DOI":"10.2307\/1909201","volume":"37","author":"RM Starr","year":"1969","unstructured":"Starr, R.M.: Quasi-equilibria in markets with nonconvex preferences. Econometrica 37, 25\u201338 (1969)","journal-title":"Econometrica"},{"key":"9819_CR50","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.: Convexification and Global Optimization in Continuous and Mixed-integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer, New York (2002)","DOI":"10.1007\/978-1-4757-3532-1"},{"issue":"1","key":"9819_CR51","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0329006","volume":"29","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: Applications of a splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29(1), 119\u2013138 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"9819_CR52","unstructured":"Udell, M., Boyd, S.: Maximizing a sum of sigmoids. Available at http:\/\/www.stanford.edu\/boyd\/papers\/max_sum_sigmoids.html (2013)"},{"issue":"R2","key":"9819_CR53","first-page":"57","volume":"4","author":"M Valadier","year":"1970","unstructured":"Valadier, M.: Int\u00e9gration de convexes ferm\u00e9s notamment d\u2019\u00e9pigraphes inf-convolution continue. ESAIM 4(R2), 57\u201373 (1970)","journal-title":"ESAIM"},{"key":"9819_CR54","doi-asserted-by":"crossref","unstructured":"Vujanic, R., Esfahani, P.M., Goulart, P., Mariethoz, S., Morari, M.: Vanishing duality gap in large scale mixed-integer optimization: a solution method with power system applications. J. Math. Program. (2014)","DOI":"10.1109\/MED.2014.6961472"},{"key":"9819_CR55","unstructured":"Zhang, Y.: Recent advances in alternating direction methods: practice and theory. In: IPAM Workshop on Continuous Optimization (2010)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9819-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9819-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9819-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9819-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T10:05:17Z","timestamp":1654164317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9819-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,25]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9819"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9819-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,1,25]]},"assertion":[{"value":"28 August 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}