{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T19:11:09Z","timestamp":1773515469677,"version":"3.50.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"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":["11971239, 11671036, 11831002"],"award-info":[{"award-number":["11971239, 11671036, 11831002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11831002"],"award-info":[{"award-number":["11831002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10107-022-01794-8","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T14:47:26Z","timestamp":1648219646000},"page":"855-897","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An exact penalty approach for optimization with nonnegative orthogonality constraints"],"prefix":"10.1007","volume":"198","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8232-4604","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1420-4373","authenticated-orcid":false,"given":"Xiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-0671","authenticated-orcid":false,"given":"Zaiwen","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"1794_CR1","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"issue":"4","key":"1794_CR2","doi-asserted-by":"crossref","first-page":"3201","DOI":"10.1137\/18M121040X","volume":"29","author":"R Andreani","year":"2019","unstructured":"Andreani, R., Haeser, G., Secchin, L.D., Silva, P.J.: New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM J. Optim. 29(4), 3201\u20133230 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1794_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/15M1008488","volume":"26","author":"R Andreani","year":"2016","unstructured":"Andreani, R., Mart\u00ednez, J.M., Ramos, A., Silva, P.J.: A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26(1), 96\u2013110 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1794_CR4","doi-asserted-by":"crossref","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-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1794_CR5","doi-asserted-by":"crossref","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(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1794_CR6","doi-asserted-by":"crossref","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 gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"1794_CR7","doi-asserted-by":"crossref","first-page":"2423","DOI":"10.1137\/18M1181602","volume":"29","author":"R Bergmann","year":"2019","unstructured":"Bergmann, R., Herzog, R.: Intrinsic formulation of KKT conditions and constraint qualifications on smooth manifolds. SIAM J. Optim. 29(4), 2423\u20132444 (2019)","journal-title":"SIAM J. Optim."},{"key":"1794_CR8","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1996)"},{"key":"1794_CR9","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"issue":"2","key":"1794_CR10","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/JSTARS.2012.2194696","volume":"5","author":"JM Bioucasdias","year":"2012","unstructured":"Bioucasdias, J.M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., Chanussot, J.: Hyperspectral unmixing overview: geometrical, statistical, and sparse regression-based approaches. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 5(2), 354\u2013379 (2012)","journal-title":"IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens."},{"issue":"1\u20132","key":"1794_CR11","doi-asserted-by":"crossref","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(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1794_CR12","unstructured":"Boumal, N.: An introduction to optimization on smooth manifolds. Available online, Aug (2020)"},{"issue":"1","key":"1794_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Absil, P.A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2019)","journal-title":"IMA J. Numer. Anal."},{"key":"1794_CR14","unstructured":"Boutsidis, C., Drineas, P., Mahoney, M.W.: Unsupervised feature selection for the $$k$$-means clustering problem. In: NeurIPS, pp. 153\u2013161 (2009)"},{"issue":"4","key":"1794_CR15","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.patcog.2007.09.010","volume":"41","author":"C Boutsidis","year":"2008","unstructured":"Boutsidis, C., Gallopoulos, E.: SVD based initialization: a head start for nonnegative matrix factorization. Pattern Recogn. 41(4), 1350\u20131362 (2008)","journal-title":"Pattern Recogn."},{"issue":"1\u20132","key":"1794_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107-010-0408-0","volume":"133","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Lopez-Calva, G., Nocedal, J.: A line search exact penalty method using steering rules. Math. Program. 133(1\u20132), 39\u201373 (2012)","journal-title":"Math. Program."},{"key":"1794_CR17","doi-asserted-by":"crossref","unstructured":"Cai, D., Mei, Q., Han, J., Zhai, C.: Modeling hidden topics on document manifold. In: Proceedings of the 17th ACM CIKM, pp. 911\u2013920. ACM (2008)","DOI":"10.1145\/1458082.1458202"},{"key":"1794_CR18","doi-asserted-by":"crossref","unstructured":"Carson, T., Mixon, D.G., Villar, S.: Manifold optimization for k-means clustering. In: SampTA, pp. 73\u201377. IEEE (2017)","DOI":"10.1109\/SAMPTA.2017.8024388"},{"issue":"2","key":"1794_CR19","doi-asserted-by":"crossref","first-page":"507","DOI":"10.4310\/CMS.2008.v6.n2.a12","volume":"6","author":"KC Chang","year":"2008","unstructured":"Chang, K.C., Pearson, K., Zhang, T.: Perron-Frobenius theorem for nonnegative tensors. Commun. Math. Sci. 6(2), 507\u2013520 (2008)","journal-title":"Commun. Math. Sci."},{"key":"1794_CR20","unstructured":"Chen, F., Yang, Y., Xu, L., Zhang, T., Zhang, Y.: Big-data clustering. K-means or k-indicators? arXiv:1906.00938 (2019)"},{"issue":"3","key":"1794_CR21","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1137\/15M1028054","volume":"26","author":"X Chen","year":"2016","unstructured":"Chen, X., Lu, Z., Pong, T.K.: Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26(3), 1465\u20131492 (2016)","journal-title":"SIAM J. Optim."},{"key":"1794_CR22","doi-asserted-by":"crossref","unstructured":"Di Pillo, G: Exact penalty methods. In: Spedicato, E. (ed.) Algorithms for Continuous Optimization: The State of the Art. Springer Netherlands, Dordrecht, pp. 209\u2013253 (1994). https:\/\/doi.org\/10.1007\/978-94-009-0369-2_8","DOI":"10.1007\/978-94-009-0369-2_8"},{"issue":"1","key":"1794_CR23","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0323007","volume":"23","author":"G Di Pillo","year":"1985","unstructured":"Di Pillo, G., Grippo, L.: A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints. SIAM J. Control Optim. 23(1), 72\u201384 (1985)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1794_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591986","volume":"36","author":"G Di Pillo","year":"1986","unstructured":"Di Pillo, G., Grippo, L.: An exact penalty function method with global convergence properties for nonlinear programming problems. Math. Program. 36(1), 1\u201318 (1986)","journal-title":"Math. Program."},{"issue":"2","key":"1794_CR25","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/S1052623497321894","volume":"12","author":"G Di Pillo","year":"2002","unstructured":"Di Pillo, G., Lucidi, S.: An augmented Lagrangian function with improved exactness properties. SIAM J. Optim. 12(2), 376\u2013406 (2002)","journal-title":"SIAM J. Optim."},{"key":"1794_CR26","doi-asserted-by":"crossref","unstructured":"Ding, C., Li, T., Peng, W., Park, H.: Orthogonal nonnegative matrix t-factorizations for clustering. In: Proceedings of the 12th ACM SIGKDD, pp. 126\u2013135. ACM (2006)","DOI":"10.1145\/1150402.1150420"},{"issue":"3","key":"1794_CR27","doi-asserted-by":"crossref","first-page":"A1836","DOI":"10.1137\/19M1255069","volume":"42","author":"R Estrin","year":"2020","unstructured":"Estrin, R., Friedlander, M.P., Orban, D., Saunders, M.A.: Implementing a smooth exact penalty function for general constrained nonlinear optimization. SIAM J. Sci. Comput. 42(3), A1836\u2013A1859 (2020)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1794_CR28","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1137\/060675320","volume":"18","author":"MP Friedlander","year":"2008","unstructured":"Friedlander, M.P., Tseng, P.: Exact regularization of convex programs. SIAM J. Optim. 18(4), 1326\u20131350 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1794_CR29","doi-asserted-by":"crossref","first-page":"A1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao, B., Liu, X., Yuan, Y.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), A1949\u2013A1983 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1794_CR30","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/090750391","volume":"52","author":"JB Hiriart-Urruty","year":"2010","unstructured":"Hiriart-Urruty, J.B., Seeger, A.: A variational approach to copositive matrices. SIAM Rev. 52(4), 593\u2013629 (2010)","journal-title":"SIAM Rev."},{"issue":"4","key":"1794_CR31","doi-asserted-by":"crossref","first-page":"A2239","DOI":"10.1137\/18M121112X","volume":"41","author":"J Hu","year":"2019","unstructured":"Hu, J., Jiang, B., Lin, L., Wen, Z., Yuan, Y.: Structured quasi-Newton methods for optimization with orthogonality constraints. SIAM J. Sci. Comput. 41(4), A2239\u2013A2269 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"1794_CR32","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1137\/17M1142478","volume":"39","author":"J Hu","year":"2018","unstructured":"Hu, J., Milzarek, A., Wen, Z., Yuan, Y.: Adaptive quadratically regularized Newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181\u20131207 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"1794_CR33","doi-asserted-by":"crossref","first-page":"2284","DOI":"10.1137\/15M1048021","volume":"26","author":"B Jiang","year":"2016","unstructured":"Jiang, B., Liu, Y.F., Wen, Z.: $$l_p$$-norm regularization algorithms for optimization over permutation matrices. SIAM J. Optim. 26(4), 2284\u20132313 (2016)","journal-title":"SIAM J. Optim."},{"key":"1794_CR34","unstructured":"Jiang, B., Meng, X., Wen, Z., Chen, X.: An exact penalty approach for optimization with nonnegative orthogonality constraints. arXiv: 1907.12424v2 (2020)"},{"issue":"1","key":"1794_CR35","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/79.974727","volume":"19","author":"N Keshava","year":"2002","unstructured":"Keshava, N., Mustard, J.F.: Spectral unmixing. IEEE Signal Process. Mag. 19(1), 44\u201357 (2002)","journal-title":"IEEE Signal Process. Mag."},{"key":"1794_CR36","unstructured":"Krizhevsky, A., Hinton, G.: Learning multiple layers of features from tiny images (2009)"},{"key":"1794_CR37","doi-asserted-by":"crossref","unstructured":"Kuang, D., Ding, C., Park, H.: Symmetric nonnegative matrix factorization for graph clustering. In: Proceedings of the 2012 SDM, pp. 106\u2013117. SIAM (2012)","DOI":"10.1137\/1.9781611972825.10"},{"issue":"6266","key":"1794_CR38","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1126\/science.aab3050","volume":"350","author":"BM Lake","year":"2015","unstructured":"Lake, B.M., Salakhutdinov, R., Tenenbaum, J.B.: Human-level concept learning through probabilistic program induction. Science 350(6266), 1332\u20131338 (2015)","journal-title":"Science"},{"issue":"7","key":"1794_CR39","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/LSP.2014.2371895","volume":"22","author":"B Li","year":"2015","unstructured":"Li, B., Zhou, G., Cichocki, A.: Two efficient algorithms for approximately orthogonal nonnegative matrix factorization. IEEE Signal Process. Lett. 22(7), 843\u2013846 (2015)","journal-title":"IEEE Signal Process. Lett."},{"key":"1794_CR40","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10107-018-1342-9","volume":"179","author":"X Li","year":"2020","unstructured":"Li, X., Sun, D., Toh, K.C.: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope. Math. Program. 179, 419\u2013446 (2020)","journal-title":"Math. Program."},{"key":"1794_CR41","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s00245-019-09564-3","volume":"82","author":"C Liu","year":"2020","unstructured":"Liu, C., Boumal, N.: Simple algorithms for optimization on Riemannian manifolds with constraints. Appl. Math. Opt. 82, 949\u2013981 (2020)","journal-title":"Appl. Math. Opt."},{"key":"1794_CR42","doi-asserted-by":"crossref","unstructured":"Luo, D., Ding, C., Huang, H., Li, T.: Non-negative Laplacian embedding. In: 2009 Ninth ICDM, pp. 337\u2013346. IEEE (2009)","DOI":"10.1109\/ICDM.2009.74"},{"key":"1794_CR43","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"issue":"1","key":"1794_CR44","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02592205","volume":"75","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D., Wu, S.Q.: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints. Math. Program. 75(1), 19\u201376 (1996)","journal-title":"Math. Program."},{"key":"1794_CR45","doi-asserted-by":"crossref","unstructured":"Luo, Z.Q., Sturm, J.F.: Error bounds for quadratic systems. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization. Springer US, Boston, MA, pp. 383\u2013404 (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_16","DOI":"10.1007\/978-1-4757-3216-0_16"},{"issue":"4","key":"1794_CR46","doi-asserted-by":"crossref","first-page":"2916","DOI":"10.1137\/18M1181249","volume":"29","author":"A Milzarek","year":"2019","unstructured":"Milzarek, A., Xiao, X., Cen, S., Wen, Z., Ulbrich, M.: A stochastic semismooth Newton method for nonsmooth nonconvex optimization. SIAM J. Optim. 29(4), 2916\u20132948 (2019)","journal-title":"SIAM J. Optim."},{"key":"1794_CR47","unstructured":"Nene, S.A., Nayar, S.K., Murase, H.: Columbia object image library (coil-100) (1996)"},{"key":"1794_CR48","doi-asserted-by":"crossref","unstructured":"Nister, D., Stewenius, H.: Scalable recognition with a vocabulary tree. In: CVPR\u201906, vol.\u00a02, pp. 2161\u20132168. IEEE (2006)","DOI":"10.1109\/CVPR.2006.264"},{"issue":"2","key":"1794_CR49","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/16M1107863","volume":"39","author":"J Pan","year":"2018","unstructured":"Pan, J., Ng, M.K.: Orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization. SIAM J. Matrix Anal. Appl. 39(2), 856\u2013875 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1794_CR50","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.neucom.2014.02.018","volume":"141","author":"F Pompili","year":"2014","unstructured":"Pompili, F., Gillis, N., Absil, P.A., Glineur, F.: Two algorithms for orthogonal nonnegative matrix factorization with application to clustering. Neurocomputing 141, 15\u201325 (2014)","journal-title":"Neurocomputing"},{"issue":"1","key":"1794_CR51","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh, J., Rendl, F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18(1), 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"key":"1794_CR52","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.patrec.2019.10.019","volume":"128","author":"S Sieranoja","year":"2019","unstructured":"Sieranoja, S., Fr\u00e4nti, P.: Fast and general density peaks clustering. Pattern Recogn. Lett. 128, 551\u2013558 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"1794_CR53","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming, vol. 1. Springer Science & Business Media, New York (2006)"},{"key":"1794_CR54","doi-asserted-by":"crossref","unstructured":"Wang, S., Chang, T.H., Cui, Y., Pang, J.S.: Clustering by orthogonal non-negative matrix factorization: a sequential non-convex penalty approach. In: ICASSP, pp. 5576\u20135580 (2019)","DOI":"10.1109\/ICASSP.2019.8683466"},{"key":"1794_CR55","doi-asserted-by":"crossref","first-page":"5273","DOI":"10.1109\/TSP.2021.3102106","volume":"69","author":"S Wang","year":"2021","unstructured":"Wang, S., Chang, T.H., Cui, Y., Pang, J.S.: Clustering by orthogonal NMF model and non-convex penalty optimization. IEEE Trans. Signal Process. 69, 5273\u20135288 (2021)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1794_CR56","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142(1), 397\u2013434 (2013)","journal-title":"Math. Program."},{"key":"1794_CR57","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2016","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76, 364\u2013389 (2016)","journal-title":"J. Sci. Comput."},{"key":"1794_CR58","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. arXiv:1711.06831 (2017)"},{"issue":"2","key":"1794_CR59","first-page":"415","volume":"10","author":"WH Yang","year":"2014","unstructured":"Yang, W.H., Zhang, L.H., Song, R.: Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pac. J. Optim. 10(2), 415\u2013434 (2014)","journal-title":"Pac. J. Optim."},{"issue":"8","key":"1794_CR60","doi-asserted-by":"crossref","first-page":"1760","DOI":"10.1109\/TKDE.2012.118","volume":"25","author":"Y Yang","year":"2012","unstructured":"Yang, Y., Yang, Y., Shen, H.T., Zhang, Y., Du, X., Zhou, X.: Discriminative nonnegative spectral clustering with out-of-sample extension. IEEE Trans. Knowl. Data Eng. 25(8), 1760\u20131771 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"1794_CR61","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TNN.2010.2041361","volume":"21","author":"Z Yang","year":"2010","unstructured":"Yang, Z., Oja, E.: Linear and nonlinear projective nonnegative matrix factorization. IEEE Trans. Neural Netw. 21(5), 734\u2013749 (2010)","journal-title":"IEEE Trans. Neural Netw."},{"key":"1794_CR62","doi-asserted-by":"crossref","unstructured":"Yoo, J., Choi, S.: Orthogonal nonnegative matrix factorization: multiplicative updates on Stiefel manifolds. In: IDEAL, pp. 140\u2013147. Springer (2008)","DOI":"10.1007\/978-3-540-88906-9_18"},{"key":"1794_CR63","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Nonnegative sparse PCA. In: NeurIPS, pp. 1561\u20131568 (2007)","DOI":"10.7551\/mitpress\/7503.003.0200"},{"issue":"4","key":"1794_CR64","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1794_CR65","doi-asserted-by":"crossref","first-page":"A3091","DOI":"10.1137\/17M1141904","volume":"40","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Liu, H., Wen, Z., Zhang, S.: A sparse completely positive relaxation of the modularity maximization for community detection. SIAM J. Sci. Comput. 40(5), A3091\u2013A3120 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"1794_CR66","unstructured":"Zhang, K., Zhang, S., Liu, J., Wang, J., Zhang, J.: Greedy orthogonal pivoting algorithm for non-negative matrix factorization. In: ICML, pp. 7493\u20137501. PMLR (2019)"},{"issue":"2","key":"1794_CR67","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: a new data clustering algorithm and its applications. Data Min. Knowl. Disc. 1(2), 141\u2013182 (1997)","journal-title":"Data Min. Knowl. Disc."},{"issue":"12","key":"1794_CR68","doi-asserted-by":"crossref","first-page":"5412","DOI":"10.1109\/TIP.2014.2363423","volume":"23","author":"F Zhu","year":"2014","unstructured":"Zhu, F., Wang, Y., Fan, B., Xiang, S., Meng, G., Pan, C.: Spectral unmixing via data-guided sparsity. IEEE Trans. Image Process. 23(12), 5412\u20135427 (2014)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01794-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01794-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01794-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:43:52Z","timestamp":1726879432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01794-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1794"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01794-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,25]]},"assertion":[{"value":"17 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}