{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:39:34Z","timestamp":1768819174433,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Foundation for Science and Technology Development of Ton Duc Thang University","award":["FOSTECT.2017.BR.10"],"award-info":[{"award-number":["FOSTECT.2017.BR.10"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10898-021-01043-w","type":"journal-article","created":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T05:02:52Z","timestamp":1622437372000},"page":"897-928","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Alternating DC algorithm for partial DC programming problems"],"prefix":"10.1007","volume":"82","author":[{"given":"Tao","family":"Pham Dinh","sequence":"first","affiliation":[]},{"given":"Van Ngai","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]},{"given":"Vinh Thanh","family":"Ho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,31]]},"reference":[{"issue":"1","key":"1043_CR1","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Vuong, P.T.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30(1), 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"1043_CR2","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, 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"1043_CR3","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)","journal-title":"Math. Oper. Res."},{"key":"1043_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"1043_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1043_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02699126","volume":"67","author":"E Bierstone","year":"1988","unstructured":"Bierstone, E., Milman, P.: Semianalytic and subanalytic sets. Public. Math. l\u2019IH\u00c9S 67, 5\u201342 (1988)","journal-title":"Public. Math. l\u2019IH\u00c9S"},{"issue":"4","key":"1043_CR7","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)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1043_CR8","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"1043_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1043_CR10","first-page":"1","volume":"11","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3) 11, 1\u201337 (2011)","journal-title":"J. ACM 58(3)"},{"issue":"2","key":"1043_CR11","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21(2), 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"1043_CR12","unstructured":"Chatterji, N., Bartlett, P.L.: Alternating minimization for dictionary learning with random initialization. In: I.\u00a0Guyon, U.V. Luxburg, S.\u00a0Bengio, H.\u00a0Wallach, R.\u00a0Fergus, S.\u00a0Vishwanathan, R.\u00a0Garnett (eds.) Advances in Neural Information Processing Systems 30, pp. 1997\u20132006. Curran Associates, Inc. (2017)"},{"key":"1043_CR13","series-title":"Canadian Mathematical Society Series of Monographs and Advanced Texts","volume-title":"Optimization and Nonsmooth Analysis","author":"F Clarke","year":"1983","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts, Wiley, New York (1983)"},{"issue":"7\u20138","key":"1043_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/cem.1236","volume":"23","author":"P Comon","year":"2009","unstructured":"Comon, P., Luciani, X., de Almeida, A.L.F.: Tensor decompositions, alternating least squares and other tales. J. Chemom. 23(7\u20138), 393\u2013405 (2009)","journal-title":"J. Chemom."},{"issue":"7","key":"1043_CR15","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1080\/02331934.2018.1476859","volume":"68","author":"JX Cruz Neto","year":"2019","unstructured":"Cruz Neto, J.X., Lopes, J.O., Santos, P.S.M., Souza, J.C.O.: An interior proximal linearized method for dc programming based on Bregman distance or second-order homogeneous kernels. Optimization 68(7), 1305\u20131319 (2019)","journal-title":"Optimization"},{"key":"1043_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211\u2013218 (1936)","journal-title":"Psychometrika"},{"issue":"2","key":"1043_CR17","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/0022-247X(74)90025-0","volume":"47","author":"I Ekeland","year":"1974","unstructured":"Ekeland, I.: On the variational principle. J. Math. Anal. Appl. 47(2), 324\u2013353 (1974)","journal-title":"J. Math. Anal. Appl."},{"key":"1043_CR18","doi-asserted-by":"crossref","unstructured":"Ho, V.T., Le Thi, H.A., Pham Dinh, T.: DCA-based algorithms for DC fitting. J. Comput. Appl. Math. 389(113353) (2021)","DOI":"10.1016\/j.cam.2020.113353"},{"key":"1043_CR19","unstructured":"Ioffe, A., Tihomirov, V.: Theory of Extremal Problems. North-Holland (1979)"},{"key":"1043_CR20","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, STOC\u201913, pp. 665\u2013674. Association for Computing Machinery, New York, NY, USA (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"3","key":"1043_CR21","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: A proximal bundle method for nonsmooth dc optimization utilizing nonconvex cutting planes. J. Global Optim. 68(3), 501\u2013535 (2017)","journal-title":"J. Global Optim."},{"issue":"3","key":"1043_CR22","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annales de l\u2019Institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019Institut Fourier"},{"issue":"4","key":"1043_CR23","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1162\/neco_a_01266","volume":"32","author":"HA Le Thi","year":"2020","unstructured":"Le Thi, H.A., Ho, V.T.: Online learning based on online DCA and application to online classification. Neural Comput. 32(4), 759\u2013793 (2020)","journal-title":"Neural Comput."},{"key":"1043_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10957-018-1345-y","volume":"179","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Convergence analysis of dc algorithm for dc programming with subanalytic data. J. Optim. Theory Appl. 179, 103\u2013126 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"1043_CR25","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Stochastic DCA for the large-sum of non-convex functions problem and its application to group variable selection in classification. In: Proceedings of the 34th International Conference on Machine Learning, Vol. 70, pp. 3394\u20133403. JMLR.org (2017)"},{"key":"1043_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125904","author":"HA Le Thi","year":"2020","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning. Appl. Math. Comput. (2020). https:\/\/doi.org\/10.1016\/j.amc.2020.125904","journal-title":"Appl. Math. Comput."},{"issue":"1\u20134","key":"1043_CR27","first-page":"23","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1\u20134), 23\u201348 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1043_CR28","first-page":"5","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. Special Issue DC Program. Theory Algor. Appl. 169(1), 5\u201368 (2018)","journal-title":"Math. Program. Special Issue DC Program. Theory Algor. Appl."},{"key":"1043_CR29","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.neucom.2015.12.068","volume":"186","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Phan, D.N.: DC programming and DCA for sparse optimal scoring problem. Neurocomputing 186, 170\u2013181 (2016)","journal-title":"Neurocomputing"},{"issue":"6","key":"1043_CR30","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1162\/NECO_a_00836","volume":"28","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Vo, X.T., Pham Dinh, T.: Efficient nonnegative matrix factorization by DC programming and DCA. Neural Comput. 28(6), 1163\u20131216 (2016)","journal-title":"Neural Comput."},{"key":"1043_CR31","unstructured":"Li, Q., Zhu, Z., Tang, G.: Alternating minimizations converge to second-order optimal solutions. In: K.\u00a0Chaudhuri, R.\u00a0Salakhutdinov (eds.) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a097, pp. 3935\u20133943. PMLR, Long Beach, California, USA (2019)"},{"issue":"1","key":"1043_CR32","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-018-1327-8","volume":"176","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. 176(1), 339\u2013367 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"1043_CR33","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4064\/sm-18-1-87-136","volume":"18","author":"S \u0141ojasiewicz","year":"1959","unstructured":"\u0141ojasiewicz, S.: Sur le probl\u00e8me de la division. Stud. Math. 18(1), 87\u2013136 (1959)","journal-title":"Stud. Math."},{"key":"1043_CR34","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Colloques internationaux du C.N.R.S sur les Equations aux d\u00e9riv\u00e9es Partielles pp. 87\u201389 (1963)"},{"issue":"5","key":"1043_CR35","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi- et sous-analytique. Anal de l\u2019institute Fourier 43(5), 1575\u20131595 (1993)","journal-title":"Anal de l\u2019institute Fourier"},{"issue":"4","key":"1043_CR36","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"key":"1043_CR37","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational analysis and generalized differentiation. I. Basic theory, Grundlehren der Mathematischen Wissenschaften, vol. 330. Springer, Berlin (2006)","DOI":"10.1007\/3-540-31247-1"},{"key":"1043_CR38","unstructured":"Netrapalli, P., U\u00a0N, N., Sanghavi, S., Anandkumar, A., Jain, P.: Non-convex robust PCA. In: Z.\u00a0Ghahramani, M.\u00a0Welling, C.\u00a0Cortes, N.D. Lawrence, K.Q. Weinberger (eds.) Advances in Neural Information Processing Systems 27, pp. 1107\u20131115. Curran Associates, Inc. (2014)"},{"key":"1043_CR39","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1007\/s10957-020-01721-x","volume":"186","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira, W.: Sequential difference-of-convex programming. J. Optim. Theory Appl. 186, 936\u2013959 (2020)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1043_CR40","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1043_CR41","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietn. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietn."},{"key":"1043_CR42","doi-asserted-by":"crossref","unstructured":"Phan, D.N., Le, H.M., Le Thi, H.A.: Accelerated difference of convex functions algorithm and its application to sparse binary logistic regression. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI-18, pp. 1369\u20131375. International Joint Conferences on Artificial Intelligence Organization (2018)","DOI":"10.24963\/ijcai.2018\/190"},{"key":"1043_CR43","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"1043_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"6","key":"1043_CR45","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1080\/10556788.2018.1496086","volume":"34","author":"Y Shen","year":"2019","unstructured":"Shen, Y., Xu, H., Liu, X.: An alternating minimization method for robust principal component analysis. Optim. Methods Softw. 34(6), 1251\u20131276 (2019)","journal-title":"Optim. Methods Softw."},{"key":"1043_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2008-4","volume-title":"Geometry of Subanalytic and Semialgebraic Sets, Progress in Mathematics","author":"M Shiota","year":"1997","unstructured":"Shiota, M.: Geometry of Subanalytic and Semialgebraic Sets, Progress in Mathematics, vol. 150. Birkh\u00e4user, Basel (1997)"},{"issue":"3","key":"1043_CR47","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/080724265","volume":"1","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Yang, J., Yin, W., Zhang, Y.: A new alternating minimization algorithm for total variation image reconstruction. SIAM J. Imaging Sci. 1(3), 248\u2013272 (2008)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1043_CR48","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"1043_CR49","unstructured":"Xu, Y., Qi, Q., Lin, Q., Jin, R., Yang, T.: Stochastic optimization for DC functions and non-smooth non-convex regularizers with non-asymptotic convergence. In: K.\u00a0Chaudhuri, R.\u00a0Salakhutdinov (eds.) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a097, pp. 6942\u20136951. PMLR (2019)"},{"issue":"3","key":"1043_CR50","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1043_CR51","first-page":"167","volume":"9","author":"X Yuan","year":"2013","unstructured":"Yuan, X., Yang, J.: Sparse and low rank matrix decomposition via alternating direction method. Pac. J. Optim. 9(1), 167\u2013180 (2013)","journal-title":"Pac. J. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01043-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01043-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01043-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T05:09:46Z","timestamp":1649221786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01043-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,31]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1043"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01043-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,31]]},"assertion":[{"value":"4 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2021","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 that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}