Generalized K-T conditions and penalty functions for quasidifferentiable programming
A quasidifferentiable optimization problem with inequality constraints is considered. Karush-Kuhn-Tucker necessary conditions for optimality are obtained, generalizing results of Luderer, Kuntz and Scholtes, by relaxing a regularity assumption, and with multipliers independent of elements of subdifferentials. Sufficient conditions for optimality are obtained with a preinvex hypothesis, in terms of a penalty function.
Karush-Kuhn-Tucker necessary conditions for optimality
scientific article; zbMATH DE number 1286440
scientific article