𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi-convex functions and applications to optimality conditions in nonlinear programming

✍ Scribed by A. Hassouni; A. Jaddar

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
214 KB
Volume
14
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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 conditions via some variational inequalities. (~) 2000 Elsevier Science Ltd. All rights reserved.

πŸ“œ SIMILAR VOLUMES

Quasi M-convex and L-convex functionsβ€”qu
Quasi M-convex and L-convex functionsβ€”quasiconvexity in discrete optimization
✍ Kazuo Murota; Akiyoshi Shioura πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 298 KB

We introduce two classes of discrete quasiconvex functions, called quasi M-and L-convex functions, by generalizing the concepts of M-and L-convexity due to Murota (Adv. Math. 124 (1996) 272) and (Math. Programming 83 (1998) 313). We investigate the structure of quasi Mand L-convex functions with res

Constraint qualifications for optimality
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
✍ D.H. Fang; C. Li; K.F. Ng πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 437 KB

For an inequality system defined by an infinite family of proper convex functions (not necessarily lower semicontinuous), we introduce some new notions of constraint qualifications. Under the new constraint qualifications, we provide necessary and/or sufficient conditions for the KKT rules to hold.