{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:19:59Z","timestamp":1778498399614,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100012957","name":"Friedrich-Schiller-Universit\u00e4t Jena","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012957","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the connections between existing results before introducing a new notion of polyhedral approximation called <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\left( \\varepsilon , \\delta \\right) $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mfenced>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03b4<\/mml:mi>\n                  <\/mml:mfenced>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approximation that integrates the unbounded case in a meaningful way. Some basic results about <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\left( \\varepsilon , \\delta \\right) $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mfenced>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03b4<\/mml:mi>\n                  <\/mml:mfenced>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approximations are proved for general convex sets. In the last section, an algorithm for the computation of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\left( \\varepsilon , \\delta \\right) $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mfenced>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03b4<\/mml:mi>\n                  <\/mml:mfenced>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approximations of spectrahedra is presented. Correctness and finiteness of the algorithm are proved.<\/jats:p>","DOI":"10.1007\/s10957-022-02020-3","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:05:18Z","timestamp":1648559118000},"page":"265-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the Approximation of Unbounded Convex Sets by Polyhedra"],"prefix":"10.1007","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9503-3619","authenticated-orcid":false,"given":"Daniel","family":"D\u00f6rfler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"2020_CR1","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)"},{"key":"2020_CR2","first-page":"5","volume":"22","author":"EM Bronshte\u012dn","year":"2007","unstructured":"Bronshte\u012dn, E.M.: Approximation of convex sets by polyhedra. Sovrem. Mat. Fundam. Napravl. 22, 5\u201337 (2007)","journal-title":"Sovrem. Mat. Fundam. Napravl."},{"key":"2020_CR3","first-page":"1110","volume":"16","author":"EM Bronshte\u012dn","year":"1975","unstructured":"Bronshte\u012dn, E.M., Ivanov, L.D.: The approximation of convex sets by polyhedra. Sibirsk. Mat. \u017d. 16, 1110\u20131112 (1975). (1132)","journal-title":"Sibirsk. Mat. \u017d."},{"key":"2020_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BF01386389","volume":"1","author":"EW Cheney","year":"1959","unstructured":"Cheney, E.W., Goldstein, A.A.: Newton\u2019s method for convex programming and Tchebycheff approximation. Numer. Math. 1, 254\u2013268 (1959)","journal-title":"Numer. Math."},{"key":"2020_CR5","unstructured":"Ciripoi, D.: Approximation of Spectrahedral Shadows and Spectrahedral Calculus. Ph.D. thesis, Friedrich Schiller University Jena, (2019)"},{"key":"2020_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-018-0627-0","volume":"72","author":"D Ciripoi","year":"2018","unstructured":"Ciripoi, D., L\u00f6hne, A., Wei\u00dfing, B.: A vector linear programming approach for certain global optimization problems. J. Global Optim. 72, 347\u2013372 (2018)","journal-title":"J. Global Optim."},{"key":"2020_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programm. 36, 307\u2013339 (1986)","journal-title":"Math. Programm."},{"key":"2020_CR8","doi-asserted-by":"crossref","unstructured":"D\u00f6rfler, D., L\u00f6hne, A., Schneider, C., Wei\u00dfing, B.: A benson-type algorithm for bounded convex vector optimization problems with vertex selection. Optimization Methods and Software 0 (2021), pp. 1\u201321","DOI":"10.1080\/10556788.2021.1880579"},{"key":"2020_CR9","unstructured":"Eaton, J. W., Bateman, D., Hauberg, S., Wehbring, R.: GNU Octave version 6.3.0 manual: a high-level interactive language for numerical computations (2021). https:\/\/www.gnu.org\/software\/octave\/doc\/v6.3.0\/"},{"key":"2020_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10898-010-9588-7","volume":"50","author":"M Ehrgott","year":"2011","unstructured":"Ehrgott, M., Shao, L., Sch\u00f6bel, A.: An approximation algorithm for convex multi-objective programming problems. J. Global Optim. 50, 397\u2013416 (2011)","journal-title":"J. Global Optim."},{"key":"2020_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1090\/S0002-9904-1948-09022-X","volume":"54","author":"L Fejes T\u00f3th","year":"1948","unstructured":"Fejes T\u00f3th, L.: Approximation by polygons and polyhedra. Bull. Am. Math. Soc. 54, 431\u2013438 (1948)","journal-title":"Bull. Am. Math. Soc."},{"key":"2020_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01100204","volume":"7","author":"AJ Goldman","year":"1995","unstructured":"Goldman, A.J., Ramana, M.: Some geometric results in semidefinite programming. J. Global Optim. 7, 33\u201350 (1995)","journal-title":"J. Global Optim."},{"key":"2020_CR13","first-page":"194","volume":"1","author":"VI Gurari\u012d","year":"1965","unstructured":"Gurari\u012d, V.I.: Openings and inclinations of subspaces of a Banach space. Teor. Funkci\u012d Funkcional. Anal. i Prilo\u017een. Vyp. 1, 194\u2013204 (1965)","journal-title":"Teor. Funkci\u012d Funkcional. Anal. i Prilo\u017een. Vyp."},{"key":"2020_CR14","doi-asserted-by":"crossref","unstructured":"Holmes, R. B.: Geometric Functional Analysis and its Applications. Springer-Verlag, New York-Heidelberg, 1975. Graduate Texts in Mathematics, No. 24","DOI":"10.1007\/978-1-4684-9369-6"},{"key":"2020_CR15","first-page":"1033","volume":"17","author":"A Iusem","year":"2010","unstructured":"Iusem, A., Seeger, A.: Distances between closed convex cones: old and new results. J. Convex Anal. 17, 1033\u20131055 (2010)","journal-title":"J. Convex Anal."},{"key":"2020_CR16","first-page":"136","volume":"32","author":"GK Kamenev","year":"1992","unstructured":"Kamenev, G.K.: A class of adaptive algorithms for the approximation of convex bodies by polyhedra. Zh. Vychisl. Mat. i Mat. Fiz. 32, 136\u2013152 (1992)","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"2020_CR17","first-page":"796","volume":"33","author":"GK Kamenev","year":"1993","unstructured":"Kamenev, G.K.: Efficiency of Hausdorff algorithms for polyhedral approximation of convex bodies. Zh. Vychisl. Mat. i Mat. Fiz. 33, 796\u2013805 (1993)","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"2020_CR18","first-page":"608","volume":"34","author":"GK Kamenev","year":"1994","unstructured":"Kamenev, G.K.: Analysis of an algorithm for approximating convex bodies. Zh. Vychisl. Mat. i Mat. Fiz. 34, 608\u2013616 (1994)","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"2020_CR19","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"2020_CR20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/s00454-008-9050-5","volume":"39","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V.: Generating all vertices of a polyhedron is hard. Discrete Comput. Geom. 39, 174\u2013190 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"2020_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2016","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J. Global Optim. 64, 249\u2013272 (2016)","journal-title":"J. Global Optim."},{"key":"2020_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18351-5","volume-title":"Vector Optimization with Infimum and Supremum Vector Optimization","author":"A L\u00f6hne","year":"2011","unstructured":"L\u00f6hne, A.: Vector Optimization with Infimum and Supremum Vector Optimization. Springer, Heidelberg (2011)"},{"key":"2020_CR23","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10898-013-0136-0","volume":"60","author":"A L\u00f6hne","year":"2014","unstructured":"L\u00f6hne, A., Rudloff, B., Ulus, F.: Primal and dual approximation algorithms for convex vector optimization problems. J. Global Optim. 60, 713\u2013736 (2014)","journal-title":"J. Global Optim."},{"key":"2020_CR24","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00186-016-0554-0","volume":"84","author":"A L\u00f6hne","year":"2016","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math. Methods Oper. Res. 84, 411\u2013426 (2016)","journal-title":"Math. Methods Oper. Res."},{"key":"2020_CR25","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":"2020_CR26","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01445180","volume":"57","author":"H Minkowski","year":"1903","unstructured":"Minkowski, H.: Volumen und Oberfl\u00e4che. Math. Ann. 57, 447\u2013495 (1903)","journal-title":"Math. Ann."},{"key":"2020_CR27","unstructured":"Netzer, T.: Spectrahedra and their Shadows. Habilitation thesis, University of Leipzig, 2011"},{"key":"2020_CR28","first-page":"229","volume":"2","author":"PE Ney","year":"1995","unstructured":"Ney, P.E., Robinson, S.M.: Polyhedral approximation of convex sets with an application to large deviation probability theory. J. Convex Anal. 2, 229\u2013240 (1995)","journal-title":"J. Convex Anal."},{"key":"2020_CR29","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ, 1997. Reprint of the 1970 original, Princeton Paperbacks"},{"key":"2020_CR30","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 317. Springer-Verlag, Berlin (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"2020_CR31","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","volume":"126","author":"S Ruzika","year":"2005","unstructured":"Ruzika, S., Wiecek, M.M.: Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126, 473\u2013501 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"2020_CR32","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01679698","volume":"256","author":"R Schneider","year":"1981","unstructured":"Schneider, R.: Zur optimalen Approximation konvexer Hyperfl\u00e4chen durch Polyeder. Math. Ann. 256, 289\u2013301 (1981)","journal-title":"Math. Ann."},{"key":"2020_CR33","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2013a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11\/12 (1999), pp. 545\u2013581","DOI":"10.1080\/10556789908805762"},{"key":"2020_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"2020_CR35","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10898-018-0666-6","volume":"72","author":"F Ulus","year":"2018","unstructured":"Ulus, F.: Tractability of convex vector optimization problems in the sense of polyhedral approximations. J. Global Optim. 72, 731\u2013742 (2018)","journal-title":"J. Global Optim."},{"key":"2020_CR36","doi-asserted-by":"crossref","unstructured":"Varadha, S.R.S.: Large deviations and applications, vol. 46 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, (1984)","DOI":"10.1137\/1.9781611970241"},{"key":"2020_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/opre.15.1.147","volume":"15","author":"AF Veinott Jr","year":"1967","unstructured":"Veinott, A.F., Jr.: The supporting hyperplane method for unimodal programming. Oper. Res. 15, 147\u2013152 (1967)","journal-title":"Oper. Res."},{"key":"2020_CR38","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex minlp problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."}],"updated-by":[{"DOI":"10.1007\/s10957-022-02047-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000}}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02020-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:54:42Z","timestamp":1654016082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02020-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,29]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["2020"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02020-3","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10957-022-02047-6","asserted-by":"object"}]},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,29]]},"assertion":[{"value":"24 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10957-022-02047-6","URL":"https:\/\/doi.org\/10.1007\/s10957-022-02047-6","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}