{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T02:30:12Z","timestamp":1783477812557,"version":"3.55.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"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":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we consider a problem, called convex projection, of projecting a convex set onto a subspace. We will show that to a convex projection one can assign a particular multi-objective convex optimization problem, such that the solution to that problem also solves the convex projection (and vice versa), which is analogous to the result in the polyhedral convex case considered in L\u00f6hne and Wei\u00dfing (Math Methods Oper Res 84(2):411\u2013426, 2016). In practice, however, one can only compute approximate solutions in the (bounded or self-bounded) convex case, which solve the problem up to a given error tolerance. We will show that for approximate solutions a similar connection can be proven, but the tolerance level needs to be adjusted. That is, an approximate solution of the convex projection solves the multi-objective problem only with an increased error. Similarly, an approximate solution of the multi-objective problem solves the convex projection with an increased error. In both cases the tolerance is increased proportionally to a multiplier. These multipliers are deduced and shown to be sharp. These results allow to compute approximate solutions to a convex projection problem by computing approximate solutions to the corresponding multi-objective convex optimization problem, for which algorithms exist in the bounded case. For completeness, we will also investigate the potential generalization of the following result to the convex case. In L\u00f6hne and Wei\u00dfing (Math Methods Oper Res 84(2):411\u2013426, 2016), it has been shown for the polyhedral case, how to construct a polyhedral projection associated to any given vector linear program and how to relate their solutions. This in turn yields an equivalence between polyhedral projection, multi-objective linear programming and vector linear programming. We will show that only some parts of this result can be generalized to the convex case, and discuss the limitations.<\/jats:p>","DOI":"10.1007\/s10898-021-01111-1","type":"journal-article","created":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T05:02:37Z","timestamp":1637730157000},"page":"301-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Convex projection and convex multi-objective optimization"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2088-0597","authenticated-orcid":false,"given":"Gabriela","family":"Kov\u00e1\u010dov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1675-5451","authenticated-orcid":false,"given":"Birgit","family":"Rudloff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,24]]},"reference":[{"key":"1111_CR1","doi-asserted-by":"publisher","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. Optim. Methods Softw. (2021). https:\/\/doi.org\/10.1080\/10556788.2021.1880579","DOI":"10.1080\/10556788.2021.1880579"},{"issue":"3","key":"1111_CR2","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. Glob. Optim. 50(3), 397\u2013416 (2011)","journal-title":"J. Glob. Optim."},{"key":"1111_CR3","doi-asserted-by":"publisher","unstructured":"Feinstein, Z., Rudloff, B., Zhang, J.: Dynamic set values for nonzero sum games with multiple equilibriums. Math. Oper. Res. (2021). https:\/\/doi.org\/10.1287\/moor.2021.1143","DOI":"10.1287\/moor.2021.1143"},{"issue":"4","key":"1111_CR4","doi-asserted-by":"publisher","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":"1111_CR5","doi-asserted-by":"crossref","unstructured":"Kov\u00e1\u010dov\u00e1, G., Rudloff, B., Cialenco, I.: Acceptability maximization. arXiv e-prints arXiv:2012.11972 (2020)","DOI":"10.3934\/fmf.2021009"},{"key":"1111_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18351-5","volume-title":"Vector Optimization with Infimum and Supremum","author":"A L\u00f6hne","year":"2011","unstructured":"L\u00f6hne, A.: Vector Optimization with Infimum and Supremum. Springer, Berlin (2011)"},{"issue":"4","key":"1111_CR7","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. Glob. Optim. 60(4), 713\u2013736 (2014)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1111_CR8","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(2), 411\u2013426 (2016)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"1111_CR9","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2016.02.039","volume":"260","author":"A L\u00f6hne","year":"2017","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: The vector linear program solver Bensolve\u2014notes on theoretical background. Eur. J. Oper. Res. 260(3), 807\u2013813 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.02.039","journal-title":"Eur. J. Oper. Res."},{"key":"1111_CR10","doi-asserted-by":"crossref","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(3), 341\u2013354 (2021)","DOI":"10.23952\/asvao.3.2021.3.08"},{"key":"1111_CR11","volume-title":"Convex Analysis. Princeton Mathematical Series","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series. Princeton University Press, Princeton (1970)"},{"issue":"6","key":"1111_CR12","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1080\/02331934.2018.1426583","journal-title":"Optimization"},{"issue":"4","key":"1111_CR13","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. Glob. Optim. 72(4), 731\u2013742 (2018)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01111-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01111-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01111-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T04:21:16Z","timestamp":1653279676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01111-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,24]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1111"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01111-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,24]]},"assertion":[{"value":"9 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}