{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:54Z","timestamp":1740124014019,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,22]],"date-time":"2023-04-22T00:00:00Z","timestamp":1682121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,22]],"date-time":"2023-04-22T00:00:00Z","timestamp":1682121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901118","62073087"],"award-info":[{"award-number":["11901118","62073087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Suqian Sci &Tech Program","award":["Z2020135","K202112"],"award-info":[{"award-number":["Z2020135","K202112"]}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A515010839"],"award-info":[{"award-number":["2022A515010839"]}],"id":[{"id":"10.13039\/501100003453","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":[[2023,8]]},"DOI":"10.1007\/s10957-023-02215-2","type":"journal-article","created":{"date-parts":[[2023,4,22]],"date-time":"2023-04-22T06:02:07Z","timestamp":1682143327000},"page":"588-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tensor Optimization Algorithm for Computing Lagrangians of Hypergraphs"],"prefix":"10.1007","volume":"198","author":[{"given":"Jingya","family":"Chang","sequence":"first","affiliation":[]},{"given":"Bin","family":"Xiao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6649-1103","authenticated-orcid":false,"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,22]]},"reference":[{"issue":"1","key":"2215_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1), 5\u201316 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0133-5","journal-title":"Math. Program."},{"issue":"2","key":"2215_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010). https:\/\/doi.org\/10.1287\/moor.1100.0449","journal-title":"Math. Oper. Res."},{"key":"2215_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradientmethods. IMA J. Numer. Anal. 8, 141\u2013148 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"key":"2215_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353, 163\u2013166 (2016). https:\/\/doi.org\/10.1126\/science.aad9029","journal-title":"Science"},{"key":"2215_CR5","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 3rd edn. Athena Scientific, Belmont (2016)","edition":"3"},{"issue":"4","key":"2215_CR6","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007). https:\/\/doi.org\/10.1137\/050644641","journal-title":"SIAM J. Optim."},{"key":"2215_CR7","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"SR Bul\u00f2","year":"2013","unstructured":"Bul\u00f2, S.R., Pelillo, M.: A game-theoretic approach to hypergraph clustering. IEEE Trans. Pattern Anal. Mach. Intell. 35, 1312\u20131327 (2013). https:\/\/doi.org\/10.1109\/TPAMI.2012.226","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2215_CR8","doi-asserted-by":"publisher","first-page":"A3618","DOI":"10.1109\/10.1137\/16M1060224","volume":"38","author":"J Chang","year":"2016","unstructured":"Chang, J., Chen, Y., Qi, L.: Computing eigenvalues of large scale sparse tensors arising from a hypergraph. SIAM J. Sci. Comput. 38, A3618\u2013A3643 (2016). https:\/\/doi.org\/10.1109\/10.1137\/16M1060224","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2215_CR9","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/19M1291601","volume":"13","author":"J Chang","year":"2020","unstructured":"Chang, J., Chen, Y., Qi, L., Yan, H.: Hypergraph clustering using a new Laplacian tensor with applications in image processing. SIAM J. Imaging Sci. 13(3), 1157\u20131178 (2020). https:\/\/doi.org\/10.1137\/19M1291601","journal-title":"SIAM J. Imaging Sci."},{"key":"2215_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-017-0520-x","volume":"75","author":"J Chang","year":"2018","unstructured":"Chang, J., Ding, W., Qi, L., Yan, H.: Computing the $$p$$-spectral radii of uniform hypergraphs with applications. J. Sci. Comput. 75, 1\u201325 (2018). https:\/\/doi.org\/10.1007\/s10915-017-0520-x","journal-title":"J. Sci. Comput."},{"issue":"6","key":"2215_CR11","doi-asserted-by":"publisher","first-page":"A2508","DOI":"10.1137\/16M1094828","volume":"39","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Qi, L., Zhang, X.: The Fiedler vector of a Laplacian tensor for hypergraph partitioning. SIAM J. Sci. Comput. 39(6), A2508\u2013A2537 (2017). https:\/\/doi.org\/10.1137\/16M1094828","journal-title":"SIAM J. Sci. Comput."},{"key":"2215_CR12","unstructured":"Chen, Y., Ye, X.: Projection onto a simplex, pp. 1\u20137 (2011). arXiv:1101.6081v2. https:\/\/doi.org\/10.48550\/arXiv.1101.6081"},{"key":"2215_CR13","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","volume":"436","author":"J Cooper","year":"2012","unstructured":"Cooper, J., Dutle, A.: Spectra of uniform hypergraphs. Linear Algebra Appl. 436, 3268\u20133292 (2012). https:\/\/doi.org\/10.1016\/j.laa.2011.11.018","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2215_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","volume":"52","author":"P Frankl","year":"1989","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems whose solutions are the blowups of the small witt-designs. J. Comb. Theory Ser. A 52(1), 129\u2013147 (1989). https:\/\/doi.org\/10.1016\/0097-3165(89)90067-8","journal-title":"J. Comb. Theory Ser. A"},{"key":"2215_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2020.107063","volume":"365","author":"V Gruslys","year":"2020","unstructured":"Gruslys, V., Letzter, S., Morrison, N.: Hypergraph Lagrangians I: the Frankl\u2013F\u00fcredi conjecture is false. Adv. Math. 365, 107063 (2020). https:\/\/doi.org\/10.1016\/j.aim.2020.107063","journal-title":"Adv. Math."},{"key":"2215_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s11856-021-2132-2","volume":"242","author":"V Gruslys","year":"2021","unstructured":"Gruslys, V., Letzter, S., Morrison, N.: Lagrangians of hypergraphs II: when colex is best. Isr. J. Math. 242, 637\u2013662 (2021). https:\/\/doi.org\/10.1007\/s11856-021-2132-2","journal-title":"Isr. J. Math."},{"issue":"2","key":"2215_CR17","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006). https:\/\/doi.org\/10.1137\/050635225","journal-title":"SIAM J. Optim."},{"key":"2215_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.108526","volume":"125","author":"J Hou","year":"2022","unstructured":"Hou, J., Pelillo, M., Yuan, H.: Hypergraph matching via game-theoretic hypergraph clustering. Pattern Recognit. 125, 108526 (2022). https:\/\/doi.org\/10.1016\/j.patcog.2022.108526","journal-title":"Pattern Recognit."},{"key":"2215_CR19","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1007\/s00211-018-0981-3","volume":"140","author":"S Hu","year":"2018","unstructured":"Hu, S., Li, G.: Convergence rate analysis for the higher order power method in best rank one approximations of tensors. Numer. Math. 140, 993\u20131031 (2018). https:\/\/doi.org\/10.1007\/s00211-018-0981-3","journal-title":"Numer. Math."},{"key":"2215_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/jcd.21687","volume":"28","author":"S Hu","year":"2020","unstructured":"Hu, S., Peng, Y., Wu, B.: Lagrangian densities of linear forests and Tur\u00e1n numbers of their extensions. J. Comb. Des. 28, 207\u2013223 (2020). https:\/\/doi.org\/10.1002\/jcd.21687","journal-title":"J. Comb. Des."},{"key":"2215_CR21","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1137\/21M1390785","volume":"31","author":"Y Huang","year":"2021","unstructured":"Huang, Y., Dai, Y., Liu, X.: Equipping the Barzilai\u2013Borwein method with the two dimensional quadratic termination property. SIAM J. Optim. 31, 3068\u20133096 (2021). https:\/\/doi.org\/10.1137\/21M1390785","journal-title":"SIAM J. Optim."},{"issue":"10","key":"2215_CR22","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.14778\/3467861.3467869","volume":"14","author":"D Koutsoukos","year":"2021","unstructured":"Koutsoukos, D., Nakandala, S., Karanasos, K., Saur, K., Alonso, G., Interlandi, M.: Tensors: an abstraction for general data processing. Proc. VLDB Endow. 14(10), 1797\u20131804 (2021). https:\/\/doi.org\/10.14778\/3467861.3467869","journal-title":"Proc. VLDB Endow."},{"key":"2215_CR23","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00c9quations aux D\u00e9riv\u00e9es Partielles, pp. 87\u201389 (1963)"},{"key":"2215_CR24","first-page":"329","volume":"121","author":"X Lu","year":"2015","unstructured":"Lu, X., Zhang, X.: A note on Lagrangians of 4-uniform hypergraphs. ARS Comb. 121, 329\u2013340 (2015)","journal-title":"ARS Comb."},{"key":"2215_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1049\/itr2.12130","volume":"16","author":"X Luo","year":"2022","unstructured":"Luo, X., Peng, J., Liang, J.: Directed hypergraph attention network for traffic forecasting. IET Intell. Transp. Syst. 16, 85\u201398 (2022). https:\/\/doi.org\/10.1049\/itr2.12130","journal-title":"IET Intell. Transp. Syst."},{"key":"2215_CR26","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/cjm-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965). https:\/\/doi.org\/10.4153\/cjm-1965-053-6","journal-title":"Can. J. Math."},{"key":"2215_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974751","volume-title":"Tensor Analysis: Spectral Theory and Special Tensors","author":"L Qi","year":"2017","unstructured":"Qi, L., Luo, Z.: Tensor Analysis: Spectral Theory and Special Tensors. SIAM, Philadelpia (2017). https:\/\/doi.org\/10.1137\/1.9781611974751"},{"key":"2215_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10957-013-0519-x","volume":"163","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Tang, Q., Zhao, C., Peng, Y.: On the largest graph-Lagrangian of 3-graphs with fixed number of edges. J. Optim. Theory Appl. 163, 57\u201379 (2014). https:\/\/doi.org\/10.1007\/s10957-013-0519-x","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2215_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1017\/s0963548301005053","volume":"11","author":"JM Talbot","year":"2022","unstructured":"Talbot, J.M.: Lagrangians of hypergraphs. Comb., Probab. Comput. 11(2), 199\u2013216 (2022). https:\/\/doi.org\/10.1017\/s0963548301005053","journal-title":"Comb., Probab. Comput."},{"key":"2215_CR30","unstructured":"Wang, W., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Projection onto the probability simplex: an efficient algorithm with a simple proof, and an application, pp. 1\u20135 (2013). arXiv:1309.1541v1. https:\/\/doi.org\/10.48550\/arXiv.1309.1541"},{"key":"2215_CR31","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s11431-021-1957-3","volume":"65","author":"D Zhang","year":"2022","unstructured":"Zhang, D., Luo, Y., Yu, Y., Zhao, Q., Zhou, G.: Semi-supervised multi-view clustering with dual hypergraph regularized partially shared non-negative matrix factorization. Sci. China Technol. Sci. 65, 1349\u20131365 (2022). https:\/\/doi.org\/10.1007\/s11431-021-1957-3","journal-title":"Sci. China Technol. Sci."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02215-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02215-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02215-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T18:07:22Z","timestamp":1693418842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02215-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,22]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2215"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02215-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2023,4,22]]},"assertion":[{"value":"30 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}