Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387580397> ?p ?o ?g. }
Showing items 1 to 91 of
91
with 100 items per page.
- W4387580397 endingPage "2624" @default.
- W4387580397 startingPage "2598" @default.
- W4387580397 abstract "This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ç. Ararat, F. Ulus, and M. Umer, J. Optim. Theory Appl., 194 (2022), pp. 681–712], [D. Dörfler, A. Löhne, C. Schneider, and B. Weißing, Optim. Methods Softw., 37 (2022), pp. 1006–1026], [A. Löhne, B. Rudloff, and F. Ulus, J. Global Optim., 60 (2014), pp. 713–736]. They provide a polyhedral inner and outer approximation of the upper image that have a Hausdorff distance of at most . However, it is well known (see [F. Ulus, J. Global Optim., 72 (2018), pp. 731–742]), that for some unbounded problems such polyhedral approximations do not exist. In this paper, we will propose a generalized solution concept, called an –solution, that allows one to also consider unbounded CVOPs. It is based on additionally bounding the recession cones of the inner and outer polyhedral approximations of the upper image in a meaningful way. An algorithm is proposed that computes such –outer and –inner approximations of the recession cone of the upper image. In combination with the results of [A. Löhne, B. Rudloff, and F. Ulus, J. Global Optim., 60 (2014), pp. 713–736] this provides a primal and a dual algorithm that allow one to compute –solutions of (potentially unbounded) CVOPs. Numerical examples are provided." @default.
- W4387580397 created "2023-10-13" @default.
- W4387580397 creator A5030763992 @default.
- W4387580397 creator A5049287177 @default.
- W4387580397 creator A5053377238 @default.
- W4387580397 creator A5069172100 @default.
- W4387580397 creator A5080158579 @default.
- W4387580397 date "2023-10-12" @default.
- W4387580397 modified "2023-10-14" @default.
- W4387580397 title "Algorithms to Solve Unbounded Convex Vector Optimization Problems" @default.
- W4387580397 cites W1988390667 @default.
- W4387580397 cites W1989707854 @default.
- W4387580397 cites W2012902555 @default.
- W4387580397 cites W2017609413 @default.
- W4387580397 cites W2048944090 @default.
- W4387580397 cites W2054372248 @default.
- W4387580397 cites W2243995949 @default.
- W4387580397 cites W2252390983 @default.
- W4387580397 cites W2254347213 @default.
- W4387580397 cites W251973404 @default.
- W4387580397 cites W2590334092 @default.
- W4387580397 cites W2966382902 @default.
- W4387580397 cites W3100995391 @default.
- W4387580397 cites W3125598096 @default.
- W4387580397 cites W3130355952 @default.
- W4387580397 cites W3137049832 @default.
- W4387580397 cites W3154547765 @default.
- W4387580397 cites W3192756380 @default.
- W4387580397 cites W3215362574 @default.
- W4387580397 cites W4220968412 @default.
- W4387580397 cites W4252242738 @default.
- W4387580397 cites W4252722163 @default.
- W4387580397 cites W427674437 @default.
- W4387580397 cites W641771830 @default.
- W4387580397 doi "https://doi.org/10.1137/22m1507693" @default.
- W4387580397 hasPublicationYear "2023" @default.
- W4387580397 type Work @default.
- W4387580397 citedByCount "0" @default.
- W4387580397 crossrefType "journal-article" @default.
- W4387580397 hasAuthorship W4387580397A5030763992 @default.
- W4387580397 hasAuthorship W4387580397A5049287177 @default.
- W4387580397 hasAuthorship W4387580397A5053377238 @default.
- W4387580397 hasAuthorship W4387580397A5069172100 @default.
- W4387580397 hasAuthorship W4387580397A5080158579 @default.
- W4387580397 hasConcept C112680207 @default.
- W4387580397 hasConcept C114614502 @default.
- W4387580397 hasConcept C134306372 @default.
- W4387580397 hasConcept C154945302 @default.
- W4387580397 hasConcept C191399826 @default.
- W4387580397 hasConcept C193386753 @default.
- W4387580397 hasConcept C202444582 @default.
- W4387580397 hasConcept C2524010 @default.
- W4387580397 hasConcept C28826006 @default.
- W4387580397 hasConcept C33923547 @default.
- W4387580397 hasConcept C34388435 @default.
- W4387580397 hasConcept C41008148 @default.
- W4387580397 hasConcept C63584917 @default.
- W4387580397 hasConceptScore W4387580397C112680207 @default.
- W4387580397 hasConceptScore W4387580397C114614502 @default.
- W4387580397 hasConceptScore W4387580397C134306372 @default.
- W4387580397 hasConceptScore W4387580397C154945302 @default.
- W4387580397 hasConceptScore W4387580397C191399826 @default.
- W4387580397 hasConceptScore W4387580397C193386753 @default.
- W4387580397 hasConceptScore W4387580397C202444582 @default.
- W4387580397 hasConceptScore W4387580397C2524010 @default.
- W4387580397 hasConceptScore W4387580397C28826006 @default.
- W4387580397 hasConceptScore W4387580397C33923547 @default.
- W4387580397 hasConceptScore W4387580397C34388435 @default.
- W4387580397 hasConceptScore W4387580397C41008148 @default.
- W4387580397 hasConceptScore W4387580397C63584917 @default.
- W4387580397 hasFunder F4320322325 @default.
- W4387580397 hasIssue "4" @default.
- W4387580397 hasLocation W43875803971 @default.
- W4387580397 hasOpenAccess W4387580397 @default.
- W4387580397 hasPrimaryLocation W43875803971 @default.
- W4387580397 hasRelatedWork W170417015 @default.
- W4387580397 hasRelatedWork W1793337513 @default.
- W4387580397 hasRelatedWork W2132137594 @default.
- W4387580397 hasRelatedWork W2174650017 @default.
- W4387580397 hasRelatedWork W2296389180 @default.
- W4387580397 hasRelatedWork W2374577476 @default.
- W4387580397 hasRelatedWork W2798482732 @default.
- W4387580397 hasRelatedWork W3013085049 @default.
- W4387580397 hasRelatedWork W3166204570 @default.
- W4387580397 hasRelatedWork W350499458 @default.
- W4387580397 hasVolume "33" @default.
- W4387580397 isParatext "false" @default.
- W4387580397 isRetracted "false" @default.
- W4387580397 workType "article" @default.