2007
DOI: 10.1016/j.jmaa.2006.02.055
|View full text |Cite
|
Sign up to set email alerts
|

Existence and porosity for a class of perturbed optimization problems in Banach spaces

Abstract: Let X be a Banach space and Z a nonempty closed subset of X. Let J : Z → R be an upper semicontinuous function bounded from above. This paper is concerned with the perturbed optimization problem sup z∈Z {J (z) + x − z }, which is denoted by (x, J )-sup. We shall prove in the present paper that if Z is a closed boundedly relatively weakly compact nonempty subset, then the set of all x ∈ X for which the problem (x, J )-sup has a solution is a dense G δ -subset of X. In the case when X is uniformly convex and J i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…For more developments and extensions in this direction, the readers are referred to [2,3,7,8,11,[22][23][24][25][26][27][28][29][31][32][33] and the surveys [12,30].…”
Section: Introductionmentioning
confidence: 99%
“…For more developments and extensions in this direction, the readers are referred to [2,3,7,8,11,[22][23][24][25][26][27][28][29][31][32][33] and the surveys [12,30].…”
Section: Introductionmentioning
confidence: 99%
“…In the case when p = 1, Baranger in [2] proved that if X is a uniformly convex Banach space then the set of all x ∈ X for which the problem min J (x, Z ) has a solution is a dense G δ -subset of X , which clearly extends Stechkin's results in [30] on the best approximation problem. Since then, this problem has been studied extensively, see for example [6,8,20,28]. In particular, Cobzas extended in [9] Baranger's result to the setting of reflexive Kadec Banach space; while Ni relaxed in [27] the reflexivity assumption made in Cobzas' result. For the general case when p > 1, this kind of perturbed optimization problems is only founded to be studied by Bidaut in [6].…”
Section: Introductionmentioning
confidence: 99%