Optimality Conditions in DC-Constrained Mathematical Programming Problems

This paper provides necessary and sufficient optimality conditions for abstract-constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of certain mappings, in particular their structure as difference...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of optimization theory and applications Ročník 198; číslo 3; s. 1191 - 1225
Hlavní autori: Correa, Rafael, López, Marco A., Pérez-Aros, Pedro
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.09.2023
Springer Nature B.V
Predmet:
Applications of Mathematics
Applied mathematics
Calculus of Variations and Optimal Control; Optimization
Convex analysis
Engineering
Mathematical analysis
Mathematical programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Semidefinite programming
Theory of Computation
90C34
Supremum function
90C26
DC-constrained programming
Infinite programming
DC functions
Conic programming
Semi-definite programming
Stochastic programming
Primary: 90C30
ISSN:0022-3239, 1573-2878
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper provides necessary and sufficient optimality conditions for abstract-constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of certain mappings, in particular their structure as difference of convex functions, and uses techniques of generalized differentiation (subdifferential and coderivative). It turns out that these tools can be used fruitfully out of the scope of Asplund spaces. Applications to infinite, stochastic and semi-definite programming are developed in separate sections.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-023-02260-x