{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:01:19Z","timestamp":1775293279010,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T00:00:00Z","timestamp":1543795200000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s12532-018-0152-7","type":"journal-article","created":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T04:14:32Z","timestamp":1543810472000},"page":"311-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra"],"prefix":"10.1007","volume":"11","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[]},{"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,3]]},"reference":[{"key":"152_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128, 149\u2013169 (2011)","journal-title":"Math. Program."},{"key":"152_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"152_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"152_CR4","unstructured":"Atamt\u00fcrk, A., Gom\u00e9z, A.,: Submodularity in conic quadratic mixed 0\u20131 optimization. arXiv preprint arXiv:1705.05918 , (2016). BCOL Research Report 16.02, UC Berkeley"},{"key":"152_CR5","unstructured":"Atamt\u00fcrk, A., Jeon, H.: Lifted polymatroid inequalities for mean-risk optimization with indicator variables. arXiv preprint arXiv:1705.05915 , (2017). BCOL Research Report 17.01, UC Berkeley"},{"key":"152_CR6","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Cuts for conic mixed-integer programming. In: Fischetti, M., Williamson, D.P. (eds.) Integer Programming and Combinatorial Optimization, pp. 16\u201329. Springer, Berlin (2007) ISBN 978-3-540-72792-7","DOI":"10.1007\/978-3-540-72792-7_2"},{"key":"152_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.orl.2008.04.006","volume":"36","author":"A Atamt\u00fcrk","year":"2008","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Polymatroids and risk minimization in discrete optimization. Oper. Res. Lett. 36, 618\u2013622 (2008)","journal-title":"Oper. Res. Lett."},{"key":"152_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.disopt.2009.03.002","volume":"6","author":"A Atamt\u00fcrk","year":"2009","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: The submodular 0\u20131 knapsack polytope. Discrete Optim. 6, 333\u2013344 (2009)","journal-title":"Discrete Optim."},{"key":"152_CR9","unstructured":"Atamt\u00fcrk, A., Deck, C., Jeon, H.: Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction. arXiv preprint arXiv:1708.02371 , (2017). BCOL Reseach Report 17.05, UC Berkeley. Forthcoming in INFORMS Journal on Computing"},{"key":"152_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/090762294","volume":"21","author":"NS Aybat","year":"2011","unstructured":"Aybat, N.S., Iyengar, G.: A first-order smoothed penalty method for compressed sensing. SIAM J. Optim. 21, 287\u2013313 (2011)","journal-title":"SIAM J. Optim."},{"key":"152_CR11","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1093\/biomet\/asr043","volume":"98","author":"A Belloni","year":"2011","unstructured":"Belloni, A., Chernozhukov, V., Wang, L.: Square-root lasso: pivotal recovery of sparse signals via conic programming. Biometrika 98, 791\u2013806 (2011)","journal-title":"Biometrika"},{"key":"152_CR12","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numerica 22, 1131 (2013)","journal-title":"Acta Numerica"},{"key":"152_CR13","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"key":"152_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"key":"152_CR15","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"152_CR16","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"152_CR17","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization under ellipsoidal uncertainty sets (2004) (unpublished)"},{"key":"152_CR18","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., et al.: Best subset selection via a modern optimization lens. Ann. Stat. 44, 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"152_CR19","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. Program. 74, 121\u2013140 (1996)","journal-title":"Math. Program."},{"key":"152_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21, 359\u2013367 (1994)","journal-title":"Comput. Oper. Res."},{"key":"152_CR21","unstructured":"\u00c7ay, S.B., P\u00f3lik, I., Terlaky, T.: Warm-start of interior point methods for second order cone optimization via rounding over optimal Jordan frames, May 2017. ISE Technical Report 17T-006, Lehigh University"},{"key":"152_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"GB Dantzig","year":"1955","unstructured":"Dantzig, G.B., Orden, A., Wolfe, P.: The generalized simplex method for minimizing a linear form under linear inequality restraints. Pac. J. Math. 5, 183\u2013196 (1955)","journal-title":"Pac. J. Math."},{"key":"152_CR23","first-page":"89","volume-title":"Exact Algorithms for the Chance-Constrained Vehicle Routing Problem","author":"T Dinh","year":"2016","unstructured":"Dinh, T., Fukasawa, R., Luedtke, J.: Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, pp. 89\u2013101. Springer, New York (2016)"},{"key":"152_CR24","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R., et al.: Least angle regression. Ann. Stat. 32, 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"152_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","volume":"51","author":"L Ghaoui El","year":"2003","unstructured":"El Ghaoui, L., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach. Oper. Res. 51, 543\u2013556 (2003)","journal-title":"Oper. Res."},{"key":"152_CR26","volume-title":"Convex Analysis and Minimization Algorithms I: Fundamentals","author":"J-B Hiriart-Urruty","year":"2013","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals. Springer, New York (2013)"},{"key":"152_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(81)90004-4","volume":"3","author":"H Ishii","year":"1981","unstructured":"Ishii, H., Shiode, S., Nishida, T., Namasuya, Y.: Stochastic spanning tree problem. Discrete Appl. Math. 3, 263\u2013273 (1981)","journal-title":"Discrete Appl. Math."},{"key":"152_CR28","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 302\u2013311. ACM (1984)","DOI":"10.1145\/800057.808695"},{"key":"152_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"152_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl"},{"key":"152_CR31","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N Megiddo","year":"1991","unstructured":"Megiddo, N.: On finding primal- and dual-optimal bases. INFORMS J. Comput. 3, 63\u201365 (1991)","journal-title":"INFORMS J. Comput."},{"key":"152_CR32","first-page":"273","volume":"72","author":"A Nemirovski","year":"1996","unstructured":"Nemirovski, A., Scheinberg, K.: Extension of Karmarkar\u2019s algorithm onto convex quadratically constrained quadratic problems. Math. Program. 72, 273\u2013289 (1996)","journal-title":"Math. Program."},{"key":"152_CR33","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"152_CR34","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (1994). URL http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611970791"},{"key":"152_CR35","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"152_CR36","doi-asserted-by":"crossref","unstructured":"Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: European Symposium on Algorithms, pp. 552\u2013563. Springer, New York (2006)","DOI":"10.1007\/11841036_50"},{"issue":"2","key":"152_CR37","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"152_CR38","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 (Methodological) 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc Ser. B (Methodological)"},{"issue":"3\u20134","key":"152_CR39","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/nav.3800110304","volume":"11","author":"C Panne Van de","year":"1964","unstructured":"Van de Panne, C., Whinston, A.: Simplicial methods for quadratic programming. Naval Res. Log. Q. 11(3\u20134), 273\u2013302 (1964)","journal-title":"Naval Res. Log. Q."},{"key":"152_CR40","doi-asserted-by":"publisher","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. (2015). https:\/\/doi.org\/10.1007\/s125312-016-0113-y","DOI":"10.1007\/s125312-016-0113-y"},{"key":"152_CR41","doi-asserted-by":"publisher","first-page":"382","DOI":"10.2307\/1909468","volume":"27","author":"P Wolfe","year":"1959","unstructured":"Wolfe, P.: The simplex method for quadratic programming. Economet. J. Economet. Soc. 27, 382\u2013398 (1959)","journal-title":"Economet. J. Economet. Soc."},{"key":"152_CR42","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1137\/S1052623400369235","volume":"12","author":"EA Yildirim","year":"2002","unstructured":"Yildirim, E.A., Wright, S.J.: Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12, 782\u2013810 (2002)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0152-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0152-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0152-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T08:13:01Z","timestamp":1775290381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0152-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,3]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["152"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0152-7","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,3]]},"assertion":[{"value":"17 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}