Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems

Nader Kanzi ()

Journal of Global Optimization, 2013, vol. 56, issue 2, 417-430

Abstract: This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives given as the difference of two convex functions, and (lower level) constraints described by a finite number of convex inequalities and a set constraints. First, we are interested in some various lower level constraint qualifications for the problem. Then, the results are used to establish efficient upper estimate of certain subdifferential of value functions. Finally, we apply the obtained subdifferential estimates to derive necessary optimality conditions for the problem. Copyright Springer Science+Business Media, LLC. 2013

Keywords: Semi-infinite programming; Constraint qualification; Optimality conditions; DC optimization; 90C34; 90C40; 49J52 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-011-9828-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:56:y:2013:i:2:p:417-430

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-011-9828-5

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().