Refined optimality conditions for differences of convex functions
β Scribed by Tuomo Valkonen
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 186 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Communicated by F. Clarke Abstract--We establish necessary and sufficient optimality conditions for quasi-convex programming. First, we treat some properties of the normal cone to the level set of a lower semicontinuous quasi-convex function defined on a Banach space. Next, we get our condition
## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the KuhnβTucker theories