Saved in:
Bibliographic Details
Main Authors: Lara, Felipe, Ramos, Alberto
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.12166
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915936208945152
author Lara, Felipe
Ramos, Alberto
author_facet Lara, Felipe
Ramos, Alberto
contents We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical pro\-gra\-mming 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 sub\-di\-ffe\-ren\-tial, 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_12166
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
Lara, Felipe
Ramos, Alberto
Optimization and Control
90C26, 90C32
We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical pro\-gra\-mming 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 sub\-di\-ffe\-ren\-tial, 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.
title On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
topic Optimization and Control
90C26, 90C32
url https://arxiv.org/abs/2604.12166