A simple constraint qualification in infinite dimensional programming (Q3731366): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56935986, #quickstatements; #temporary_batch_1714830594367
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of optimality without constraint qualification for the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Farkas’ Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Reflexive Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained \(L_ p\) approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of optimization in matrix theory / rank
 
Normal rank

Revision as of 14:18, 17 June 2024

scientific article
Language Label Description Also known as
English
A simple constraint qualification in infinite dimensional programming
scientific article

    Statements

    A simple constraint qualification in infinite dimensional programming (English)
    0 references
    0 references
    0 references
    1986
    0 references
    infinite dimensional linear programming
    0 references
    equality constraints
    0 references
    constant qualification
    0 references
    Slater's condition
    0 references
    duality theorems
    0 references
    \(L_ 2\)- approximation
    0 references

    Identifiers