{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:47:47Z","timestamp":1765039667791,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T00:00:00Z","timestamp":1681516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T00:00:00Z","timestamp":1681516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["20-71-10032"],"award-info":[{"award-number":["20-71-10032"]}],"id":[{"id":"10.13039\/501100006769","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":[[2023,7]]},"DOI":"10.1007\/s10589-023-00479-y","type":"journal-article","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T15:02:11Z","timestamp":1681570931000},"page":"993-1031","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["DC semidefinite programming and cone constrained DC optimization II: local search methods"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0677-0797","authenticated-orcid":false,"given":"M. V.","family":"Dolgopolik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"479_CR1","first-page":"1","volume-title":"Nonsmooth Optimization and Its Applications","author":"P Absil","year":"2019","unstructured":"Absil, P., Hosseini, S.: A collection of nonsmooth Riemannian optimization problems. In: Hosseini, S., Mordukhovich, B., Uschmajew, A. (eds.) Nonsmooth Optimization and Its Applications, pp. 1\u201315. Birkh\u00e4user, Cham (2019)"},{"key":"479_CR2","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10589-020-00241-8","volume":"78","author":"W van Ackooij","year":"2021","unstructured":"van Ackooij, W., Demassey, S., Javal, P., Morais, H., de Oliveira, W., Swaminathan, B.: A bundle method for nonsmooth dc programming with application to chance-constrained problems. Comput. Optim. Appl. 78, 451\u2013490 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"479_CR3","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1080\/10556788.2019.1595619","volume":"34","author":"W van Ackooij","year":"2019","unstructured":"van Ackooij, W., de Oliveira, W.: Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies. Optim. Methods Softw. 34, 890\u2013920 (2019)","journal-title":"Optim. Methods Softw."},{"key":"479_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10957-019-01500-3","volume":"182","author":"W van Ackooij","year":"2019","unstructured":"van Ackooij, W., de Oliveira, W.: Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions. J. Optim. Theory Appl. 182, 49\u201380 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"479_CR5","unstructured":"van Ackooij, W., de\u00a0Oliveira, W.: Addendum to the paper Nonsmooth DC-constrained optimization: constraint qualifications and minimizing methodologies (2020). Available at: https:\/\/www.researchgate.net\/publication\/348182693_Addendum_IDCA.pdf"},{"key":"479_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJA Artacho","year":"2018","unstructured":"Artacho, F.J.A., Fleming, R., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169, 95\u2013118 (2018)","journal-title":"Math. Program."},{"key":"479_CR7","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJA Artacho","year":"2020","unstructured":"Artacho, F.J.A., Vuong, P.T.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30, 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"479_CR8","doi-asserted-by":"crossref","first-page":"1732","DOI":"10.1137\/130912190","volume":"25","author":"A Auslender","year":"2015","unstructured":"Auslender, A.: An exact penalty method for nonconvex problems converging, in particular, nonlinear programming, semidefinite programming, and second-order cone programming. SIAM J. Optim. 25, 1732\u20131759 (2015)","journal-title":"SIAM J. Optim."},{"key":"479_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia (2001)"},{"key":"479_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"},{"key":"479_CR11","doi-asserted-by":"crossref","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)"},{"key":"479_CR12","doi-asserted-by":"crossref","first-page":"3981","DOI":"10.1080\/02331934.2021.1934680","volume":"71","author":"RS Burachik","year":"2022","unstructured":"Burachik, R.S., Kaya, C.Y., Price, C.J.: A primal-dual penalty method via rounded weighted-$$\\ell _1$$ Lagrangian duality. Optimization 71, 3981\u20134017 (2022)","journal-title":"Optimization"},{"key":"479_CR13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., Man-Cho So, A., Zhang, T.: Proximal gradient method for nonsmooth optimization over the Stiefel manifold. SIAM J. Optim. 30, 210\u2013239 (2020)","journal-title":"SIAM J. Optim."},{"key":"479_CR14","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1137\/140988875","volume":"38","author":"W Chen","year":"2016","unstructured":"Chen, W., Ji, H., You, Y.: An augmented Lagrangian method for $$\\ell _1$$-regularized optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 38, 570\u2013592 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"479_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"479_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10586458.1996.10504585","volume":"5","author":"JH Conway","year":"1996","unstructured":"Conway, J.H., Hardin, R.H., Sloane, N.: Packing lines, planes, ets.: Packing in Grassmanian spaces. Exp. Math. 5, 139\u2013159 (1996)","journal-title":"Exp. Math."},{"key":"479_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-73890-9_2","volume-title":"Lagrangian and Hamiltonian Methods for Nonlinear Control","author":"G Dirr","year":"2007","unstructured":"Dirr, G., Helmke, U., Lageman, C.: Nonsmooth Riemannian optimization with applications to sphere packing and grasping. In: Allg\u00fcwer, F., Fleming, P., Kokotovic, P., Kurzhanski, A.B., Kwakernaak, H., Rantzer, A., Tsitsiklis, J.N., Bullo, F., Fujimoto, K. (eds.) Lagrangian and Hamiltonian Methods for Nonlinear Control, pp. 29\u201345. Springer, Berlin (2007)"},{"key":"479_CR18","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1080\/02331934.2015.1122005","volume":"65","author":"MV Dolgopolik","year":"2016","unstructured":"Dolgopolik, M.V.: A unifying theory of exactness of linear penalty functions. Optimization 65, 1167\u20131202 (2016)","journal-title":"Optimization"},{"key":"479_CR19","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1080\/02331934.2017.1349125","volume":"66","author":"MV Dolgopolik","year":"2017","unstructured":"Dolgopolik, M.V.: A unifying theory of exactness of linear penalty functions II: parametric penalty functions. Optimization 66, 1577\u20131622 (2017)","journal-title":"Optimization"},{"key":"479_CR20","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10589-022-00374-y","volume":"82","author":"MV Dolgopolik","year":"2022","unstructured":"Dolgopolik, M.V.: DC Semidefinite programming and cone constrained DC optimization I: theory. Comput. Optim. Appl. 82, 649\u2013671 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"479_CR21","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1007\/s11590-021-01777-2","volume":"16","author":"MV Dolgopolik","year":"2022","unstructured":"Dolgopolik, M.V.: Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates. Optim. Lett. 16, 1281\u20131300 (2022)","journal-title":"Optim. Lett."},{"key":"479_CR22","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1002\/oca.2530","volume":"40","author":"MV Dolgopolik","year":"2019","unstructured":"Dolgopolik, M.V., Fominyh, A.V.: Exact penalty functions for optimal control problems I: Main theorem and free-endpoint problems. Optim. Control Appl. Method 40, 1018\u20131044 (2019)","journal-title":"Optim. Control Appl. Method"},{"key":"479_CR23","unstructured":"Fiala, J., Ko\u010dvara, M., Stingl, M.: PENLAB: a MATLAB solver for nonlinear semidefinite optimization. arXiv: 1311.5240 (2013)"},{"key":"479_CR24","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1109\/TIT.2008.2011512","volume":"55","author":"RH Gohary","year":"2009","unstructured":"Gohary, R.H., Davidson, T.N.: Noncoherent MIMO communication: Grassmannian constellations and efficient detection. IEEE Trans. Inform. Theory 55, 1176\u20131205 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"479_CR25","series-title":"Lecture Notes in Control and Information Sciences","first-page":"95","volume-title":"Recent Advances in Learning and Control","author":"M Grand","year":"2008","unstructured":"Grand, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control. Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer, London (2008)"},{"key":"479_CR26","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1093\/imanum\/drv043","volume":"36","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S.: Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds. IMA J. Numer. Anal. 36, 1167\u20131192 (2016)","journal-title":"IMA J. Numer. Anal."},{"key":"479_CR27","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10444-015-9426-z","volume":"42","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S.: $$\\varepsilon $$-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds. Adv. Comput. Math. 42, 333\u2013360 (2016)","journal-title":"Adv. Comput. Math."},{"key":"479_CR28","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-030-34910-3_8","volume-title":"Numerical Nonsmooth Optimization. State of the Art Algorithms","author":"K Joki","year":"2020","unstructured":"Joki, K., Bagirov, A.M.: Bundle methods for nonsmooth DC optimization. In: Bagirov, A.M., Gaudioso, M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S. (eds.) Numerical Nonsmooth Optimization. State of the Art Algorithms, pp. 263\u2013296. Springer, Cham (2020)"},{"key":"479_CR29","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1090\/S0002-9939-1951-0042064-2","volume":"2","author":"RV Kadison","year":"1951","unstructured":"Kadison, R.V.: Order properties of bounded self-adjoint operators. Proc. Amer. Math. Soc. 2, 505\u2013510 (1951)","journal-title":"Proc. Amer. Math. Soc."},{"key":"479_CR30","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M Ko\u010dvara","year":"2003","unstructured":"Ko\u010dvara, M., Stingl, M.: PENNON: a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18, 317\u2013333 (2003)","journal-title":"Optim. Methods Softw."},{"key":"479_CR31","doi-asserted-by":"crossref","unstructured":"Kronig, R.L., Penney, W.G.: Quantum mechanics of electrons in crystal lattices. Proc. Royal Soc. London. Ser., A containing papers of a mathematical and physical character 130, 499\u2013513 (1931)","DOI":"10.1098\/rspa.1931.0019"},{"key":"479_CR32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-319-06569-4_2","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Nuynh, V.N., Pham Dinh, T.: DC programming and DCA for general DC programs. In: van Do, T., Thi, H.A.L., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering, pp. 15\u201335. Springer, Berlin (2014)"},{"key":"479_CR33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10957-018-1345-y","volume":"179","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Nuynh, V.N., Pham Dinh, T.: Convergence analysis of difference-of-convex algorithm with subanalytic data. J. Optim. Theory Appl. 179, 103\u2013126 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"479_CR34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","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, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"479_CR35","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","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. 169, 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"479_CR36","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0167-6377(96)00022-3","volume":"19","author":"HA Le Thi","year":"1996","unstructured":"Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Numerical solution for optimization over the efficient set by D.C. optimization algorithm. Oper. Res. Lett. 19, 117\u2013128 (1996)","journal-title":"Oper. Res. Lett."},{"key":"479_CR37","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s11081-015-9294-x","volume":"17","author":"T Lipp","year":"2016","unstructured":"Lipp, T., Boyd, S.: Variations and extension of the convex-concave procedure. Optim. Eng. 17, 263\u2013287 (2016)","journal-title":"Optim. Eng."},{"key":"479_CR38","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"479_CR39","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-319-06569-4_3","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"YS Niu","year":"2014","unstructured":"Niu, Y.S., Dinh, T.P.: DC programming approaches for BMI and QMI feasibility problems. In: van Do, T., Thi, H., Nguyen, N. (eds.) Advanced Computational Methods for Knowledge Engineering, pp. 37\u201363. Springer, Cham (2014)"},{"key":"479_CR40","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10898-019-00755-4","volume":"75","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W.: Proximal bundle methods for nonsmooth DC programming. J. Glob. Optim. 75, 523\u2013563 (2019)","journal-title":"J. Glob. Optim."},{"key":"479_CR41","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s11228-018-0497-0","volume":"27","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W., Tcheou, M.P.: An inertial algorithm for DC programming. Set-Valued Var. Anal. 27, 895\u2013919 (2019)","journal-title":"Set-Valued Var. Anal."},{"key":"479_CR42","doi-asserted-by":"crossref","first-page":"18368","DOI":"10.1073\/pnas.1318679110","volume":"110","author":"V Ozolin\u0161","year":"2013","unstructured":"Ozolin\u0161, V., Lai, R., Caflisch, R., Osher, S.: Compressed modes for variational problems in mathematics and physics. Proc. Natl. Acad. Sci. 110, 18368\u201318373 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"479_CR43","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. Vietnamica 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnamica"},{"key":"479_CR44","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: D.C. optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"479_CR45","first-page":"1","volume-title":"Transactions on Computational Intelligence XIII","author":"T Pham Dinh","year":"2014","unstructured":"Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. In: Nguyen, N.T., Thi, H.A.L. (eds.) Transactions on Computational Intelligence XIII, pp. 1\u201337. Springer, Berlin, Heidelberg (2014)"},{"key":"479_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0663-7","volume-title":"Optimization: Algorithms and Consistent Approximations","author":"E Polak","year":"1997","unstructured":"Polak, E.: Optimization: Algorithms and Consistent Approximations. Springer, New York (1997)"},{"key":"479_CR47","unstructured":"CVX Research, Inc.: CVX: Matlab software for disciplined convex programming, version 2.2. http:\/\/cvxr.com\/cvx (2020)"},{"key":"479_CR48","first-page":"249","volume-title":"Fermat Days 85: Mathematics for Optimization. North-Holland Mathematics Studies","author":"T Pham Dinh","year":"1986","unstructured":"Pham Dinh, T., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. In: Hiriart-Urruty, J.B. (ed.) Fermat Days 85: Mathematics for Optimization. North-Holland Mathematics Studies, vol. 129, pp. 249\u2013271. Norht-Holland Press, Amsterdam (1986)"},{"key":"479_CR49","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/moor.1.2.130","volume":"1","author":"SM Robinson","year":"1976","unstructured":"Robinson, S.M.: Regularity and stability for convex multivalued functions. Math. Oper. Res. 1, 130\u2013143 (1976)","journal-title":"Math. Oper. Res."},{"key":"479_CR50","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"479_CR51","unstructured":"Stingl, M.: On the solution of nonlinear semidefinite programs by augmented Lagrangian methods. Ph.D. thesis, Institute of Applied Mathematics II, Friedrech-Alexander University of Erlangen-Nuremberg, Erlangen, Germany (2006)"},{"key":"479_CR52","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-030-34910-3_7","volume-title":"Numerical Nonsmooth Optimization: State of the Art Algorithms","author":"AS Strekalovsky","year":"2020","unstructured":"Strekalovsky, A.S.: Local search for nonsmooth DC optimization with DC equality and inequality constraints. In: Bagirov, A.M., Gaudioso, M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S. (eds.) Numerical Nonsmooth Optimization: State of the Art Algorithms, pp. 229\u2013262. Springer, Cham (2020)"},{"key":"479_CR53","unstructured":"Strekalovsky, A.S.: On a global search in D.C. optimization problems. In: Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V., Posypkin, M (eds.) Optimization and Applications: OPTIMA 2019. Communications in Computer and Information Science, pp. 222\u2013236. Springer, Cham (2020)"},{"key":"479_CR54","first-page":"175","volume":"3","author":"AS Strekalovsky","year":"2021","unstructured":"Strekalovsky, A.S.: On global optimality conditions for d.c. minimization problems with d.c. constraints. J. Appl. Numer. Optim. 3, 175\u2013196 (2021)","journal-title":"J. Appl. Numer. Optim."},{"key":"479_CR55","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Todd, M.J., T\u00fctunc\u00fc, R.H.: SDPT3 \u2014 a Matlab software package for semidefinite programming, Version 1.3. Optim. Methods Softw. 11, 545\u2013581 (1999)","DOI":"10.1080\/10556789908805762"},{"key":"479_CR56","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fctunc\u00fc","year":"2003","unstructured":"T\u00fctunc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"479_CR57","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/21M1421660","volume":"15","author":"T Wu","year":"2022","unstructured":"Wu, T., Gu, X., Li, Z., Li, Z., Niu, J., Zeng, T.: Efficient boosted DC algorithm for nonconvex image restoration with rician noise. SIAM J. Imaging Sci. 15, 424\u2013454 (2022)","journal-title":"SIAM J. Imaging Sci."},{"key":"479_CR58","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/18.978730","volume":"48","author":"L Zheng","year":"2002","unstructured":"Zheng, L., Tse, D.: Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel. IEEE Trans. Inform. Theory 48, 359\u2013383 (2002)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00479-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00479-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00479-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:55:10Z","timestamp":1688489710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00479-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,15]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00479-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,4,15]]},"assertion":[{"value":"16 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2023","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 author has no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}