{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:33:40Z","timestamp":1772789620643,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T00:00:00Z","timestamp":1568764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T00:00:00Z","timestamp":1568764800000},"content-version":"vor","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":[[2020,2]]},"DOI":"10.1007\/s11590-019-01482-1","type":"journal-article","created":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T04:24:41Z","timestamp":1568780681000},"page":"19-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Feature selection in SVM via polyhedral k-norm"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7041","authenticated-orcid":false,"given":"Manlio","family":"Gaudioso","sequence":"first","affiliation":[]},{"given":"E.","family":"Gorgone","sequence":"additional","affiliation":[]},{"given":"J.-B.","family":"Hiriart-Urruty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,18]]},"reference":[{"issue":"1\u20132","key":"1482_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(97)00115-1","volume":"209","author":"E Amaldi","year":"1998","unstructured":"Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theor. Comput. Sci. 209(1\u20132), 237\u2013260 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1482_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.ejor.2015.09.051","volume":"250","author":"P Bertolazzi","year":"2016","unstructured":"Bertolazzi, P., Felici, G., Festa, P., Fiscon, G., Weitschek, E.: Integer programming models for feature selection: new extensions and a randomized solution algorithm. Eur. J. Oper. Res. 250(2), 389\u2013399 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1482_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.10.2.209","volume":"10","author":"PS Bradley","year":"1998","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Feature selection via mathematical programming. INFORMS J. Comput. 10(2), 209\u2013217 (1998)","journal-title":"INFORMS J. Comput."},{"key":"1482_CR4","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Shavlik, J., (ed.) Machine Learning Proceedings of the Fifteenth International Conference (ICML \u201998). Morgan Kaufmann, San Francisco, California, pp. 82\u201390 (1998)"},{"key":"1482_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801389","volume-title":"An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods","author":"N Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press, Cambridge (2000)"},{"issue":"6","key":"1482_CR6","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1137\/0327068","volume":"27","author":"G Di Pillo","year":"1989","unstructured":"Di Pillo, G., Grippo, L.: Exact penalty functions in constrained optimization. SIAM J. Control Optim. 27(6), 1333\u20131360 (1989)","journal-title":"SIAM J. Control Optim."},{"key":"1482_CR7","first-page":"845","volume":"5","author":"JG Dy","year":"2004","unstructured":"Dy, J.G., Brodley, C.E., Wrobel, S.: Feature selection for unsupervised learning. J. Mach. Learn. Res. 5, 845\u2013889 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"12","key":"1482_CR8","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Signal Process. 57(12), 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1482_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2017.06.001","volume":"87","author":"M Gaudioso","year":"2017","unstructured":"Gaudioso, M., Gorgone, E., Labb\u00e9, M., Rodr\u00edguez-Ch\u00eda, A.M.: Lagrangian relaxation for SVM feature selection. Comput. Oper. Res. 87, 137\u2013145 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1482_CR10","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.2017.0873","volume":"43","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso, M., Giallombardo, G., Miglionico, G.: Minimizing piecewise-concave functions over polytopes. Math. Oper. Res. 43(2), 580\u2013597 (2018)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1482_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10898-017-0568-z","volume":"71","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso, M., Giallombardo, G., Miglionico, G., Bagirov, A.M.: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. J. Glob. Optim. 71(1), 37\u201355 (2018)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1482_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. Ser. B 169(1), 141\u2013176 (2018)","journal-title":"Math. Program. Ser. B"},{"key":"1482_CR13","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"1482_CR14","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 (2015)"},{"key":"1482_CR15","doi-asserted-by":"crossref","unstructured":"Hempel, A.B., Goulart, P.J.: A novel method for modelling cardinality and rank constraints. In: 53rd IEEE Conference on Decision and Control, Los Angeles, CA, USA December 15\u201317, pp. 4322\u20134327 (2014)","DOI":"10.1109\/CDC.2014.7040063"},{"key":"1482_CR16","first-page":"37","volume-title":"Generalized Differentiability\/Duality and Optimization for Problems Deling with Differences of Convex Functions, Lecture Notes in Economic and Mathematical Systems","author":"J-B Hiriart-Urruty","year":"1986","unstructured":"Hiriart-Urruty, J.-B.: Generalized Differentiability\/Duality and Optimization for Problems Deling with Differences of Convex Functions, Lecture Notes in Economic and Mathematical Systems, vol. 256, pp. 37\u201370. Springer, Berlin (1986)"},{"issue":"1","key":"1482_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s002110050109","volume":"70","author":"J-B Hiriart-Urruty","year":"1995","unstructured":"Hiriart-Urruty, J.-B., Ye, D.: Sensitivity analysis of all eigevalues of a symmetric matrix. Numer. Math. 70(1), 45\u201372 (1995)","journal-title":"Numer. Math."},{"key":"1482_CR18","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. J. Glob. Optim. 68, 501\u2013535 (2017)","journal-title":"J. Glob. Optim."},{"key":"1482_CR19","first-page":"23","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Dinh, T.P.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. J. Glob. Optim. 133, 23\u201346 (2005)","journal-title":"J. Glob. Optim."},{"key":"1482_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Le Thi","year":"2008","unstructured":"Le Thi, H.A., Le, H.M., Nguyen, V.V., Dinh, T.P.: A DC programming approach for feature selection in support vector machines learning. Adv. Data Anal. Classif. 2, 259\u2013278 (2008)","journal-title":"Adv. Data Anal. Classif."},{"key":"1482_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.ins.2014.03.110","volume":"279","author":"S Maldonado","year":"2014","unstructured":"Maldonado, S., P\u00e9rez, J., Weber, R., Labb\u00e9, M.: Feature selection for support vector machines via mixed integer linear programming. Inf. Sci. 279, 163\u2013175 (2014)","journal-title":"Inf. Sci."},{"key":"1482_CR22","volume-title":"Nonlinear Programming","author":"OL Mangasarian","year":"1969","unstructured":"Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)"},{"issue":"1\u20133","key":"1482_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01585173","volume":"62","author":"ML Overton","year":"1993","unstructured":"Overton, M.L., Womersley, R.S.: Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Program. 62(1\u20133), 321\u2013357 (1993)","journal-title":"Math. Program."},{"key":"1482_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10107-015-0894-1","volume":"151","author":"M Pilanci","year":"2015","unstructured":"Pilanci, M., Wainwright, M.J., El Ghaoui, L.: Sparse learning via Boolean relaxations. Math. Program. Ser. B 151, 63\u201387 (2015)","journal-title":"Math. Program. Ser. B"},{"key":"1482_CR25","doi-asserted-by":"publisher","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, 467\u2013486 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"1482_CR26","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1008277314050","volume":"12","author":"AS Strekalovsky","year":"1998","unstructured":"Strekalovsky, A.S.: Global optimality conditions for nonconvex optimization. J. Glob. Optim. 12, 415\u2013434 (1998)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1482_CR27","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1137\/16M1059333","volume":"27","author":"E Soubies","year":"2017","unstructured":"Soubies, E., Blanc-F\u00e9raud, L., Aubert, G.: A unified view of exact continuous penalties for $$\\ell _2$$-$$\\ell _0$$ minimization. SIAM J. Optim. 27(3), 2034\u20132060 (2017)","journal-title":"SIAM J. Optim."},{"key":"1482_CR28","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, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"1482_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of the Statistical Learning Theory","author":"V Vapnik","year":"1995","unstructured":"Vapnik, V.: The Nature of the Statistical Learning Theory. Springer, Berlin (1995)"},{"key":"1482_CR30","first-page":"589","volume":"16","author":"L Wang","year":"2006","unstructured":"Wang, L., Zhu, J., Zou, H.: The doubly regularized support vector machine. Stat. Sin. 16, 589\u2013615 (2006)","journal-title":"Stat. Sin."},{"key":"1482_CR31","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02139472","volume":"2","author":"GA Watson","year":"1992","unstructured":"Watson, G.A.: Linear best approximation using a class of polyhedral norms. Numer. Algorithms 2, 321\u2013336 (1992)","journal-title":"Numer. Algorithms"},{"key":"1482_CR32","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston, J., Elisseeff, A., Sch\u00f6lkopf, B., Tipping, M.: 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":"1","key":"1482_CR33","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"SJ Wright","year":"2012","unstructured":"Wright, S.J.: Accelerated block-cordinate relaxation for regularized optimization. SIAM J. Optim. 22(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1482_CR34","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/110827144","volume":"24","author":"B Wu","year":"2014","unstructured":"Wu, B., Ding, C., Sun, D., Toh, K.-C.: On the Moreau\u2013Yosida regularization of the vector $$k$$-norm related functions. SIAM J. Optim. 24(2), 766\u2013794 (2014)","journal-title":"SIAM J. Optim."},{"key":"1482_CR35","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. Ser. B 67, 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. Ser. B"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01482-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01482-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01482-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T16:49:25Z","timestamp":1721753365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01482-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,18]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1482"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01482-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,18]]},"assertion":[{"value":"10 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}