Strong unicity and alternation for linear optimization (Q915659): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A refinement of an optimality criterion and its application to parametric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global unicity in semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local version of haar's theorem in approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some theorems on Cebysev approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Linear Program with a Duality Gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strong unicity in approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness and Differential Characterization of Approximations from Manifolds of Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Certain Problems of Approximation and Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5529652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895980 / rank
 
Normal rank

Latest revision as of 08:33, 21 June 2024

scientific article
Language Label Description Also known as
English
Strong unicity and alternation for linear optimization
scientific article

    Statements

    Strong unicity and alternation for linear optimization (English)
    0 references
    1991
    0 references
    We consider linear semi-infinite optimization problems and prove characterizations for strong unicity. One of these is a weak alternation property. This result suggests to introduce regular strong unicity, which is equivalent to a stronger alternation property. The theorems are used in order to prove a Haar-type theorem for linear optimization problems. An application to best Chebyshev approximation is given.
    0 references
    Haar's theorem
    0 references
    linear semi-infinite optimization
    0 references
    strong unicity
    0 references
    alternation
    0 references
    best Chebyshev approximation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references