An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints (Q3093086): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Necessary and Sufficient Qualification for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and constraint qualifications in Banach space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for Nonlinear Programming in a Banach Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces / rank
 
Normal rank

Latest revision as of 13:19, 4 July 2024

scientific article
Language Label Description Also known as
English
An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
scientific article

    Statements

    An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints (English)
    0 references
    0 references
    12 October 2011
    0 references
    Karush-Kuhn-Tucker theorem
    0 references
    inequality-constrained optimization
    0 references
    optimality conditions
    0 references
    constraint qualifications
    0 references
    linear independence
    0 references
    0 references
    0 references

    Identifiers