On the Problem of Minimizing a Difference of Polyhedral Convex Functions Under Linear Constraints

This paper is concerned with two d.p. (difference of polyhedral convex functions) programming models, unconstrained and linearly constrained, in a finite-dimensional setting. We obtain exact formulae for the Fréchet and Mordukhovich subdifferentials of a d.p. function. We establish optimality condit...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications Jg. 171; H. 2; S. 617 - 642
Hauptverfasser:	Van Hang, Nguyen Thi, Yen, Nguyen Dong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2016 Springer Nature B.V
Schlagworte:	Algorithms Applications of Mathematics Approximation Calculus of Variations and Optimal Control; Optimization Computation Constraints Convex analysis Descent Differential equations Engineering Euclidean space Mathematical analysis Mathematical models Mathematical programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Programming Studies Theory of Computation Optimality conditions 90C46 49J52 d.p. programming Subdifferential Extreme point Stationary point Active index set 90C26 Density
ISSN:	0022-3239, 1573-2878
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!