{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:40:32Z","timestamp":1740123632849,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11671337"],"award-info":[{"award-number":["11671337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10915-022-01873-0","type":"journal-article","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T22:02:35Z","timestamp":1654725755000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Geometric Proximal Gradient Method for Sparse Least Squares Regression with Probabilistic Simplex Constraint"],"prefix":"10.1007","volume":"92","author":[{"given":"Guiyun","family":"Xiao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5134-3500","authenticated-orcid":false,"given":"Zheng-Jian","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,8]]},"reference":[{"key":"1873_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ (2008)"},{"key":"1873_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"P-A Absil","year":"2012","unstructured":"Absil, P.-A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22, 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"key":"1873_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-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1873_CR4","doi-asserted-by":"publisher","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":"1873_CR5","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont Massachusetts (1999)"},{"key":"1873_CR6","doi-asserted-by":"crossref","unstructured":"Bioucas-Dias, J. M., Figueiredo, M. A. T.: Alternating direction algorithms for constrained sparse regression: Application to hyperspectral unmixing. In: 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing, pp. 1\u20134 (2010)","DOI":"10.1109\/WHISPERS.2010.5594963"},{"key":"1873_CR7","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":"1873_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge, UK (2004)"},{"key":"1873_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.4208\/eajam.080310.200910a","volume":"1","author":"X Chen","year":"2011","unstructured":"Chen, X., Ching, W.K., Chen, X.S., Cong, Y., Tsing, N.K.: Construction of probabilistic Boolean networks from a prescribed transition probability matrix: A maximum entropy rate approach. East Asian J. Appl. Math. 1, 132\u2013154 (2011)","journal-title":"East Asian J. Appl. Math."},{"key":"1873_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4208\/eajam.030511.060911a","volume":"2","author":"X Chen","year":"2012","unstructured":"Chen, X., Jiang, H., Ching, W.K.: On construction of sparse probabilistic Boolean networks. East Asian J. Appl. Math. 2, 1\u201318 (2012)","journal-title":"East Asian J. Appl. Math."},{"key":"1873_CR11","unstructured":"Ching, W. K., Chen, X., Tsing, N. K., Leung, H. Y.: A heuristic method for generating probabilistic Boolean networks from a prescribed transition probability matrix. In: Proc. 2nd Symposium on Optimization and Systems Biology (OSB\u201908), Lijiang, China, October 31\u2013November 3, pp. 271\u2013278 (2008)"},{"key":"1873_CR12","first-page":"551","volume":"2009","author":"WK Ching","year":"2009","unstructured":"Ching, W.K., Cong, Y.: A new optimization model for the construction of Markov chains. International Joint Conference on Computational Sciences and Optimization 2009, 551\u2013555 (2009)","journal-title":"International Joint Conference on Computational Sciences and Optimization"},{"key":"1873_CR13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566649.001.0001","volume-title":"Inverse Eigenvalue Problems: Theory, Algorithms, and Applications","author":"MT Chu","year":"2005","unstructured":"Chu, M.T., Golub, G.H.: Inverse Eigenvalue Problems: Theory, Algorithms, and Applications. Oxford University Press, Oxford, UK (2005)"},{"key":"1873_CR14","doi-asserted-by":"publisher","first-page":"1881","DOI":"10.3934\/jimo.2018127","volume":"15","author":"KK Deng","year":"2019","unstructured":"Deng, K.K., Peng, Z., Chen, J.L.: Sparse probabilistic Boolean network problems: A partial proximal-type operator splitting method. Journal of Industrial & Management Optimization 15, 1881\u20131896 (2019)","journal-title":"Journal of Industrial & Management Optimization"},{"key":"1873_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3233\/RDA-2012-0086","volume":"4","author":"JW Gu","year":"2013","unstructured":"Gu, J.W., Ching, W.K., Siu, T.K., Zheng, H.: On modeling credit defaults: a probabilistic Boolean network approach. Risk and Decision Analysis 4, 119\u2013129 (2013)","journal-title":"Risk and Decision Analysis"},{"key":"1873_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/b18401","volume-title":"Statistical Learning with Sparsity: the Lasso and Generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical Learning with Sparsity: the Lasso and Generalizations. CRC Press, Boca Raton, FL (2015)"},{"key":"1873_CR17","doi-asserted-by":"crossref","unstructured":"Iordache, M., Bioucas-Dias, J., Plaza, A.: Unmixing sparse hyperspectral mixtures. 2009 IEEE International Geoscience and Remote Sensing Symposium, pp. IV-85\u2013IV-88 (2009)","DOI":"10.1109\/IGARSS.2009.5417368"},{"issue":"11","key":"1873_CR18","doi-asserted-by":"publisher","first-page":"4484","DOI":"10.1109\/TGRS.2012.2191590","volume":"50","author":"M Iordache","year":"2012","unstructured":"Iordache, M., Bioucas-Dias, J.M., Plaza, A.: Total variation spatial regularization for sparse hyperspectral unmixing. IEEE Trans. Geosci. Remote Sens. 50(11), 4484\u20134502 (2012)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"1873_CR19","doi-asserted-by":"crossref","unstructured":"Li, J., Bioucas-Dias, J. M.: Minimum volume simplex analysis: A fast algorithm to unmix hyperspectral data. In: 2008 IEEE International Geoscience and Remote Sensing Symposium, pp. III-250\u2013III-253 (2008)","DOI":"10.1109\/IGARSS.2008.4779330"},{"key":"1873_CR20","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1137\/18M1207752","volume":"29","author":"MX Lin","year":"2019","unstructured":"Lin, M.X., Liu, Y.-J., Sun, D.F., Toh, K.-C.: Efficient sparse semismooth Newton methods for the clustered Lasso problem. SIAM J. Optim. 29, 2026\u20132052 (2019)","journal-title":"SIAM J. Optim."},{"key":"1873_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I-Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I-Basic Theory. Springer, Berlin (2006)"},{"key":"1873_CR22","doi-asserted-by":"crossref","unstructured":"Moussaoui, S., Idier, J., Chouzenoux, E.: Primal dual interior point optimization for penalized least squares estimation of abundance maps in hyperspectral imaging. In: 2012 4th Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS), pp. 1\u20134, (2012)","DOI":"10.1109\/WHISPERS.2012.6874293"},{"key":"1873_CR23","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"1873_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"J-B: Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: J-B: Variational Analysis. Springer, Berlin (1998)"},{"key":"1873_CR25","doi-asserted-by":"publisher","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":"1873_CR26","doi-asserted-by":"crossref","unstructured":"Salehani, Y. E., Gazor, S., Kim, I., Yousefi, S.: Sparse hyperspectral unmixing via arctan approximation of L0 norm. In: 2014 IEEE Geoscience and Remote Sensing Symposium, pp. 2930\u20132933 (2014)","DOI":"10.1109\/IGARSS.2014.6947090"},{"key":"1873_CR27","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1002\/nla.2001","volume":"22","author":"YW Wen","year":"2015","unstructured":"Wen, Y.W., Wang, M., Cao, Z.Y., Cheng, X.Q., Ching, W.K., Vassiliadis, V.S.: Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Booelan networks. Numer. Linear Algebra Appl. 22, 883\u2013899 (2015)","journal-title":"Numer. Linear Algebra Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01873-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-01873-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01873-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T08:51:05Z","timestamp":1656060665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-01873-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,8]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1873"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-01873-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2022,6,8]]},"assertion":[{"value":"27 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2022","order":4,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability (software application or custom code)"}}],"article-number":"22"}}