{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T07:48:04Z","timestamp":1778917684901,"version":"3.51.4"},"reference-count":48,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971466"],"award-info":[{"award-number":["11971466"]}],"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":["11991021"],"award-info":[{"award-number":["11991021"]}],"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":["11991020"],"award-info":[{"award-number":["11991020"]}],"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":["11688101"],"award-info":[{"award-number":["11688101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005151","name":"Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["ZDBS-LY-7022"],"award-info":[{"award-number":["ZDBS-LY-7022"]}],"id":[{"id":"10.13039\/501100005151","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,7,4]]},"DOI":"10.1080\/10556788.2020.1852236","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T07:25:11Z","timestamp":1606289111000},"page":"1205-1241","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":26,"title":["A class of smooth exact penalty function methods for optimization problems with orthogonality constraints"],"prefix":"10.1080","volume":"37","author":[{"given":"Nachuan","family":"Xiao","sequence":"first","affiliation":[{"name":"State Key Laboratory of Scientific and Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, People's Republic of China"},{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5705-0805","authenticated-orcid":false,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Scientific and Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, People's Republic of China"},{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Scientific and Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.908999"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2009.03.015"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-005-0179-9"},{"key":"CIT0004","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"Absil P.-A.","year":"2009"},{"key":"CIT0005","unstructured":"N. Bansal, X. Chen, and Z. Wang, Can we gain more from orthogonality regularizations in training deep networks?, in Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox and R. Garnett, eds., Curran Associates, New York, NY, 2018, pp. 4261\u20134271."},{"key":"CIT0006","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"Bertsekas D.P.","year":"2014"},{"issue":"1","key":"CIT0007","first-page":"1455","volume":"15","author":"Boumal N.","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"CIT0009","doi-asserted-by":"crossref","volume-title":"Variational Methods for the Solution of Problems of Equilibrium and Vibrations","author":"Courant R.","DOI":"10.1201\/b16924-2"},{"key":"CIT0010","unstructured":"X. Dai, L. Zhang, and A. Zhou, Adaptive step size strategy for orthogonality constrained line search methods, arXiv preprint arXiv:1906.02883, 2019."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895290954"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/16M1098759"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/18M1221679"},{"key":"CIT0014","unstructured":"D. Han and J. Kim, Unsupervised simultaneous orthogonal basis clustering feature selection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, IEEE, New York, NY, 2015, pp. 5016\u20135023."},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1137\/17M1142478"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0816-7"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032148"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.140.A1133"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-013-9740-x"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2868847"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1137\/130911032"},{"issue":"1","key":"CIT0024","first-page":"285","volume":"16","author":"Liu J.","year":"2015","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1137\/140971464"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1109\/78.984753"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2004.11.035"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"CIT0029","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"Z. Peng, M. Yan, and W. Yin, Parallel and distributed sparse optimization, in 2013 Asilomar Conference on Signals, Systems and Computers, IEEE, New York, NY, 2013, pp. 659\u2013646.","DOI":"10.1109\/ACSSC.2013.6810364"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1137\/15M1024950"},{"issue":"6","key":"CIT0032","first-page":"283","volume":"5","author":"Powell M.J.D.","year":"1969","journal-title":"Optimization"},{"key":"CIT0033","first-page":"283","volume":"0","author":"Powell M.J.D.","year":"1969","journal-title":"Optimization"},{"key":"CIT0034","unstructured":"B. Recht, C. Re, S. Wright, and F. Niu, Hogwild: A lock-free approach to parallelizing stochastic gradient descent, in Advances in Neural Information Processing Systems, IEEE, New York, NY, 2011, pp. 693\u2013701."},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1137\/0720042"},{"key":"CIT0036","volume-title":"Optimization Theory and Methods: Nonlinear Programming","volume":"1","author":"Sun W.","year":"2006"},{"key":"CIT0037","doi-asserted-by":"crossref","unstructured":"J. Tang and H. Liu, Unsupervised feature selection for linked social media data, in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, 2012, pp. 904\u2013912.","DOI":"10.1145\/2339530.2339673"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00599-2_45"},{"key":"CIT0039","unstructured":"P. Toint, Towards an efficient sparsity exploiting newton method for minimization, in Sparse Matrices and Their Uses, Iain S. Duff, Academic Press, London, 1981, pp. 57\u201388."},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0584-1"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-015-0061-0"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2006.01.030"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1137\/060661442"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1137\/080716293"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1145\/1499096.1499099"},{"key":"CIT0046","unstructured":"Y. Yang, H.T. Shen, Z. Ma, Z. Huang, and X. Zhou,  \u21132,1-norm regularized discriminative feature selection for unsupervised. Twenty-Second International Joint Conference on Artificial Intelligence, 2011."},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050012"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.07.064"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1852236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T08:38:42Z","timestamp":1674463122000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1852236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,24]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7,4]]}},"alternative-id":["10.1080\/10556788.2020.1852236"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1852236","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,24]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-08-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}