{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:13:07Z","timestamp":1784772787427,"version":"3.55.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,1,20]],"date-time":"2024-01-20T00:00:00Z","timestamp":1705708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,20]],"date-time":"2024-01-20T00:00:00Z","timestamp":1705708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Early Postdoc Mobility Fellowship SNSF","award":["P2ELP2-195149"],"award-info":[{"award-number":["P2ELP2-195149"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-22-1-0365"],"award-info":[{"award-number":["FA9550-22-1-0365"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10107-023-02047-y","type":"journal-article","created":{"date-parts":[[2024,1,20]],"date-time":"2024-01-20T10:02:28Z","timestamp":1705744948000},"page":"533-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Constrained optimization of rank-one functions with indicator variables"],"prefix":"10.1007","volume":"208","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9095-2686","authenticated-orcid":false,"given":"Soroosh","family":"Shafiee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fatma","family":"K\u0131l\u0131n\u00e7-Karzan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,20]]},"reference":[{"issue":"3","key":"2047_CR1","doi-asserted-by":"publisher","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":"1","key":"2047_CR2","doi-asserted-by":"publisher","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":"2047_CR3","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Rank-one convexification for sparse regression. arXiv:1901.10334 (2019)"},{"key":"2047_CR4","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Safe screening rules for $$\\ell _0$$-regression from perspective relaxations. In: International Conference on Machine Learning, pp. 421\u2013430 (2020)"},{"key":"2047_CR5","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Supermodularity and valid inequalities for quadratic optimization with indicators. Math. Program. (Forthcoming), pp. 1\u201344 (2022)","DOI":"10.1007\/s10107-022-01908-2"},{"key":"2047_CR6","first-page":"52","volume":"22","author":"A Atamt\u00fcrk","year":"2021","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: convexification of $$\\ell _0$$-formulations. J. Mach. Learn. Res. 22, 52\u201361 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"2047_CR7","doi-asserted-by":"crossref","unstructured":"Bacci, T., Frangioni, A., Gentile, C., Tavlaridis-Gyparakis, K.: New MINLP formulations for the unit commitment problems with ramping constraints. Optimization (2019)","DOI":"10.1007\/978-3-030-63072-0_26"},{"key":"2047_CR8","unstructured":"Behdin, K., Mazumder, R.: Archetypal analysis for sparse nonnegative matrix factorization: Robustness under misspecification. arXiv:2104.03527 (2021)"},{"key":"2047_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"2047_CR10","unstructured":"Bertsimas, D., Cory-Wright, R., Pauphilet, J.: A new perspective on low-rank optimization. arXiv:2105.05947 (2021)"},{"issue":"1","key":"2047_CR11","doi-asserted-by":"publisher","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":"2047_CR12","doi-asserted-by":"publisher","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":"11","key":"2047_CR13","doi-asserted-by":"publisher","first-page":"3177","DOI":"10.1007\/s10994-021-06085-5","volume":"110","author":"D Bertsimas","year":"2021","unstructured":"Bertsimas, D., Pauphilet, J., Van Parys, B.: Sparse classification: a scalable discrete optimization perspective. Mach. Learn. 110(11), 3177\u20133209 (2021)","journal-title":"Mach. Learn."},{"issue":"1","key":"2047_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1214\/18-AOS1804","volume":"48","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Van Parys, B.: Sparse high-dimensional regression: exact scalable algorithms and phase transitions. Ann. Stat. 48(1), 300\u2013323 (2020)","journal-title":"Ann. Stat."},{"issue":"3","key":"2047_CR15","doi-asserted-by":"publisher","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":"2047_CR16","doi-asserted-by":"publisher","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":"2047_CR17","doi-asserted-by":"publisher","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(3), 595\u2013614 (1999)","journal-title":"Math. Program."},{"issue":"2","key":"2047_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11228-017-0407-x","volume":"26","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L.: Perspective functions: properties, constructions, and examples. Set-Valued Variat. Anal. 26(2), 247\u2013264 (2018)","journal-title":"Set-Valued Variat. Anal."},{"issue":"6","key":"2047_CR19","doi-asserted-by":"publisher","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":"2047_CR20","doi-asserted-by":"publisher","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."},{"issue":"3","key":"2047_CR21","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"GB Dantzig","year":"1973","unstructured":"Dantzig, G.B., Eaves, B.C.: Fourier\u2013Motzkin elimination and its dual. J. Combin. Theory 14(3), 288\u2013297 (1973)","journal-title":"J. Combin. Theory"},{"key":"2047_CR22","doi-asserted-by":"crossref","unstructured":"Deza, A., Atamt\u00fcrk, A.: Safe screening for logistic regression with $$\\ell _0 $$-$$\\ell _2$$ regularization. arXiv:2202.00467 (2022)","DOI":"10.5220\/0011578100003335"},{"issue":"2","key":"2047_CR23","doi-asserted-by":"publisher","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(2), 225\u2013236 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"2047_CR24","doi-asserted-by":"publisher","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."},{"issue":"3","key":"2047_CR25","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1137\/19M1306233","volume":"31","author":"A G\u00f3mez","year":"2021","unstructured":"G\u00f3mez, A.: Outlier detection in time series via mixed-integer conic quadratic optimization. SIAM J. Optim. 31(3), 1897\u20131925 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2047_CR26","doi-asserted-by":"publisher","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(1), 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"2047_CR27","unstructured":"Han, S., G\u00f3mez, A.: Compact extended formulations for low-rank functions with indicator variables. arXiv:2110.14884 (2021)"},{"key":"2047_CR28","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)"},{"issue":"5","key":"2047_CR29","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1287\/opre.2019.1919","volume":"68","author":"H Hazimeh","year":"2020","unstructured":"Hazimeh, H., Mazumder, R.: Fast best subset selection: coordinate descent and local combinatorial optimization algorithms. Oper. Res. 68(5), 1517\u20131537 (2020)","journal-title":"Oper. Res."},{"key":"2047_CR30","unstructured":"Hazimeh, H., Mazumder, R.: Learning hierarchical interactions at scale: a convex optimization approach. In: International Conference on Artificial Intelligence and Statistics, pp. 1833\u20131843 (2020)"},{"issue":"1","key":"2047_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/21-AOS2155","volume":"51","author":"H Hazimeh","year":"2023","unstructured":"Hazimeh, H., Mazumder, R., Radchenko, P.: Grouped variable selection with discrete optimization: computational and statistical perspectives. Ann. Stat. 51(1), 1\u201332 (2023)","journal-title":"Ann. Stat."},{"key":"2047_CR32","first-page":"1","volume":"196","author":"H Hazimeh","year":"2021","unstructured":"Hazimeh, H., Mazumder, R., Saab, A.: Sparse regression at scale: branch-and-bound rooted in first-order optimization. Math. Program. 196, 1\u201342 (2021)","journal-title":"Math. Program."},{"key":"2047_CR33","first-page":"247","volume-title":"Linear Inequalities and Related Systems","author":"I Heller","year":"1956","unstructured":"Heller, I., Tompkins, C.B.: An extension of a theorem of Dantzig\u2019s. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 247\u2013254. Princeton University Press, Princeton (1956)"},{"key":"2047_CR34","volume-title":"Fundamentals of Convex Analysis","author":"J-B Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2004)"},{"issue":"4","key":"2047_CR35","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1214\/12-STS392","volume":"27","author":"J Huang","year":"2012","unstructured":"Huang, J., Breheny, P., Ma, S.: A selective review of group selection in high-dimensional models. Stat. Sci. 27(4), 481\u2013499 (2012)","journal-title":"Stat. Sci."},{"key":"2047_CR36","doi-asserted-by":"publisher","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. Discrete Optim. 24, 32\u201350 (2017)","journal-title":"Discrete Optim."},{"key":"2047_CR37","unstructured":"Kucukyavuz, S., Shojaie, A., Manzour, H., Wei, L., Wu, H.-H.: Consistent second-order conic integer programming for learning Bayesian networks. arXiv:2005.14346 (2020)"},{"key":"2047_CR38","doi-asserted-by":"crossref","unstructured":"Liu, P., Fattahi, S., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: A graph-based decomposition method for convex quadratic optimization with indicators. Math. Program. (Forthcoming) (2022)","DOI":"10.1007\/s10107-022-01845-0"},{"issue":"2","key":"2047_CR39","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin, M., Dunning, I.: Computing in operations research using Julia. INFORMS J. Comput. 27(2), 238\u2013248 (2015)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2047_CR40","doi-asserted-by":"publisher","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. Optim. 3(1), 46\u201373 (2021)","journal-title":"INFORMS J. Optim."},{"issue":"2","key":"2047_CR41","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."},{"key":"2047_CR42","doi-asserted-by":"crossref","unstructured":"Ramachandra, A.A., Rujeerapaiboon, N., Sim, M.: Robust conic satisficing. arXiv:2107.06714 (2021)","DOI":"10.2139\/ssrn.3842446"},{"key":"2047_CR43","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"5","key":"2047_CR44","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/inte.2018.0957","volume":"48","author":"C Rudin","year":"2018","unstructured":"Rudin, C., Ustun, B.: Optimized scoring systems: toward trust in machine learning for healthcare and criminal justice. Interfaces 48(5), 449\u2013466 (2018)","journal-title":"Interfaces"},{"key":"2047_CR45","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8, 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"2047_CR46","unstructured":"Sahinidis, N.V.: BARON user manual v. 2023.11.10. https:\/\/minlp.com\/downloads\/docs\/baron%20manual.pdf. Accessed 13 Nov (2023)"},{"issue":"1","key":"2047_CR47","doi-asserted-by":"publisher","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 Stat Methodol. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"key":"2047_CR48","doi-asserted-by":"crossref","unstructured":"Wei, L., Atamt\u00fcrk, A., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: On the convex hull of convex quadratic optimization problems with indicators. arXiv:2201.00387 (2022)","DOI":"10.1007\/s10107-023-01982-0"},{"key":"2047_CR49","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: International Conference on Integer Programming and Combinatorial Optimization, pp. 433\u2013447 (2020)","DOI":"10.1007\/978-3-030-45771-6_33"},{"issue":"1","key":"2047_CR50","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-021-01734-y","volume":"192","author":"L Wei","year":"2022","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: Ideal formulations for constrained convex optimization problems with indicator variables. Math. Program. 192(1), 57\u201388 (2022)","journal-title":"Math. Program."},{"issue":"3","key":"2047_CR51","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(89)90036-9","volume":"8","author":"LA Wolsey","year":"1989","unstructured":"Wolsey, L.A.: Submodularity and valid inequalities in capacitated fixed charge networks. Oper. Res. Lett. 8(3), 119\u2013124 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"2047_CR52","doi-asserted-by":"publisher","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. Optim. 30(4), 3359\u20133386 (2020)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02047-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02047-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02047-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:10:27Z","timestamp":1729008627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02047-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,20]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2047"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02047-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,20]]},"assertion":[{"value":"9 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}