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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 171; no. 2; pp. 617 - 642
Main Authors:	Van Hang, Nguyen Thi, Yen, Nguyen Dong
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2016 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!