Starshaped sets and best approximation (Q1173765): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Limits of starshaped sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-posed optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5338702 / rank
 
Normal rank

Latest revision as of 09:44, 15 May 2024

scientific article
Language Label Description Also known as
English
Starshaped sets and best approximation
scientific article

    Statements

    Starshaped sets and best approximation (English)
    0 references
    0 references
    25 June 1992
    0 references
    Let \(E\) be a real Banach space, and \(A\) a nonempty closed proper subset of \(E\). A point \(x_ 0\) in the closed and bounded set \(X\) is called a solution of the minimization problem \((d_ A,X)\) if \(d(x_ 0,A)=\inf\{d(x,A)\mid x\in X\}\). The problem \((d_ A,X)\) is said to be well posed if it has a unique solution and if every minimizing sequence converges to the solution. The authors prove that, when \(E\) is reflexive, the set of starshaped \(X\) such that \((d_ A,X)\) is well-posed forms a dense \(G_ \delta\)-subset of the metric space (under the Hausdorff distance) of starshaped closed and bounded subsets of \(E\) which are at positive distance from \(A\). Analogous results are proved for maximization problems under the additional hypothesis that \(A\) is convex, and for approximation by elements of convex sets.
    0 references
    0 references
    0 references
    starshaped sets
    0 references
    minimizing sequence
    0 references
    nearest point
    0 references
    real Banach space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references