{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:24:29Z","timestamp":1777127069906,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T00:00:00Z","timestamp":1505260800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10957-017-1166-4","type":"journal-article","created":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T14:27:52Z","timestamp":1505312872000},"page":"104-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming"],"prefix":"10.1007","volume":"175","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8422-8376","authenticated-orcid":false,"given":"Lili","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,13]]},"reference":[{"key":"1166_CR1","doi-asserted-by":"crossref","unstructured":"Liu, J., Chen, J., Ye, J.: Large-scale sparse logistic regression. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 547\u2013556. ACM (2009)","DOI":"10.1145\/1557019.1557082"},{"issue":"8","key":"1166_CR2","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh, K., Kim, S.J., Boyd, S.P.: An interior-point method for large-scale \n                        $$l_1$$\n                        \n                            \n                                            \n                                \n                                    l\n                                    1\n                                \n                            \n                        \n                    -regularized logistic regression. J. Mach. Learn. Res. 8(8), 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"1166_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74(2), 121\u2013140 (1996)","journal-title":"Math. Program."},{"issue":"3","key":"1166_CR4","doi-asserted-by":"crossref","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":"4","key":"1166_CR5","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1007\/s10898-012-9853-z","volume":"56","author":"J Gao","year":"2013","unstructured":"Gao, J., Li, D.: A polynomial case of the cardinality-constrained quadratic optimization problem. J. Glob. Optim. 56(4), 1441\u20131455 (2013)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1166_CR6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1111\/j.1467-9965.2006.00262.x","volume":"16","author":"D Li","year":"2006","unstructured":"Li, D., Sun, X., Wang, J.: Optimal lot solution to cardinality constrained mean\u2013variance formulation for portfolio selection. Math. Finance 16(1), 83\u2013101 (2006)","journal-title":"Math. Finance"},{"issue":"2","key":"1166_CR7","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/10556788.2015.1062891","volume":"31","author":"F Xu","year":"2015","unstructured":"Xu, F., Lu, Z., Xu, Z.: An efficient optimization approach for a cardinality-constrained index tracking problem. Optim. Method Softw. 31(2), 258\u2013271 (2015)","journal-title":"Optim. Method Softw."},{"issue":"6","key":"1166_CR8","doi-asserted-by":"crossref","first-page":"3466","DOI":"10.1109\/TIT.2013.2245716","volume":"59","author":"T Blumensath","year":"2013","unstructured":"Blumensath, T.: Compressed sensing with nonlinear observations and related nonlinear optimization problems. IEEE Trans. Inf. Theory 59(6), 3466\u20133474 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1166_CR9","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1166_CR10","doi-asserted-by":"crossref","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"},{"issue":"10","key":"1166_CR11","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Proc. Lett. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Proc. Lett."},{"key":"1166_CR12","unstructured":"Chen, S., Donoho, D.: Basis pursuit. In: 1994 Conference Record of the Twenty-Eighth Asilomar Conference on Signals, Systems and Computers, 1994, vol.\u00a01, pp. 41\u201344. IEEE (1994)"},{"issue":"1\u20132","key":"1166_CR13","doi-asserted-by":"crossref","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 \n                        $$L_2-L_p$$\n                        \n                            \n                                            \n                                \n                                    \n                                        L\n                                        2\n                                    \n                                    -\n                                    \n                                        L\n                                        p\n                                    \n                                \n                            \n                        \n                     minimization. Math. Program. 143(1\u20132), 371\u2013383 (2014)","journal-title":"Math. Program."},{"issue":"456","key":"1166_CR14","doi-asserted-by":"crossref","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."},{"key":"1166_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.laa.2014.09.018","volume":"465","author":"L Kong","year":"2015","unstructured":"Kong, L., Sun, J., Tao, J., Xiu, N.: Sparse recovery on Euclidean Jordan algebras. Linear Algebra Appl. 465, 65\u201387 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1166_CR16","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"22","key":"1166_CR17","doi-asserted-by":"crossref","first-page":"5777","DOI":"10.1109\/TSP.2013.2281030","volume":"61","author":"YB Zhao","year":"2013","unstructured":"Zhao, Y.B.: RSP-based analysis for sparsest and least \n                        $$l_1$$\n                        \n                            \n                                            \n                                \n                                    l\n                                    1\n                                \n                            \n                        \n                    -norm solutions to underdetermined linear systems. IEEE Trans. Signal Proc. 61(22), 5777\u20135788 (2013)","journal-title":"IEEE Trans. Signal Proc."},{"issue":"1","key":"1166_CR18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10208-013-9161-0","volume":"14","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Luke, D.R., Phan, H.M., Wang, X.: Restricted normal cones and sparsity optimization with affine constraints. Found. Comput. Math. 14(1), 63\u201383 (2014)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1166_CR19","doi-asserted-by":"crossref","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":"1166_CR20","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.2015.0722","volume":"41","author":"A Beck","year":"2016","unstructured":"Beck, A., Hallak, N.: On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms. Math. Oper. Res. 41(1), 196\u2013223 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1166_CR21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"O Burdakov","year":"2016","unstructured":"Burdakov, O., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type constraints and a regularization method. SIAM J. Optim. 26(1), 397\u2013425 (2016)","journal-title":"SIAM J. Optim."},{"key":"1166_CR22","doi-asserted-by":"crossref","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, 353\u2013377 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1166_CR23","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s40305-015-0107-x","volume":"3","author":"X Li","year":"2015","unstructured":"Li, X., Song, W.: The first-order necessary conditions for sparsity constrained optimization. J. Oper. Res. Soc. China 3(4), 521\u2013535 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"4","key":"1166_CR24","doi-asserted-by":"crossref","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."},{"key":"1166_CR25","unstructured":"Lu, Z.: Optimization over sparse symmetric sets via a nonmonotone projected gradient method. \n                        arXiv:1509.08581v3\n                        \n                     (2015)"},{"issue":"4","key":"1166_CR26","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s40305-015-0101-3","volume":"3","author":"LL Pan","year":"2015","unstructured":"Pan, L.L., Xiu, N.H., Zhou, S.L.: On solutions of sparsity constrained optimization. J. Oper. Res. Soc. China 3(4), 421\u2013439 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"1166_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43(1), 1\u201322 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1166_CR28","doi-asserted-by":"crossref","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."},{"issue":"3","key":"1166_CR29","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"issue":"3","key":"1166_CR30","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2001","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11(3), 647\u2013674 (2001)","journal-title":"SIAM J. Optim."},{"key":"1166_CR31","first-page":"1385","volume":"7","author":"M Heiler","year":"2006","unstructured":"Heiler, M., Schn\u00f6rr, C.: Learning sparse representations by non-negative matrix factorization and sequential cone programming. J. Mach. Learn. Res. 7, 1385\u20131407 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"1166_CR32","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.: Variational Analysis. Springer, Berlin (1998)"},{"key":"1166_CR33","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia, PA (1990)"},{"key":"1166_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, Berlin (2000)"},{"key":"1166_CR35","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ (2015)"},{"issue":"2","key":"1166_CR36","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s11228-006-0033-5","volume":"15","author":"ML Flegel","year":"2007","unstructured":"Flegel, M.L., Kanzow, C., Outrata, J.V.: Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints. Set-Valued Anal. 15(2), 139\u2013162 (2007)","journal-title":"Set-Valued Anal."},{"issue":"1","key":"1166_CR37","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10957-009-9518-3","volume":"142","author":"A Moldovan","year":"2009","unstructured":"Moldovan, A., Pellegrini, L.: On regularity for constrained extremum problems. Part 1: sufficient optimality conditions. J. Optim. Theory Appl. 142(1), 147\u2013163 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1166_CR38","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10957-009-9521-8","volume":"142","author":"A Moldovan","year":"2009","unstructured":"Moldovan, A., Pellegrini, L.: On regularity for constrained extremum problems. Part 2: necessary optimality conditions. J. Optim. Theory Appl. 142(1), 165\u2013183 (2009)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-017-1166-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1166-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1166-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T11:40:34Z","timestamp":1506944434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-017-1166-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,13]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1166"],"URL":"https:\/\/doi.org\/10.1007\/s10957-017-1166-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,13]]}}}