Nonsmooth Invex Functions and Sufficient Optimality Conditions
✍ Scribed by Marco Castellani
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 104 KB
- Volume
- 255
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper the various definitions of nonsmooth invex functions are gathered in a general scheme by means of the concept of K-directional derivative. Characterizations of nonsmooth K-invexity are derived as well as results concerning constrained optimization without any assumption of convexity of the K-directional derivatives.
📜 SIMILAR VOLUMES
In this paper, we consider a class of nonsmooth multiobjective fractional programming problems in which functions are locally Lipschitz. We establish generalized Karush-Kuhn-Tucker necessary and sufficient optimality conditions and derive duality theorems for nonsmooth multiobjective fractional prog
Using a parametric approach, we establish necessary and sufficient conditions and derive duality theorems for a class of nonsmooth generalized minimax fractional programming problems containing pseudoinvex functions.
## Abstract For a connected graph the restricted edge‐connectivity λ′(__G__) is defined as the minimum cardinality of an edge‐cut over all edge‐cuts __S__ such that there are no isolated vertices in __G__–__S__. A graph __G__ is said to be λ′‐optimal if λ′(__G__) = ξ(__G__), where ξ(__G__) is the m
discrete time systems. Necessary and sufficient globally optimal conditions, in the form of a matrix equation and a matrix inequality, are presented for the existence of the optimal constant output feedback gain of discrete time invariant system. Furthermore, it is shown that if the optimal output g