On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
Set-Valued and Variational Analysis · 2026-06 · 34 (2)
DOI: 10.1007/s11228-026-00802-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Set-Valued and Variational Analysis, online erschienen am 04.05.2026. Verfasst von Felipe Lara und 1 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Agencia Nacional de Investigación y Desarrollo, universidad de Tarapaca, Universidade De São Paulo.
Abstract (Originalsprache)
We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical programming problems. We pay special attention in the case that the functional constraint belongs to a specific class of generalized convex functions known as strongly quasiconvex functions. After analyzing a specialized subdifferential, named the strong subdifferential, we compute the normal cone of the supremum function in terms of such subdifferentials, and apply this result to the mathematical programming problem. We illustrate our important results by examples.
Förderung
- Agencia Nacional de Investigación y Desarrollo
- universidad de Tarapaca
- Universidade De São Paulo
Zitieren
APA
Lara, F., & Ramos, A. (2026). On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials. Set-Valued and Variational Analysis, 34(2). https://doi.org/10.1007/s11228-026-00802-9
Vancouver
Lara F, Ramos A. On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials. Set-Valued and Variational Analysis. 2026;34(2). doi:10.1007/s11228-026-00802-9
BibTeX
@article{Lara2026,
author = {Lara, Felipe and Ramos, Alberto},
title = {On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials},
journal = {Set-Valued and Variational Analysis},
year = {2026},
volume = {34},
number = {2},
doi = {10.1007/s11228-026-00802-9}
}
EUVIMED