{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T01:00:43Z","timestamp":1781658043227,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12532-020-00178-3","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T13:03:34Z","timestamp":1582203814000},"page":"249-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Outer approximation with conic certificates for mixed-integer convex problems"],"prefix":"10.1007","volume":"12","author":[{"given":"Chris","family":"Coey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miles","family":"Lubin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"1","key":"178_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"178_CR2","unstructured":"Ahmadi, A.A., Hall, G.: Sum of squares basis pursuit with linear and second order cone programming. arXiv preprint arXiv:1510.01597 (2015)"},{"key":"178_CR3","doi-asserted-by":"publisher","first-page":"1","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 Numer. 22, 1\u2013131 (2013). ISSN 1474-0508","journal-title":"Acta Numer."},{"key":"178_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"issue":"2","key":"178_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"178_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"issue":"2","key":"178_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008). ISSN 1572-5286","journal-title":"Discrete Optim."},{"key":"178_CR8","first-page":"1","volume-title":"Mixed Integer Nonlinear Programming","author":"Pierre Bonami","year":"2011","unstructured":"Bonami, P., K\u0131l\u0131n\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In Lee, J., and Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, Volume 154 of The IMA Volumes in Mathematics and Its Applications, pp. 1\u201339. Springer New York (2012). ISBN 978-1-4614-1926-6"},{"issue":"1\u20134","key":"178_CR9","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, AC library for semidefinite programming. Optim. Methods Softw. 11(1\u20134), 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"178_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"83","key":"178_CR11","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"178_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). ISSN 0025-5610","journal-title":"Math. Program."},{"key":"178_CR13","doi-asserted-by":"crossref","unstructured":"Domahidi, A., Chu, E., Boyd, S.: ECOS: an SOCP solver for embedded systems. In: European Control Conference (ECC), pp. 3071\u20133076 (2013)","DOI":"10.23919\/ECC.2013.6669541"},{"key":"178_CR14","first-page":"41","volume-title":"Mixed Integer Nonlinear Programming","author":"Sarah Drewes","year":"2011","unstructured":"Drewes, S., Ulbrich, S.: Subgradient based outer approximation for mixed integer second order cone programming. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, Volume 154 of The IMA Volumes in Mathematics and Its Applications, pp. 41\u201359. Springer New York (2012). ISBN 978-1-4614-1926-6. https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_2"},{"issue":"2","key":"178_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017). https:\/\/doi.org\/10.1137\/15M1020575","journal-title":"SIAM Rev."},{"issue":"2","key":"178_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s12532-015-0092-4","volume":"8","author":"HA Friberg","year":"2016","unstructured":"Friberg, H.A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization. Math. Program. Comput. 8(2), 191\u2013214 (2016). ISSN 1867-2957","journal-title":"Math. Program. Comput."},{"issue":"3","key":"178_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1080\/10556788.2017.1322081","volume":"33","author":"T Gally","year":"2018","unstructured":"Gally, T., Pfetsch, M.E., Ulbrich, S.: A framework for solving mixed-integer semidefinite programs. Optim. Methods Softw. 33(3), 594\u2013632 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1322081","journal-title":"Optim. Methods Softw."},{"key":"178_CR18","doi-asserted-by":"publisher","DOI":"10.1145\/2950048","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. (2016). https:\/\/doi.org\/10.1145\/2950048","journal-title":"ACM Trans. Math. Softw."},{"key":"178_CR19","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. (2014). cvxr.com\/cvx"},{"key":"178_CR20","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization, Volume\u00a084 of Nonconvex Optimization and Its Applications, pp. 155\u2013210. Springer US (2006). ISBN 978-0-387-28260-2"},{"key":"178_CR21","first-page":"61","volume-title":"Mixed Integer Nonlinear Programming","author":"Oktay G\u00fcnl\u00fck","year":"2011","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulation and applications. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, Volume 154 of The IMA Volumes in Mathematics and Its Applications, pp. 61\u201389. Springer, New York (2012). ISBN 978-1-4614-1926-6"},{"issue":"5","key":"178_CR22","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1080\/1055678031000148696","volume":"18","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M., Yamashita, M.: Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. 18(5), 535\u2013541 (2003)","journal-title":"Optim. Methods Softw."},{"key":"178_CR23","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ger, O., Coffrin, C., Hijazi, H., Nagarajan, H.: Juniper: an open-source nonlinear branch-and-bound solver in Julia. In: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 377\u2013386. Springer (2018)","DOI":"10.1007\/978-3-319-93031-2_27"},{"key":"178_CR24","unstructured":"Leyffer, S.: Deterministic Methods for Mixed Integer Nonlinear Programming. PhD thesis, Department of Mathematics and Computer Science, University of Dundee, Dundee (1993)"},{"issue":"2","key":"178_CR25","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."},{"key":"178_CR26","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-33461-5_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"Miles Lubin","year":"2016","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended formulations in mixed-integer convex programming. In: Louveaux, Q., Skutella, M. (eds.) Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Li\u00e8ge, Belgium, June 1\u20133, 2016, Proceedings, pp. 102\u2013113. Springer International Publishing, Cham (2016). ISBN 978-3-319-33461-5. https:\/\/doi.org\/10.1007\/978-3-319-33461-5_9"},{"key":"178_CR27","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-319-59250-3_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"Miles Lubin","year":"2017","unstructured":"Lubin, M., Zadik, I., Vielma, J.P.: Mixed-integer convex representability. In: Eisenbrand, F., K\u00f6nemann, J.. (eds.) Integer Programming and Combinatorial Optimization\u201419th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26\u201328, 2017, Proceedings, Volume 10328 of Lecture Notes in Computer Science, pp. 392\u2013404. Springer (2017). ISBN 978-3-319-59249-7. https:\/\/doi.org\/10.1007\/978-3-319-59250-3_32"},{"key":"178_CR28","doi-asserted-by":"crossref","unstructured":"Lubin, M., Zadik, I., Vielma, J.P.: Regularity in mixed-integer convex representability. arXiv preprint arXiv:1706.05135 (2017)","DOI":"10.1007\/978-3-319-59250-3_32"},{"key":"178_CR29","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10107-017-1191-y","volume":"172","author":"M Lubin","year":"2018","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Polyhedral approximation in mixed-integer convex optimization. Math. Program. 172, 139\u2013168 (2018)","journal-title":"Math. Program."},{"key":"178_CR30","unstructured":"Mosek ApS: Modeling Cookbook revision 2.0.1. docs.mosek.com\/MOSEKModeling Cookbook-letter.pdf (2016). Accessed 12 Apr 2017"},{"key":"178_CR31","unstructured":"Nagarajan, H., Lu, M., Wang, S., Bent, R., Sundar, K.: An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. arXiv preprint arXiv:1707.02514 (2017)"},{"issue":"3","key":"178_CR32","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0892-3. ISSN 1573-2878","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"178_CR33","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"178_CR34","unstructured":"Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. Optimization Online (2015)"},{"issue":"10","key":"178_CR35","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10), 937\u2013947 (1992). https:\/\/doi.org\/10.1016\/0098-1354(92)80028-8. ISSN 0098-1354","journal-title":"Comput. Chem. Eng."},{"key":"178_CR36","unstructured":"Saltzman, M., Lad\u00e1anyi, L., Ralphs, T.: The COIN-OR open solver interface: technology overview. Presented at CORS\/INFORMS Banff., 5 (2004). https:\/\/www.coin-or.org\/Presentations\/CORS2004-OSI.pdf"},{"key":"178_CR37","unstructured":"Serrano, S.A.: Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone. PhD thesis, Stanford University (2015)"},{"key":"178_CR38","unstructured":"Udell, M., Mohan, K., Zeng, D., Hong, J., Diamond, S., Boyd, S.: Convex optimization in Julia. In: Proceedings of HPTCDL \u201914, pp. 18\u201328, Piscataway, NJ, USA. IEEE Press (2014). ISBN 978-1-4799-7020-9"},{"key":"178_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-018-1258-4","volume":"177","author":"JP Vielma","year":"2018","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177, 21\u201353 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1258-4. ISSN 1436-4646","journal-title":"Math. Program."},{"issue":"3","key":"178_CR40","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12532-016-0113-y","volume":"9","author":"JP Vielma","year":"2017","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3), 369\u2013418 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0113-y. ISSN 1867-2957","journal-title":"Math. Program. Comput."},{"key":"178_CR41","unstructured":"Vigerske, S.: MINLPLIB2 library. www.gamsworld.org\/minlp\/minlplib2\/html\/ (2018). Accessed 13 May 2016"},{"key":"178_CR42","doi-asserted-by":"crossref","unstructured":"Witzig, J., Berthold, T., Heinz, S.: Experiments with conflict analysis in mixed integer programming. In: International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 211\u2013220. Springer (2017)","DOI":"10.1007\/978-3-319-59776-8_17"},{"key":"178_CR43","unstructured":"Zhang, S.: Lecture 4: the dual cone and dual problem. University Lecture. http:\/\/www.isye.umn.edu\/courses\/ie8534\/pdf\/Lecture-4.pdf (2014)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00178-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-020-00178-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00178-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T19:24:45Z","timestamp":1613762685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-020-00178-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,20]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s12532-020-00178-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,20]]},"assertion":[{"value":"3 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}