DocumentCode :
495024
Title :
Well Posedness of Generalized Mutually Minimization Problem
Author :
Ren-Xing Ni
Author_Institution :
Dept. of Math., Shaoxing Univ., Shaoxing, China
Volume :
3
fYear :
2009
fDate :
21-22 May 2009
Firstpage :
329
Lastpage :
332
Abstract :
Let C be a closed bounded convex subset of a Banach space X with 0 being an interior point of C and pC(.) be the Minkowski functional with respect to C. Let B(X) be the family of nonempty bounded closed subset of X endowed with the Hausdorff distance. A generalized mutually minimization problem minC(F,G) is said to be well posed if it has a unique solution (x. z) and every minimizing sequence converges strongly to (x. z). Under the assumption that C is both strictly convex and Kadec, G is a nonempty closed, relatively boundedly weakly compact subset of X, using the concept of the admissible family M of B(X) , we prove the generic result that the set E of all subsets F such that the generalized mutually minimization problem minC(F,G) is well posed is a dense subset of M. These extend and sharpen some recent results due to De Blasi, Myjak and Papini, Li, Li and Xu, and Ni, etc.
Keywords :
Banach spaces; convex programming; minimisation; sequences; set theory; Banach space; Hausdorff distance; Minkowski functional; closed bounded convex subset; generalized mutually minimization problem; minimization sequence; Extraterrestrial measurements; Mathematics; dense subset; generalized mutually minimization problem; minimization sequence; relatively boundedly weakly compact subset; well posed;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Computing Science, 2009. ICIC '09. Second International Conference on
Conference_Location :
Manchester
Print_ISBN :
978-0-7695-3634-7
Type :
conf
DOI :
10.1109/ICIC.2009.288
Filename :
5168871
Link To Document :
بازگشت