{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T19:30:44Z","timestamp":1724355044143},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"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":["11771038","11971052"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["Z190002"],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12011530155"],"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":[[2022,9]]},"DOI":"10.1007\/s10107-021-01719-x","type":"journal-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T16:15:48Z","timestamp":1634832948000},"page":"903-928","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Lagrange\u2013Newton algorithm for sparse nonlinear programming"],"prefix":"10.1007","volume":"195","author":[{"given":"Chen","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[]},{"given":"Houduo","family":"Qi","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4926-5929","authenticated-orcid":false,"given":"Ziyan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"issue":"3","key":"1719_CR1","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Optim. 23(3), 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1719_CR2","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/moor.2015.0722","volume":"41","author":"A Beck","year":"2015","unstructured":"Beck, A., Hallak, N.: On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms. Math. Oper. Res. 41(1), 196\u2013223 (2015)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1719_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10957-016-0934-x","volume":"170","author":"A Beck","year":"2016","unstructured":"Beck, A., Vaisbourd, Y.: The sparse principal component analysis problem: Optimality conditions and algorithms. J. Optim. Theory Appl. 170(1), 119\u2013143 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"1719_CR4","doi-asserted-by":"publisher","first-page":"2370","DOI":"10.1109\/TSP.2007.916124","volume":"56","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Gradient pursuits. IEEE Trans. Signal Process. 56(6), 2370\u20132382 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1719_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"1719_CR6","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath, T., Davies, M.E.: Normalized iterative hard thresholding: guaranteed stability and performance. IEEE J. Sel. Top. Signal Process. 4(2), 298\u2013309 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1719_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.frl.2014.12.008","volume":"13","author":"K Boudt","year":"2015","unstructured":"Boudt, K., Lu, W., Peeters, B.: Higher order comoments of multifactor models and asset allocation. Financ. Res. Lett. 13, 225\u2013233 (2015)","journal-title":"Financ. Res. Lett."},{"issue":"1","key":"1719_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10107-016-0986-6","volume":"160","author":"M \u010cervinka","year":"2016","unstructured":"\u010cervinka, M., Kanzow, C., Schwartz, A.: Constraint qualifications and optimality conditions for optimization problems with cardinality constraints. Math. Program. 160(1), 353\u2013377 (2016)","journal-title":"Math. Program."},{"key":"1719_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Gu, Q.: Fast Newton hard thresholding pursuit for sparsity constrained nonconvex optimization. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp. 757\u2013766 (2017)","DOI":"10.1145\/3097983.3098165"},{"issue":"1\u20132","key":"1719_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained $$l_2-l_p$$ minimization. Math. Program. 143(1\u20132), 371\u2013383 (2014)","journal-title":"Math. Program."},{"issue":"5","key":"1719_CR11","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1719_CR12","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1719_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and Redundant Representations","author":"M Elad","year":"2010","unstructured":"Elad, M.: Sparse and Redundant Representations. Springer, New York (2010)"},{"issue":"6","key":"1719_CR14","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/JPROC.2009.2037655","volume":"98","author":"M Elad","year":"2010","unstructured":"Elad, M., Figueiredo, M.A., Ma, Y.: On the role of sparse and redundant representations in image processing. Proc. IEEE 98(6), 972\u2013982 (2010)","journal-title":"Proc. IEEE"},{"issue":"456","key":"1719_CR15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its Oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"6","key":"1719_CR16","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S.: Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1719_CR17","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1287\/opre.2013.1170","volume":"61","author":"J Gao","year":"2013","unstructured":"Gao, J., Li, D.: Optimal cardinality constrained portfolio selection. Oper. Res. 61(3), 745\u2013761 (2013)","journal-title":"Oper. Res."},{"issue":"1","key":"1719_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"JY Gotoh","year":"2018","unstructured":"Gotoh, J.Y., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program 169(1), 141\u2013176 (2018)","journal-title":"Math. Program"},{"key":"1719_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"SP Han","year":"1976","unstructured":"Han, S.P.: Superlinearly convergent variable metric algorithms for general nonlinear programming problems. Math. Program. 11, 263\u2013282 (1976)","journal-title":"Math. Program."},{"key":"1719_CR20","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh, K., Kim, S.J., Boyd, S.: An interior-point method for large-scale $$\\ell _1$$-regularized logistic regression. J. Mach. Learn. Res. 8, 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"1719_CR21","unstructured":"Kyrillidis, A., Becker, S., Cevher, V., Koch, C.: Sparse projections onto the simplex. In: Proceedings of the 30th international conference on machine learning, Atlanta, Georgia, USA, 2013, vol.\u00a028, pp. 235\u2013243 (2013)"},{"key":"1719_CR22","unstructured":"Lu, Z.: Optimization over sparse symmetric sets via a nonmonotone projected gradient method. arXiv:1509.08581 (2015)"},{"issue":"4","key":"1719_CR23","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"106","key":"1719_CR24","first-page":"1","volume":"20","author":"Z Luo","year":"2019","unstructured":"Luo, Z., Sun, D., Toh, K.C., Xiu, N.: Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method. J. Mach. Learn. Res. 20(106), 1\u201325 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"1719_CR25","doi-asserted-by":"crossref","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D. Piecewise sequential quadratic programming for mathematical programs with nonlinear complementarity constraints. In: Migdalas, A., Pardalos, P.M., V\u00e4rbrand, P. (eds.) Multilevel Optimization: Algorithms and Applications. Nonconvex Optimization and Its Applications, vol\u00a020. Springer, Boston, MA (1998)","DOI":"10.1007\/978-1-4613-0307-7_9"},{"issue":"7","key":"1719_CR26","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1101\/gr.225302","volume":"12","author":"J Misra","year":"2002","unstructured":"Misra, J.: Interactive exploration of microarray gene expression patterns in a reduced dimensional space. Genome Res. 12(7), 1112\u20131120 (2002)","journal-title":"Genome Res."},{"issue":"2","key":"1719_CR27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1719_CR28","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"1719_CR29","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1214\/12-STS400","volume":"27","author":"SN Negahban","year":"2012","unstructured":"Negahban, S.N., Ravikumar, P., Wainwright, M.J., Yu, B., et al.: A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers. Stat. Sci. 27(4), 538\u2013557 (2012)","journal-title":"Stat. Sci."},{"issue":"1","key":"1719_CR30","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s10957-017-1166-4","volume":"175","author":"L Pan","year":"2017","unstructured":"Pan, L., Luo, Z., Xiu, N.: Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming. J. Optim. Theory Appl. 175(1), 104\u2013118 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"1719_CR31","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s11425-016-9010-x","volume":"60","author":"L Pan","year":"2017","unstructured":"Pan, L., Xiu, N., Fan, J.: Optimality conditions for sparse nonlinear programming. Sci. China Math. 60(5), 759\u2013776 (2017)","journal-title":"Sci. China Math."},{"issue":"4","key":"1719_CR32","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s40305-015-0101-3","volume":"3","author":"L Pan","year":"2015","unstructured":"Pan, L., Xiu, N., Zhou, S.: On solutions of sparsity constrained optimization. J. Oper. Res. Soc. China 3(4), 421\u2013439 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"2","key":"1719_CR33","first-page":"325","volume":"13","author":"L Pan","year":"2017","unstructured":"Pan, L., Zhou, S., Xiu, N., Qi, H.D.: Convergent iterative hard thresholding for sparsity and nonnegativity constrained optimization. Pacif. J. Optim. 13(2), 325\u2013353 (2017)","journal-title":"Pacif. J. Optim."},{"key":"1719_CR34","unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, pp. 40\u201344. IEEE (1993)"},{"key":"1719_CR35","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12, 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"12","key":"1719_CR36","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1719_CR37","doi-asserted-by":"crossref","unstructured":"Wang, J., Deng, Z., Zheng, T., So, A.M.C.: Sparse high-order portfolios via proximal DCA and SCA. In: ICASSP 2021\u20132021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5425\u20135429 (2021)","DOI":"10.1109\/ICASSP39728.2021.9414048"},{"key":"1719_CR38","unstructured":"Wilson, R.B.: A simplicial algorithm for concave programming. Ph.D. thesis, Graduate School of Business Administration, Harvard University (1963)"},{"key":"1719_CR39","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1080\/10556788.2015.1062891","volume":"31","author":"F Xu","year":"2016","unstructured":"Xu, F., Lu, Z., Xu, Z.: An efficient optimization approach for a cardinality-constrained index tracking problem. Optim. Methods Softw. 31, 258\u2013271 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1719_CR40","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), 536\u2013563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"166","key":"1719_CR41","first-page":"1","volume":"18","author":"X Yuan","year":"2018","unstructured":"Yuan, X., Li, P., Zhang, T.: Gradient hard thresholding pursuit. J. Mach. Learn. Res. 18(166), 1\u201343 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"1719_CR42","doi-asserted-by":"crossref","unstructured":"Yuan, X., Liu, Q.: Newton greedy pursuit: a quadratic approximation method for sparsity-constrained optimization. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 4122\u20134129 (2014)","DOI":"10.1109\/CVPR.2014.525"},{"issue":"12","key":"1719_CR43","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1109\/TPAMI.2017.2651813","volume":"39","author":"X Yuan","year":"2017","unstructured":"Yuan, X., Liu, Q.: Newton-type greedy selection methods for $$\\ell _0$$-constrained minimization. IEEE Trans. Pattern Anal. Mach. Intell. 39(12), 2437\u20132450 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1719_CR44","first-page":"1","volume":"22","author":"S Zhou","year":"2021","unstructured":"Zhou, S., Xiu, N., Qi, H.: Global and quadratic convergence of Newton hard-thresholding pursuit. J. Mach. Learn. Res. 22, 1\u201345 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1719_CR45","first-page":"76","volume":"5","author":"S Zhou","year":"2016","unstructured":"Zhou, S., Xiu, N., Wang, Y., Kong, L., Qi, H.D.: A null-space-based weighted $$\\ell _1$$ minimization approach to compressed sensing. Inf. Inference J. IMA 5(1), 76\u2013102 (2016)","journal-title":"Inf. Inference J. IMA"},{"issue":"3","key":"1719_CR46","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/s10618-010-0182-x","volume":"22","author":"T Zhou","year":"2011","unstructured":"Zhou, T., Tao, D., Wu, X.: Manifold elastic net: a unified framework for sparse dimension reduction. Data Min. Knowl. Disc. 22(3), 340\u2013371 (2011)","journal-title":"Data Min. Knowl. Disc."},{"issue":"2","key":"1719_CR47","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01719-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01719-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01719-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T01:07:49Z","timestamp":1666487269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01719-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,21]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1719"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01719-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,21]]},"assertion":[{"value":"27 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}