New qualification conditions for convex optimization without convex representation (Q828724): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q127724174, #quickstatements; #temporary_batch_1721907425334
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel duality and the strong conical hull intersection property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions in convex optimization revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications in convex vector semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong conical hull intersection property for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Approach to Nonlinearly Constrained Best Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing best approximation from a convex set without convex representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Slater's constraint qualification for infinite convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of the feasible set in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex optimization without convex representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679784 / rank
 
Normal rank

Revision as of 16:35, 25 July 2024

scientific article
Language Label Description Also known as
English
New qualification conditions for convex optimization without convex representation
scientific article

    Statements

    New qualification conditions for convex optimization without convex representation (English)
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    convex optimization
    0 references
    constraint qualification
    0 references
    non-convex constraint
    0 references
    necessary and sufficient optimality conditions
    0 references
    karush-Kuhn-Tucker conditions
    0 references
    Lagrange multipliers
    0 references
    best approximation
    0 references

    Identifiers