Abstract Kuhn-Tucker theorems

DOI10.1007/BF00939777MaRDI QIDQ1090920zbMATH OpenFDO

Authors Stephen Simons

Publication date 1988

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00939777

zbMATH Keywords

constrained convex minimization problemsKuhn-Tucker theoremLagrange multipliersMazur-Orlicz-König theoremsublinear functionals

Mathematics Subject Classification ID

Optimality conditions for problems in abstract spaces (49K27) Optimality conditions for minimax problems (49K35) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Review text

We discuss abstract versions of the Kuhn-Tucker theorem for constrained convex minimization problems, in which we relax both the conditions of convexity and also the requirement that the number of constraints be finite.

Recommendations

• scientific article; zbMATH DE number 1559053
• A new proof of the Kuhn-Tucker and Farkas theorems
• Modified Kuhn-Tucker conditions when a minimum is not attained
• New perspective on the Kuhn-Tucker theorem
• A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential

Cites work

• scientific article; zbMATH DE number 3634008 (Why is no real title available?)
• Minimax Theorems
• On certain applications of the Hahn-Banach and minimax theorems

Cited in

(9)

• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
• Locomotor development prediction based on statistical model parameters identification
• A new proof of the Kuhn-Tucker and Farkas theorems
• A Direct Proof of the Kuhn–Tucker Necessary Optimality Theorem for Convex and Affine Inequalities
• On minimization subject to cone constraints
• scientific article; zbMATH DE number 1559053 (Why is no real title available?)
• Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems
• Modified Kuhn-Tucker conditions when a minimum is not attained

This page was built for publication: Abstract Kuhn-Tucker theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090920)