{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:04:29Z","timestamp":1743393869546,"version":"3.40.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Vienna University of Economics and Business"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We consider the problem of projecting a convex set onto a subspace or, equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex sets by polyhedrons. The existing literature on convex projections provides methods for bounded convex sets only, in this paper we propose a method that can handle both bounded and unbounded problems. The algorithms we propose build on the ideas of inner and outer approximation. In particular, we adapt the recently proposed methods for solving unbounded convex vector optimization problems to handle also the class of projection problems.\n<\/jats:p>","DOI":"10.1007\/s10898-024-01461-6","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T02:55:49Z","timestamp":1736736949000},"page":"787-805","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximations of unbounded convex projections and unbounded convex sets"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2088-0597","authenticated-orcid":false,"given":"Gabriela","family":"Kov\u00e1\u010dov\u00e1","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1675-5451","authenticated-orcid":false,"given":"Birgit","family":"Rudloff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"issue":"2","key":"1461_CR1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s10957-022-02045-8","volume":"194","author":"\u00c7 Ararat","year":"2022","unstructured":"Ararat, \u00c7., Ulus, F., Umer, M.: A norm minimization-based convex vector optimization algorithm. J. Optim. Theory Appl. 194(2), 681\u2013712 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"1461_CR2","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10958-008-9144-x","volume":"153","author":"EM Bronstein","year":"2008","unstructured":"Bronstein, E.M.: Approximation of convex sets by polytopes. J. Math. Sci. 153(6), 727 (2008)","journal-title":"J. Math. Sci."},{"key":"1461_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)"},{"key":"1461_CR4","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1007\/s10957-023-02363-5","volume":"200","author":"D D\u00f6rfler","year":"2024","unstructured":"D\u00f6rfler, D., L\u00f6hne, A.: Polyhedral approximation of spectrahedral shadows via homogenization. J. Optim. Theory Appl. 200, 874\u2013890 (2024)","journal-title":"J. Optim. Theory Appl."},{"key":"1461_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10957-022-02020-3","volume":"194","author":"D D\u00f6rfler","year":"2022","unstructured":"D\u00f6rfler, D.: On the approximation of unbounded convex sets by polyhedra. J. Optim. Theory Appl. 194, 265\u2013287 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1461_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10898-016-0459-8","volume":"68","author":"Z Feinstein","year":"2017","unstructured":"Feinstein, Z., Rudloff, B.: A recursive algorithm for multivariate risk measures and a set-valued Bellman\u2019s principle. J. Global Optim. 68(1), 47\u201369 (2017)","journal-title":"J. Global Optim."},{"issue":"1","key":"1461_CR7","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/moor.2021.1143","volume":"47","author":"Z Feinstein","year":"2022","unstructured":"Feinstein, Z., Rudloff, B., Zhang, J.: Dynamic set values for nonzero sum games with multiple equilibriums. Math. Oper. Res. 47(1), 616\u2013642 (2022)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1461_CR8","first-page":"114","volume":"32","author":"GK Kamenev","year":"1992","unstructured":"Kamenev, G.K.: A class of adaptive algorithms for approximating convex bodies by polyhedra. Comput. Math. Math. Phys. 32(1), 114\u2013127 (1992)","journal-title":"Comput. Math. Math. Phys."},{"issue":"4","key":"1461_CR9","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1287\/opre.2020.2002","volume":"69","author":"G Kov\u00e1\u010dov\u00e1","year":"2021","unstructured":"Kov\u00e1\u010dov\u00e1, G., Rudloff, B.: Time consistency of the mean-risk problem. Oper. Res. 69(4), 1100\u20131117 (2021)","journal-title":"Oper. Res."},{"key":"1461_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10898-021-01111-1","volume":"83","author":"G Kov\u00e1\u010dov\u00e1","year":"2022","unstructured":"Kov\u00e1\u010dov\u00e1, G., Rudloff, B.: Convex projection and convex multi-objective optimization. J. Global Optim. 83, 301\u2013327 (2022)","journal-title":"J. Global Optim."},{"issue":"2","key":"1461_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.3934\/fmf.2021009","volume":"1","author":"G Kov\u00e1\u010dov\u00e1","year":"2022","unstructured":"Kov\u00e1\u010dov\u00e1, G., Rudloff, B., Cialenco, I.: Acceptability maximization. Front. Math. Financ. 1(2), 219\u2013248 (2022)","journal-title":"Front. Math. Financ."},{"issue":"4","key":"1461_CR12","doi-asserted-by":"crossref","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(4), 713\u2013736 (2014)","journal-title":"J. Global Optim."},{"issue":"2","key":"1461_CR13","doi-asserted-by":"crossref","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(2), 411\u2013426 (2016)","journal-title":"Math. Methods Oper. Res."},{"key":"1461_CR14","first-page":"341","volume":"3","author":"A L\u00f6hne","year":"2021","unstructured":"L\u00f6hne, A., Zhao, F., Shao, L.: On the approximation error for approximating convex bodies using multiobjective optimization. Appl. Set-Valued Anal. Optim. 3, 341\u2013354 (2021)","journal-title":"Appl. Set-Valued Anal. Optim."},{"issue":"1","key":"1461_CR15","first-page":"229","volume":"2","author":"P Ney","year":"1995","unstructured":"Ney, P., Robinson, S.: Polyhedral approximation of convex sets with an application to large deviation probability theory. J. Convex Anal. 2(1), 229\u2013240 (1995)","journal-title":"J. Convex Anal."},{"issue":"6","key":"1461_CR16","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1080\/02331934.2018.1426583","volume":"67","author":"L Shao","year":"2018","unstructured":"Shao, L., Zhao, F., Cong, Y.: Approximation of convex bodies by multiple objective optimization and an application in reachable sets. Optimization 67(6), 783\u2013796 (2018)","journal-title":"Optimization"},{"issue":"4","key":"1461_CR17","doi-asserted-by":"crossref","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(4), 731\u2013742 (2018)","journal-title":"J. Global Optim."},{"issue":"4","key":"1461_CR18","doi-asserted-by":"crossref","first-page":"2598","DOI":"10.1137\/22M1507693","volume":"33","author":"A Wagner","year":"2023","unstructured":"Wagner, A., Ulus, F., Rudloff, B., Kov\u00e1\u010dov\u00e1, G., Hey, N.: Algorithms to solve unbounded convex vector optimization problems. SIAM J. Optim. 33(4), 2598\u20132624 (2023)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01461-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01461-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01461-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T03:53:40Z","timestamp":1743306820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01461-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1461"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01461-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"17 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}