𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimality conditions for DC programming problems with reverse convex constraints

✍ Scribed by Saeki, Yusuke; Kuroiwa, Daishi

Book ID
122368897
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
233 KB
Volume
80
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## 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

Characterizing global optimality for DC
Characterizing global optimality for DC optimization problems under convex inequality constraints
✍ V. Jeyakumar; B. M. Glover πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 801 KB

Characterizations of global optimality are given for general difference convex (DC) optimization problems involving convex inequality constraints. These results are obtained in terms of E-subdifferentials of the objective and constraint functions and do not require any regularity condition. An exten