Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints

This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several sta...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications 2018-12, Vol.179 (3), p.800-819
Hauptverfasser:	Kazemi, Sajjad, Kanzi, Nader
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Calculus of Variations and Optimal Control Optimization Engineering Mathematical analysis Mathematical programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several stationary conditions of type Karush/Kuhn–Tucker.
ISSN:	0022-3239 1573-2878
DOI:	10.1007/s10957-018-1373-7