{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:13:05Z","timestamp":1784772785915,"version":"3.55.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1818700"],"award-info":[{"award-number":["1818700"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-19-1-2321"],"award-info":[{"award-number":["N00014-19-1-2321"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2006762"],"award-info":[{"award-number":["2006762"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2007814"],"award-info":[{"award-number":["2007814"]}],"id":[{"id":"10.13039\/100000083","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,3]]},"DOI":"10.1007\/s10107-021-01734-y","type":"journal-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T11:03:58Z","timestamp":1638443038000},"page":"57-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Ideal formulations for constrained convex optimization problems with indicator variables"],"prefix":"10.1007","volume":"192","author":[{"given":"Linchuan","family":"Wei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3668-0653","authenticated-orcid":false,"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simge","family":"K\u00fc\u00e7\u00fckyavuz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"3","key":"1734_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"MS Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M.S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3), 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1734_CR2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1287\/moor.2014.0673","volume":"40","author":"G Angulo","year":"2015","unstructured":"Angulo, G., Ahmed, S., Dey, S.S., Kaibel, V.: Forbidden vertices. Math. Oper. Res. 40(2), 350\u2013360 (2015)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1734_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10107-012-0602-3","volume":"136","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2), 233\u2013251 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1734_CR4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"1734_CR5","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Rank-one convexification for sparse regression. Optimization Online. http:\/\/www.optimization-online.org\/DB_HTML\/2019\/01\/7050.html. (2019)"},{"key":"1734_CR6","first-page":"1","volume":"3","author":"A Atamt\u00fcrk","year":"2021","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: convexification of L0 formulations. J. Mach. Learn. Res. 3, 1\u201343 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"1734_CR7","unstructured":"Bacci, T., Frangioni, A., Gentile, C., Tavlaridis-Gyparakis, K.: New MINLP formulations for the unit commitment problems with ramping constraints. Optimization Online. http:\/\/www.optimization-online.org\/DB_FILE\/2019\/10\/7426.pdf. (2019)"},{"key":"1734_CR8","doi-asserted-by":"crossref","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization. In: Numerical Analysis and Optimization, pp. 1\u201335. Springer (2015)","DOI":"10.1007\/978-3-319-17689-5_1"},{"key":"1734_CR9","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Cory-Wright, R., Pauphilet, J.: Mixed-projection conic optimization: A new paradigm for modeling rank constraints. arXiv preprint arXiv:2009.10395 (2020a)","DOI":"10.1287\/opre.2021.2182"},{"issue":"1","key":"1734_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/opre.2015.1436","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A.: OR Forum - An algorithmic approach to linear regression. Oper. Res. 64(1), 2\u201316 (2016)","journal-title":"Oper. Res."},{"issue":"2","key":"1734_CR11","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"issue":"4","key":"1734_CR12","first-page":"555","volume":"35","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Pauphilet, J., Van Parys, B., et al.: Sparse regression: scalable algorithms and empirical performance. Stat. Sci. 35(4), 555\u2013578 (2020b)","journal-title":"Stat. Sci."},{"key":"1734_CR13","first-page":"300","volume":"1","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Van Parys, B.: Sparse high-dimensional regression: Exact scalable algorithms and phase transitions. Ann. Statist. 1, 300\u2013323 (2020)","journal-title":"Ann. Statist."},{"issue":"3","key":"1734_CR14","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1214\/13-AOS1096","volume":"41","author":"J Bien","year":"2013","unstructured":"Bien, J., Taylor, J., Tibshirani, R.: A lasso for hierarchical interactions. Ann. Stat. 41(3), 1111 (2013)","journal-title":"Ann. Stat."},{"issue":"2","key":"1734_CR15","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/120878963","volume":"24","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Michalka, A.: Cutting-planes for optimization of convex functions over nonconvex sets. SIAM J. Opt. 24(2), 643\u2013677 (2014)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"1734_CR16","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1734_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10107-016-1045-z","volume":"162","author":"S Burer","year":"2017","unstructured":"Burer, S., K\u0131l\u0131n\u00e7-Karzan, F.: How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162(1\u20132), 393\u2013429 (2017)","journal-title":"Math. Program."},{"key":"1734_CR18","unstructured":"Carrizosa, E., Mortensen, L., Morales, D.R.: On linear regression models with hierarchical categorical variables. Tech. rep. (2020)"},{"key":"1734_CR19","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"issue":"6","key":"1734_CR20","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1002\/aic.14418","volume":"60","author":"A Cozad","year":"2014","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: Learning surrogate models for simulation-based optimization. AIChE J. 60(6), 2211\u20132227 (2014)","journal-title":"AIChE J."},{"key":"1734_CR21","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.compchemeng.2014.11.010","volume":"73","author":"A Cozad","year":"2015","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: A combined first-principles and data-driven approach to model building. Comput. Chem. Eng. 73, 116\u2013127 (2015)","journal-title":"Comput. Chem. Eng."},{"key":"1734_CR22","first-page":"1","volume":"15","author":"A Dedieu","year":"2021","unstructured":"Dedieu, A., Hazimeh, H., Mazumder, R.: Learning sparse classifiers: Continuous and mixed integer optimization perspectives. J. Mach. Learn. Res. 15, 1\u20134 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"1734_CR23","unstructured":"Dheeru, D., Karra\u00a0Taniskidou, E.: UCI machine learning repository (2017)"},{"issue":"3","key":"1734_CR24","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.orl.2019.03.010","volume":"47","author":"H Dong","year":"2019","unstructured":"Dong, H.: On integer and MPCC representability of affine sparsity. Oper. Res. Lett. 47(3), 208\u2013212 (2019)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"1734_CR25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-018-1283-3","volume":"176","author":"H Dong","year":"2019","unstructured":"Dong, H., Ahn, M., Pang, J.-S.: Structural properties of affine sparsity constraints. Math. Program. 176(1\u20132), 95\u2013135 (2019)","journal-title":"Math. Program."},{"key":"1734_CR26","unstructured":"Dong, H., Chen, K., Linderoth, J.: Regularization vs. relaxation: A conic optimization perspective of statistical variable selection. arXiv preprint arXiv:1510.06083 (2015)"},{"key":"1734_CR27","doi-asserted-by":"crossref","unstructured":"Dong, H., Linderoth, J.: On valid inequalities for quadratic programming with continuous variables and binary indicators. In: Goemans, M., Correa, J. (eds.) Integer Programming and Combinatorial Optimization, pp. 169\u2013180. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_15"},{"issue":"2","key":"1734_CR28","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Ann. Stat. 32(2), 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"issue":"456","key":"1734_CR29","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."},{"issue":"3","key":"1734_CR30","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1007\/s10589-015-9787-8","volume":"63","author":"A Frangioni","year":"2016","unstructured":"Frangioni, A., Furini, F., Gentile, C.: Approximated perspective relaxations: a project and lift approach. Comput. Opt. Appl. 63(3), 705\u2013735 (2016)","journal-title":"Comput. Opt. Appl."},{"key":"1734_CR31","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106, 225\u2013236 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1734_CR32","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.orl.2006.03.008","volume":"35","author":"A Frangioni","year":"2007","unstructured":"Frangioni, A., Gentile, C.: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35(2), 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1734_CR33","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.orl.2009.02.003","volume":"37","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C.: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. Oper. Res. Lett. 37(3), 206\u2013210 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"1734_CR34","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1287\/opre.1110.0930","volume":"59","author":"A Frangioni","year":"2011","unstructured":"Frangioni, A., Gentile, C., Grande, E., Pacifici, A.: Projected perspective reformulations with applications in design problems. Oper. Res. 59(5), 1225\u20131232 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"1734_CR35","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/moor.2018.0969","volume":"45","author":"A Frangioni","year":"2020","unstructured":"Frangioni, A., Gentile, C., Hungerford, J.: Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs. Math. Oper. Res. 45(1), 15\u201333 (2020)","journal-title":"Math. Oper. Res."},{"key":"1734_CR36","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"1734_CR37","unstructured":"Han, S., G\u00f3mez, A., Atamt\u00fcrk, A.: 2x2 convexifications for convex quadratic optimization with indicator variables. arXiv preprint arXiv:2004.07448 (2020)"},{"key":"1734_CR38","unstructured":"Hardy, G.H.: Course of Pure Mathematics. Courier Dover (1908). (Publications)"},{"key":"1734_CR39","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical learning with sparsity: the lasso and generalizations. In: Monographs on Statistics and Applied Probability, vol. 143. Chapman and Hall\/CRC (2015)","DOI":"10.1201\/b18401"},{"key":"1734_CR40","unstructured":"Hazimeh, H., Mazumder, R.: Learning hierarchical interactions at scale: a convex optimization approach. In: Chiappa, S. and Calandra, R., editors, Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machine Learning Research, pp. 1833\u20131843. PMLR"},{"key":"1734_CR41","doi-asserted-by":"crossref","unstructured":"Hazimeh, H., Mazumder, R., Saab, A.: Sparse regression at scale: branch-and-bound rooted in first-order optimization. arXiv preprint arXiv:2004.06152 (2020)","DOI":"10.1007\/s10107-021-01712-4"},{"key":"1734_CR42","doi-asserted-by":"crossref","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints. Comput. Opt. Appl. 52(2), 537\u2013558 (2012)","DOI":"10.1007\/s10589-011-9424-0"},{"key":"1734_CR43","doi-asserted-by":"crossref","unstructured":"Huang, J., Breheny, P., Ma, S.: A selective review of group selection in high-dimensional models. Stat. Sci. Rev. J. Inst. Math. Stat. 27(4),(2012)","DOI":"10.1214\/12-STS392"},{"key":"1734_CR44","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disopt.2016.04.008","volume":"24","author":"H Jeon","year":"2017","unstructured":"Jeon, H., Linderoth, J., Miller, A.: Quadratic cone cutting surfaces for quadratic programs with on-off constraints. Dis. Opt. 24, 32\u201350 (2017)","journal-title":"Dis. Opt."},{"key":"1734_CR45","doi-asserted-by":"crossref","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 345\u2013356. Springer. (2014)","DOI":"10.1007\/978-3-319-07557-0_29"},{"key":"1734_CR46","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Shojaie, A., Manzour, H., Wei, L.: Consistent second-order conic integer programming for learning Bayesian networks. arXiv preprint arXiv:2005.14346 (2020)"},{"issue":"1","key":"1734_CR47","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/ijoo.2019.0040","volume":"3","author":"H Manzour","year":"2021","unstructured":"Manzour, H., K\u00fc\u00e7\u00fckyavuz, S., Wu, H.-H., Shojaie, A.: Integer programming for learning directed acyclic graphs from continuous data. INFORMS J. Opt. 3(1), 46\u201373 (2021)","journal-title":"INFORMS J. Opt."},{"key":"1734_CR48","doi-asserted-by":"crossref","unstructured":"Miller, A.: Subset selection in regression. Chapman and Hall\/CRC (2002)","DOI":"10.1201\/9781420035933"},{"issue":"1\u20132","key":"1734_CR49","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10107-015-0866-5","volume":"155","author":"S Modaresi","year":"2016","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155(1\u20132), 575\u2013611 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"1734_CR50","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":"1734_CR51","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10107-015-0894-1","volume":"151","author":"P Pilanci","year":"2015","unstructured":"Pilanci, P., Wainwright, M.J., El Ghaoui, L.: Sparse learning via Boolean relaxations. Math. Program. 151, 63\u201387 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1734_CR52","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10107-008-0226-9","volume":"121","author":"J-PP Richard","year":"2010","unstructured":"Richard, J.-P.P., Tawarmalani, M.: Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Math. Program. 121(1), 61\u2013104 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"1734_CR53","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1007\/s10589-016-9832-2","volume":"64","author":"T Sato","year":"2016","unstructured":"Sato, T., Takano, Y., Miyashiro, R., Yoshise, A.: Feature subset selection for logistic regression via mixed integer optimization. Comput. Opt. Appl. 64(3), 865\u2013880 (2016)","journal-title":"Comput. Opt. Appl."},{"issue":"3","key":"1734_CR54","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"1734_CR55","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B Methodol., pp. 267\u2013288 (1996)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"issue":"1\u20132","key":"1734_CR56","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-018-1258-4","volume":"177","author":"JP Vielma","year":"2019","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177(1\u20132), 21\u201353 (2019)","journal-title":"Math. Program."},{"key":"1734_CR57","doi-asserted-by":"crossref","unstructured":"Wang, A.\u00a0L., K\u0131l\u0131n\u00e7-Karzan, F.: The generalized trust region subproblem: solution complexity and convex hull results. Forthcoming in Math. Program. (2020a)","DOI":"10.1007\/s10107-020-01560-8"},{"key":"1734_CR58","doi-asserted-by":"crossref","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: On convex hulls of epigraphs of QCQPs. In: Bienstock, D., Zambelli, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 419\u2013432. Cham. Springer International Publishing (2020b)","DOI":"10.1007\/978-3-030-45771-6_32"},{"key":"1734_CR59","doi-asserted-by":"crossref","unstructured":"Wang, A.\u00a0L., K\u0131l\u0131n\u00e7-Karzan, F.: On the tightness of SDP relaxations of QCQPs. Forthcoming in Math. Program. (2021)","DOI":"10.1007\/s10107-020-01589-9"},{"key":"1734_CR60","doi-asserted-by":"crossref","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: On the convexification of constrained quadratic optimization problems with indicator variables. In: Bienstock, D., Zambelli, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 433\u2013447. Cham. Springer International Publishing (2020)","DOI":"10.1007\/978-3-030-45771-6_33"},{"issue":"3","key":"1734_CR61","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1137\/15M1012232","volume":"27","author":"B Wu","year":"2017","unstructured":"Wu, B., Sun, X., Li, D., Zheng, X.: Quadratic convex reformulations for semicontinuous quadratic programming. SIAM J. Opt. 27(3), 1531\u20131553 (2017)","journal-title":"SIAM J. Opt."},{"issue":"4","key":"1734_CR62","doi-asserted-by":"crossref","first-page":"3359","DOI":"10.1137\/19M1245414","volume":"30","author":"W Xie","year":"2020","unstructured":"Xie, W., Deng, X.: Scalable algorithms for the sparse ridge regression. SIAM J. Opt. 30(4), 3359\u20133386 (2020)","journal-title":"SIAM J. Opt."},{"key":"1734_CR63","first-page":"894","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"4","key":"1734_CR64","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/ijoc.2014.0592","volume":"26","author":"X Zheng","year":"2014","unstructured":"Zheng, X., Sun, X., Li, D.: Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach. INFORMS J. Comput. 26(4), 690\u2013703 (2014)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01734-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01734-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01734-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T17:21:18Z","timestamp":1646846478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01734-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,2]]},"references-count":64,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1734"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01734-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,2]]},"assertion":[{"value":"29 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}