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. In particular we show that a well-known relative interiority condition can be used as a sufficient condition for well-posedness in convex vector optimization.
@article{RO_2003__37_3_195_0, author = {Deng, Sien}, title = {Coercivity properties and well-posedness in vector optimization}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {195--208}, publisher = {EDP-Sciences}, volume = {37}, number = {3}, year = {2003}, doi = {10.1051/ro:2003021}, mrnumber = {2034539}, zbl = {1070.90095}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ro:2003021/} }
TY - JOUR AU - Deng, Sien TI - Coercivity properties and well-posedness in vector optimization JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2003 SP - 195 EP - 208 VL - 37 IS - 3 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro:2003021/ DO - 10.1051/ro:2003021 LA - en ID - RO_2003__37_3_195_0 ER -
%0 Journal Article %A Deng, Sien %T Coercivity properties and well-posedness in vector optimization %J RAIRO - Operations Research - Recherche Opérationnelle %D 2003 %P 195-208 %V 37 %N 3 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro:2003021/ %R 10.1051/ro:2003021 %G en %F RO_2003__37_3_195_0
Deng, Sien. Coercivity properties and well-posedness in vector optimization. RAIRO - Operations Research - Recherche Opérationnelle, Volume 37 (2003) no. 3, pp. 195-208. doi : 10.1051/ro:2003021. http://archive.numdam.org/articles/10.1051/ro:2003021/
[1] How to deal with the unbounded in optimization: Theory and algorithms. Math. Program. B 79 (1997) 3-18. | MR | Zbl
,[2] Existence of optimal solutions and duality results under weak conditions. Math. Program. 88 (2000) 45-59. | MR | Zbl
,[3] Convex functions with unbounded level sets and applications to duality theory. SIAM J. Optim. 3 (1993) 669-695. | MR | Zbl
, and ,[4] Partially finite convex programming, Part I: Quasi relative interiors and duality theory. Math. Program. B 57 (1992) 15-48. | MR | Zbl
and ,[5] Non-linear Parametric Optimization. Birhauser-Verlag (1983). | MR | Zbl
, , , and ,[6] Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization. J. Optim. Theory Appl. 96 (1998) 123-131. | MR | Zbl
,[7] On approximate solutions in convex vector optimization. SIAM J. Control Optim. 35 (1997) 2128-2136. | MR | Zbl
,[8] Well-posed problems and error bounds in optimization, in Reformulation: Non-smooth, Piecewise Smooth, Semi-smooth and Smoothing Methods, edited by Fukushima and Qi. Kluwer (1999). | MR | Zbl
,[9] On variational principles, level sets, well-posedness, and -solutions in vector optimization. J. Optim. Theory Appl. 89 (1996) 325-349. | MR | Zbl
and ,[10] Well-Posed Optimization Problems. Springer-Verlag, Lecture Notes in Math. 1543 (1993). | MR | Zbl
and ,[11] Vector equilibrium problems under recession analysis. preprint, 2001. | MR
and ,[12] Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications. J. Math. Anal. Appl. 264 (2001) 270-287. | MR | Zbl
and ,[13] Pointwise well-posedness of perturbed vector optimization problems in a vector-valued variational principle. J. Optim. Theory Appl. 108 (2001) 671-686. | MR | Zbl
,[14] A variational principle for problems with functional constraints. SIAM J. Optim. 12 (2001) 461-478. | MR | Zbl
, and ,[15] On extensions of Frank-Wolfe theorem. J. Comput. Optim. Appl. 13 (1999) 87-110. | MR | Zbl
and ,[16] Theory of Vector Optimization. Springer-Verlag (1989). | MR
,[17] Well-posedness, towards vector optimization. Springer-Verlag, Lecture Notes Economy and Math. Syst. 294 (1986).
,[18] Convex Analysis. Princeton University Press (1970). | MR | Zbl
,[19] Conjugate Duality and Optimization. SIAM (1974). | MR | Zbl
,[20] Variational Analysis. Springer-Verlag (1998). | MR | Zbl
and ,[21] Theory of Multi-objective Optimization. Academic Press (1985). | MR | Zbl
, and ,[22] Well-posedness and optimization under perturbations. Ann. Oper. Res. 101 (2001) 351-361. | MR | Zbl
,Cited by Sources: