The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper studies the issue of well-posedness for vector optimization. It is shown that coercivity implies well-posedness without any convexity assumptions on problem data. For convex vector optimization problems, solution sets of such problems are non-convex in general, but they are highly structured. By exploring such structures carefully via convex analysis, we are able to obtain a number of positive results, including a criterion for well-posedness in terms of that of associated scalar problems....
This paper studies the issue of well-posedness
for vector optimization. It is shown that
coercivity implies well-posedness without any convexity assumptions
on problem data.
For
convex vector optimization problems,
solution sets of such problems are non-convex in general,
but they are highly structured.
By exploring such structures carefully via convex analysis,
we are able to obtain
a number of positive results, including a criterion for well-posedness
in terms of that of associated scalar...
Download Results (CSV)