A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization (Q1001320): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the Kuhn-Tucker multiplier rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrange Multiplier Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Multiplier Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Development of Optimization Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Optimality / rank
 
Normal rank

Latest revision as of 01:23, 29 June 2024

scientific article
Language Label Description Also known as
English
A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
scientific article

    Statements

    A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2009
    0 references
    nonlinear programming
    0 references
    Karush-Kuhn-Tucker theorem
    0 references

    Identifiers