Asymptotical good behavior on inequalities with completely approximate K-T concept (Q435757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to deal with the unbounded in optimization: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Functions with Unbounded Level Sets and Applications to Duality Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well behaved asymptotical convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing and Stationary Sequences of Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on subdifferentials of convex composite functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3553516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Hoffman’s Error Bound to Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Condition Number for Differentiable Convex Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds in mathematical programming / rank
 
Normal rank

Latest revision as of 11:41, 5 July 2024

scientific article
Language Label Description Also known as
English
Asymptotical good behavior on inequalities with completely approximate K-T concept
scientific article

    Statements

    Asymptotical good behavior on inequalities with completely approximate K-T concept (English)
    0 references
    0 references
    0 references
    12 July 2012
    0 references
    0 references
    minimizing sequences
    0 references
    KT sequences
    0 references
    infeasibility
    0 references
    unboundedness
    0 references
    well-behavedness
    0 references
    penalty methods
    0 references
    0 references