{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T16:45:25Z","timestamp":1770137125081,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,6]],"date-time":"2014-06-06T00:00:00Z","timestamp":1402012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11590-014-0757-3","type":"journal-article","created":{"date-parts":[[2014,6,5]],"date-time":"2014-06-05T19:57:47Z","timestamp":1401998267000},"page":"57-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving $$\\ell _0$$ \u2113 0 -penalized problems with simple constraints via the Frank\u2013Wolfe reduced dimension method"],"prefix":"10.1007","volume":"9","author":[{"given":"Giampaolo","family":"Liuzzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Rinaldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,6]]},"reference":[{"issue":"9","key":"757_CR1","doi-asserted-by":"crossref","first-page":"2345","DOI":"10.1109\/TIP.2010.2047910","volume":"19","author":"M Afonso","year":"2010","unstructured":"Afonso, M., Bioucas-Dias, J., Figueiredo, M.: Fast image recovery using variable splitting and constrained optimization. IEEE Trans. Image Process. 19(9), 2345\u20132356 (2010)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"757_CR2","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TIP.2010.2076294","volume":"20","author":"M Afonso","year":"2011","unstructured":"Afonso, M., Bioucas-Dias, J., Figueiredo, M.: An augmented lagrangian based method for the constrained formulation of imaging inverse problems. IEEE Trans. Image Process. 20(3), 681\u2013695 (2011)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"757_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-threshold algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(2), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"757_CR4","first-page":"121","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Progr. 74, 121\u2013140 (1996)","journal-title":"Math. Progr."},{"issue":"1","key":"757_CR5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34\u201381 (2009)","journal-title":"SIAM Rev."},{"key":"757_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/757584614","volume":"22","author":"J Cadima","year":"1995","unstructured":"Cadima, J., Jolliffe, I.: Loadings and correlations in the interpretation of principal components. J. Appl. Stat. 22, 203\u2013214 (1995)","journal-title":"J. Appl. Stat."},{"issue":"2","key":"757_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10208-004-0162-x","volume":"6","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J.: Quantitative robust uncertainty principles and optimally sparse decompositions. Found. Comput. Math. 6(2), 227\u2013254 (2006)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"757_CR8","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"757_CR9","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"key":"757_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition basis pursuit. SIAM Rev. 43, 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"757_CR11","first-page":"1269","volume":"9","author":"A D\u2019Aspremont","year":"2008","unstructured":"D\u2019Aspremont, A., Bach, F.R., El Ghaoui, L.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"757_CR12","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, N.I., Lanckriet, G.R.G.: A direct formulation for sparce pca using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"issue":"7","key":"757_CR13","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"MAT Figueiredo","year":"2009","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"757_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"issue":"3","key":"757_CR15","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for l1-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"757_CR16","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: http:\/\/www.caam.rice.edu\/~optimization\/l1\/fpc\/ , (2012)"},{"key":"757_CR17","unstructured":"Hein, M., B\u00fchler, T.: An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse pca. In: Advances in Neural Information Processing Systems, pp. 847\u2013855 (2010)"},{"key":"757_CR18","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the lasso. J. Comput. Graph. Stat. 12, 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"key":"757_CR19","first-page":"517","volume":"11","author":"M Journe\u00e9","year":"2010","unstructured":"Journe\u00e9, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"757_CR20","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"S-J Kim","year":"2007","unstructured":"Kim, S.-J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for large-scale l1-regularized least squares. IEEE J. Select. Topics Signal Process. 1(4), 606\u2013617 (2007)","journal-title":"IEEE J. Select. Topics Signal Process."},{"key":"757_CR21","doi-asserted-by":"crossref","unstructured":"Luss, R., Teboulle, M.: Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Rev. 55(1), 65\u201398 (2013)","DOI":"10.1137\/110839072"},{"key":"757_CR22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-99789-1_13","volume-title":"Applied Mathematics and Parallel Computing Festschrift for Klaus Ritter","author":"OL Mangasarian","year":"1996","unstructured":"Mangasarian, O.L.: Machine learning via polyhedral concave minimization. In: Fischer, H., Riedmueller, B., Schaeffler, S. (eds.) Applied Mathematics and Parallel Computing Festschrift for Klaus Ritter, pp. 175\u2013188. Physica-Verlag, Germany (1996)"},{"key":"757_CR23","doi-asserted-by":"crossref","unstructured":"Moghaddam, B., Weiss, Y., Avidan, S.: Generalized spectral bounds for sparse lda. In: ICML \u201906 Proceedings of the 23rd International Conference on Machine Learning, pp. 641\u2013648 (2006)","DOI":"10.1145\/1143844.1143925"},{"issue":"2","key":"757_CR24","doi-asserted-by":"crossref","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."},{"key":"757_CR25","doi-asserted-by":"crossref","unstructured":"Rinaldi, F.: Concave programming for finding sparse solutions to problems with convex constraints. Optim. Methods Softw. 26(6), 971\u2013992 (2011)","DOI":"10.1080\/10556788.2010.511668"},{"issue":"3","key":"757_CR26","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10589-008-9202-9","volume":"46","author":"F Rinaldi","year":"2010","unstructured":"Rinaldi, F., Schoen, F., Sciandrone, M.: Concave programming for minimizing the zero-norm over polyhedral sets. Comput. Optim. Appl. 46(3), 467\u2013486 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"757_CR27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.compbiolchem.2005.08.006","volume":"29","author":"A Riva","year":"2005","unstructured":"Riva, A., Carpentier, A.-S., Torr\u00e9sani, B., H\u00e9naut, A.: Comments on selected fundamental aspects of microarray analysis. Comput. Biol. Chem. 29(5), 319\u2013336 (2005)","journal-title":"Comput. Biol. Chem."},{"issue":"6","key":"757_CR28","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","volume":"99","author":"H Shen","year":"2008","unstructured":"Shen, H., Huang, J.Z.: Sparse principal component analysis via regularized low rank matrix approximation. J. Multivar. Anal. 99(6), 1015\u20131034 (2008)","journal-title":"J. Multivar. Anal."},{"key":"757_CR29","doi-asserted-by":"crossref","unstructured":"Sriperumbudur, B.K., Torres, D.A., Lanckriet, G.R.G.: Sparse eigen methods by dc programming. In: Proceedings of the 24th International Conference on Machine Learning, pp. 831\u2013838 (2007)","DOI":"10.1145\/1273496.1273601"},{"issue":"1","key":"757_CR30","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"757_CR31","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston, J., Elisseef, A., Sch\u00f6lkopf, B.: Use of the zero norm with linear models and kernel methods. J. Mach. Learn. Res. 3, 1439\u20131461 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"757_CR32","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/S0895479899359631","volume":"23","author":"Z Zhang","year":"2002","unstructured":"Zhang, Z., Zha, H., Simon, H.: Low rank approximations with sparse factors i: basic algorithms and error analysis. SIAM J. Matrix Anal. Appl. 23(3), 706\u2013727 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"757_CR33","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0757-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0757-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0757-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T10:26:23Z","timestamp":1716805583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0757-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,6]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["757"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0757-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,6]]}}}