First-Order Optimality Conditions for Convex Semi-Infinite Inequality Constrained Programming with Noncompact Sets

Author

Li, Meixia ; Zhou, Jinchuan

Author_Institution

Sch. of Math. & Inf. Sci., Weifang Univ., Weifang

fYear

2008

fDate

2-3 Aug. 2008

Firstpage

105

Lastpage

109

Abstract

In this paper, we study the optimal value function on a noncompact set and obtain the expressions of the subderivative and subdifferential of the optimal value function. Based on some characterizations of subderivative and subdifferential of the objective function and constraint functions, we develop the first-order necessary and sufficient optimality conditions for convex semi-infinite inequality constrained programming in which the index sets are not necessarily compact.

Keywords

constraint handling; convex programming; differential equations; set theory; convex semi infinite inequality constrained programming; first-order optimality condition; noncompact set; optimal value function; subderivative expression; subdifferential expression; Books; Functional programming; Information science; Intelligent transportation systems; Lagrangian functions; Mathematical programming; Mathematics; Power electronics; Qualifications; Writing; Convex semi-infinite inequality constrained programming; first-order optimality conditions; subderivative and subdifferential;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Electronics and Intelligent Transportation System, 2008. PEITS '08. Workshop on

Conference_Location

Guangzhou

Print_ISBN

978-0-7695-3342-1

Type

conf

DOI

10.1109/PEITS.2008.52

Filename

4634824