{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:18:33Z","timestamp":1762377513859,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"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":["12171027"],"award-info":[{"award-number":["12171027"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,4]]},"DOI":"10.1007\/s10957-024-02381-x","type":"journal-article","created":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:03:03Z","timestamp":1707764583000},"page":"130-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints"],"prefix":"10.1007","volume":"201","author":[{"given":"Xi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xinrong","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-8289","authenticated-orcid":false,"given":"Chao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,12]]},"reference":[{"key":"2381_CR1","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.isatra.2019.08.042","volume":"98","author":"BT An","year":"2020","unstructured":"An, B.T., Zhao, Z.B., Wang, S.B., Chen, S.W., Chen, X.F.: Sparsity-assisted bearing fault diagnosis using multiscale period group lasso. ISA Trans. 98, 338\u2013348 (2020)","journal-title":"ISA Trans."},{"key":"2381_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"2381_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"178","author":"A Beck","year":"2017","unstructured":"Beck, A., Hallak, N.: Optimization problems involving group sparsity terms. Math. Program. 178, 1\u201329 (2017)","journal-title":"Math. Program."},{"key":"2381_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A Berman","year":"1994","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia (1994)"},{"key":"2381_CR5","doi-asserted-by":"crossref","first-page":"2294","DOI":"10.1137\/140985639","volume":"8","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X.J.: Linearly constrained non-Lipschitz optimization for image restoration. SIAM J. Imaging Sci. 8, 2294\u20132322 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"2381_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-021-01124-w","author":"XJ Chen","year":"2022","unstructured":"Chen, X.J., Pan, L.L., Xiu, N.H.: Solution sets of three sparse optimization problems for multivariate regression. J. Glob. Optim. (2022). https:\/\/doi.org\/10.1007\/s10898-021-01124-w","journal-title":"J. Glob. Optim."},{"key":"2381_CR7","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1137\/18M1166511","volume":"29","author":"XJ Chen","year":"2019","unstructured":"Chen, X.J., Toint, Ph.L., Wang, H.: Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities. SIAM J. Optim. 29, 874\u2013903 (2019)","journal-title":"SIAM J. Optim."},{"key":"2381_CR8","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1587\/transfun.E92.A.708","volume":"92","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Phan, A.H.: Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE T. Fund. Electr. 92, 708\u2013721 (2009)","journal-title":"IEICE T. Fund. Electr."},{"key":"2381_CR9","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","volume":"33","author":"C Deng","year":"2011","unstructured":"Deng, C., He, X., Han, J., Huang, T.S.: Graph regularized non-negative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33, 1548\u20131560 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2381_CR10","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"DL Donoho","year":"2003","unstructured":"Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via $$\\ell ^{1}$$ minimization. Proc. Natl. Acad. Sci. USA 100, 2197\u20132202 (2003)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2381_CR11","doi-asserted-by":"crossref","first-page":"4810","DOI":"10.1109\/TIP.2015.2468177","volume":"24","author":"C F\u00e9votte","year":"2015","unstructured":"F\u00e9votte, C., Dobigeon, C.: Nonlinear hyperspectral unmixing with robust nonnegative matrix factorization. IEEE Trans. Image Process. 24, 4810\u20134819 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"2381_CR12","doi-asserted-by":"crossref","first-page":"3757","DOI":"10.1109\/TIE.2015.2417501","volume":"62","author":"ZW Gao","year":"2015","unstructured":"Gao, Z.W., Cecati, C., Ding, S.X.: A survey of fault diagnosis and fault-tolerant techniques-part I: fault diagnosis with model based and signal-based approaches. IEEE Trans. Ind. Electron. 62, 3757\u20133767 (2015)","journal-title":"IEEE Trans. Ind. Electron."},{"key":"2381_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.patcog.2015.07.008","volume":"49","author":"XX Han","year":"2016","unstructured":"Han, X.X., Clemmensen, L.: Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis. Pattern Recognit. 49, 43\u201354 (2016)","journal-title":"Pattern Recognit."},{"key":"2381_CR14","doi-asserted-by":"crossref","unstructured":"Hoyer, P.O.: Non-negative sparse coding. In: 2002 IEEE Workshop on Neural Networks for Signal Processing, pp. 557\u2013565 (2002)","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"2381_CR15","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s10107-022-01794-8","volume":"198","author":"B Jiang","year":"2023","unstructured":"Jiang, B., Meng, X., Wen, Z.W., Chen, X.J.: An exact penalty approach for optimization with nonnegative orthogonality constraints. Math. Program. 198, 855\u2013897 (2023)","journal-title":"Math. Program."},{"key":"2381_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s101070050047","volume":"85","author":"C Kanzow","year":"1999","unstructured":"Kanzow, C., Qi, H.D.: A QP-free constrained Newton-type method for variational inequality problems. Math. Program. 85, 81\u2013106 (1999)","journal-title":"Math. Program."},{"key":"2381_CR17","doi-asserted-by":"crossref","unstructured":"Kundu, S., Sarker, G.: A new RBFN with modified optimal clustering algorithm for clear and occluded fingerprint identification. In: 2016 2nd International Conference on Control, Instrumentation, Energy and Communication, pp. 125\u2013129 (2016)","DOI":"10.1109\/CIEC.2016.7513668"},{"key":"2381_CR18","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1002\/apj.1669","volume":"8","author":"XB Li","year":"2013","unstructured":"Li, X.B., Yang, Y.P., Zhang, W.D.: Fault detection method for non-Gaussian processes based on non-negative matrix factorization. Asia-Pacific J. Chem. Eng. 8, 362\u2013370 (2013)","journal-title":"Asia-Pacific J. Chem. Eng."},{"key":"2381_CR19","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"CJ Lin","year":"2007","unstructured":"Lin, C.J.: Projected gradient methods for nonnegative matrix factorization. Neural Comput. 19, 2756\u20132779 (2007)","journal-title":"Neural Comput."},{"key":"2381_CR20","first-page":"7","volume":"51","author":"WX Liu","year":"2006","unstructured":"Liu, W.X., Zheng, N.N., You, Q.B.: Nonnegative matrix factorization and its applications in pattern recognition. Chin. Sci. Bull. 51, 7\u201318 (2006)","journal-title":"Chin. Sci. Bull."},{"key":"2381_CR21","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"YF Liu","year":"2016","unstructured":"Liu, Y.F., Ma, S.Q., Dai, Y.H., Zhang, S.Z.: A smoothing SQP framework for a class of composite minimization over polyhedron. Math. Program. 158, 467\u2013500 (2016)","journal-title":"Math. Program."},{"key":"2381_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"LL Pan","year":"2021","unstructured":"Pan, L.L., Chen, X.J.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Imaging Sci. 14, 1\u201325 (2021)","journal-title":"SIAM J. Imaging Sci."},{"key":"2381_CR23","first-page":"325","volume":"13","author":"LL Pan","year":"2017","unstructured":"Pan, L.L., Zhou, S.L., Xiu, N.H., Qi, H.D.: A convergent iterative hard thresholding for sparsity and nonnegativity constrained optimization. Pac. J. Optim. 13, 325\u2013353 (2017)","journal-title":"Pac. J. Optim."},{"key":"2381_CR24","doi-asserted-by":"crossref","first-page":"101765","DOI":"10.1109\/ACCESS.2021.3097216","volume":"9","author":"LL Pan","year":"2021","unstructured":"Pan, L.L., Zhu, X.Z.: An Armijo-type hard thresholding algorithm for joint sparse recovery. IEEE Access. 9, 101765\u2013101772 (2021)","journal-title":"IEEE Access."},{"key":"2381_CR25","first-page":"1457","volume":"5","author":"OP Patrik","year":"2004","unstructured":"Patrik, O.P.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"2381_CR26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.laa.2005.06.025","volume":"416","author":"VP Pauca","year":"2006","unstructured":"Pauca, V.P., Piper, J., Plemmons, R.J.: Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl. 416, 29\u201347 (2006)","journal-title":"Linear Algebra Appl."},{"key":"2381_CR27","doi-asserted-by":"crossref","unstructured":"Peharz, R., Stark, M., Pernkopf, F.: Sparse nonnegative matrix factorization using $$L_{0}$$-constraints. In: 2010 IEEE International Workshop on Machine Learning for Signal Processing, pp. 83\u201388 (2010)","DOI":"10.1109\/MLSP.2010.5589219"},{"key":"2381_CR28","first-page":"1","volume":"34","author":"QM Pham","year":"2018","unstructured":"Pham, Q.M., Hao, D.N., Sahoo, S.K., Tang, D.: Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem. Inverse Probl. 34, 1\u201316 (2018)","journal-title":"Inverse Probl."},{"key":"2381_CR29","doi-asserted-by":"crossref","first-page":"3991","DOI":"10.1016\/j.laa.2012.04.033","volume":"438","author":"G Plemmons","year":"2013","unstructured":"Plemmons, G.: Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis. Linear Algebra Appl. 438, 3991\u20134007 (2013)","journal-title":"Linear Algebra Appl."},{"key":"2381_CR30","doi-asserted-by":"crossref","first-page":"4282","DOI":"10.1109\/TGRS.2011.2144605","volume":"49","author":"YT Qian","year":"2011","unstructured":"Qian, Y.T., Jia, S., Zhou, J., Robles-Kelly, A.: Hyperspectral unmixing via $$L_{1\/2}$$ sparsity-constrained nonnegative matrix factorization. IEEE Trans. Geosci. Remote Sens. 49, 4282\u20134297 (2011)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"2381_CR31","doi-asserted-by":"crossref","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)"},{"key":"2381_CR32","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.procs.2018.10.531","volume":"144","author":"J Takano","year":"2018","unstructured":"Takano, J., Toshiaki, O.: Harmonic mean similarity based quantum annealing for $$k$$-means. Proc. Comput. Sci. 144, 298\u2013305 (2018)","journal-title":"Proc. Comput. Sci."},{"key":"2381_CR33","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/TASL.2006.885253","volume":"15","author":"T Virtanen","year":"2007","unstructured":"Virtanen, T.: Monaural sound source separation by nonnegative matrix factorization with temporal continuity and sparseness criteria. IEEE Trans. Audio Speech Lang. Process. 15, 1066\u20131074 (2007)","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"2381_CR34","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1109\/TNNLS.2019.2905261","volume":"31","author":"R Wang","year":"2021","unstructured":"Wang, R., Xiu, N.H., Zhang, C.: Greedy projected gradient-Newton method for sparse logistic regression. IEEE Trans. Neural Netw. Learn. 31, 527\u2013538 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn."},{"key":"2381_CR35","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright, J., Yang, A.Y., Ganesh, A., Sastry, S.S., Yi, M.: Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31, 210\u2013227 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2381_CR36","doi-asserted-by":"crossref","first-page":"6348","DOI":"10.1109\/TNNLS.2018.2830761","volume":"29","author":"WH Wu","year":"2018","unstructured":"Wu, W.H., Jia, Y.H., Kwong, S., Hou, J.H.: Pairwise constraint propagation-induced symmetric nonnegative matrix factorization. IEEE Trans. Neural Netw. Learn. Syst. 29, 6348\u20136361 (2018)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2381_CR37","first-page":"3505212","volume":"70","author":"XC Xiu","year":"2021","unstructured":"Xiu, X.C., Fan, J., Yang, Y., Liu, W.Q.: Fault detection using structured joint sparse nonnegative matrix factorization. IEEE Trans. Instrum. Meas. 70, 3505212 (2021)","journal-title":"IEEE Trans. Instrum. Meas."},{"key":"2381_CR38","unstructured":"Yang, J.C., Yu, K., Gong, Y.H., Huang, T.: Linear spatial pyramid matching using sparse coding for image classification. In: 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1794\u20131801 (2009)"},{"key":"2381_CR39","volume-title":"Projections on Convex Sets in Hilbert Space and Spectral Theory","author":"EH Zarantonello","year":"1971","unstructured":"Zarantonello, E.H.: Projections on Convex Sets in Hilbert Space and Spectral Theory. Academic Press, New York (1971)"},{"key":"2381_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/18M119611X","volume":"30","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Chen, X.J.: A smoothing active set method for linearly constrained non-Lipschitz nonconvex optimization. SIAM J. Optim. 30, 1\u201330 (2020)","journal-title":"SIAM J. Optim."},{"key":"2381_CR41","doi-asserted-by":"crossref","first-page":"A2633","DOI":"10.1137\/130930212","volume":"36","author":"C Zhang","year":"2014","unstructured":"Zhang, C., Jing, L.P., Xiu, N.H.: A new active set method for nonnegative matrix factorization. SIAM J. Sci. Comput. 36, A2633\u2013A2653 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"2381_CR42","first-page":"3505212","volume":"71","author":"X Zhang","year":"2023","unstructured":"Zhang, X., Xiu, X.C., Zhang, C.: Structured joint sparse orthogonal nonnegative matrix factorization for fault detection. IEEE Trans. Instrum. Meas. 71, 3505212 (2023)","journal-title":"IEEE Trans. Instrum. Meas."},{"key":"2381_CR43","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1109\/TKDE.2012.217","volume":"25","author":"Z Zhang","year":"2013","unstructured":"Zhang, Z., Zhao, M.B., Chow, T.W.S.: Binary- and multi-class group sparse canonical correlation analysis for feature extraction and classification. IEEE Trans. Knowl. Data Eng. 25, 2192\u20132205 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2381_CR44","doi-asserted-by":"crossref","first-page":"2928","DOI":"10.1109\/TSP.2012.2190410","volume":"60","author":"GX Zhou","year":"2012","unstructured":"Zhou, G.X., Cichocki, A., Xie, S.L.: Fast nonnegative matrix\/tensor factorization based on low-rank approximation. IEEE Trans. Signal Process. 60, 2928\u20132940 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"2381_CR45","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.acha.2022.06.002","volume":"61","author":"SL Zhou","year":"2022","unstructured":"Zhou, S.L.: Gradient projection Newton pursuit for sparsity constrained optimization. Appl. Comput. Harmon. Anal. 61, 75\u2013100 (2022)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2381_CR46","first-page":"1","volume":"22","author":"SL Zhou","year":"2021","unstructured":"Zhou, S.L., Xiu, N.H., Qi, H.D.: Global and quadratic convergence of Newton hard-thresholding pursuit. J. Math. Learn. Res. 22, 1\u201345 (2021)","journal-title":"J. Math. Learn. Res."},{"key":"2381_CR47","doi-asserted-by":"crossref","first-page":"5412","DOI":"10.1109\/TIP.2014.2363423","volume":"23","author":"FY Zhu","year":"2014","unstructured":"Zhu, F.Y., Wang, Y., Fan, B., Xiang, S.M., Meng, G.F.: Spectral unmixing via data-guided sparsity. IEEE Trans. Image Process. 23, 5412\u20135427 (2014)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02381-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02381-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02381-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T03:35:02Z","timestamp":1731296102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02381-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,12]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2381"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02381-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,2,12]]},"assertion":[{"value":"21 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}