We consider vector optimization problems on Banach spaces without convexity assumptions. Under the assumption that the objective function is locally Lipschitz we derive Lagrangian necessary conditions on the basis of Mordukhovich subdifferential and the approximate subdifferential by Ioffe using a non-convex scalarization scheme. Finally, we apply the results for deriving necessary conditions f...

We study in this paper the first-order behavior of value functions in parametric dynamic programming with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of value functions of parametric mathematical programming problems, some new formulas on the Fréchet subdifferential of value functions in parametric dynamic programming are ob...

We establish representations of a monotone mapping as the sum of a maximal subdifferential mapping and a ‘remainder’ monotone mapping, where the remainder is either skew linear, or more broadly ‘acyclic’, in the sense that it contains no nontrivial subdifferential component. Examples are given of indecomposable and acyclic operators. In particular, we present an explicit nonlinear acyclic opera...

The aim of this note is to give an alternative proof for a recent result due to Dorsch, Jongen and Shikhman, which provides an upper estimate for the Clarke subdifferential of an infimal value function. We show the validity of this result under a weaker condition than the one assumed in the mentioned paper, while the use of the Mordukhovich subdifferential, as an intermediate step, will conside...

Sufficient optimality and sensitivity of a parameterized min-max programming with fixed feasible set are analyzed. Based on Clarke’s subdifferential and Chaney’s second-order directional derivative, sufficient optimality of the parameterized min-max programming is discussed first. Moreover, under a convex assumption on the objective function, a subdifferential computation formula of the margina...

It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric and positive semidefinite matrices. We show in this paper that the primal and dual constraint nondegeneracies, the strong regularity, the nonsingularity of the B-subdifferential of this nonsmooth system, and the nonsin...

This paper is devoted to the study the first-order behavior of the value function of a parametric optimal control problem with linear constraints and a nonconvex cost function. By establishing an abstract result on the Mordukhovich subdifferential of the value function of a parametric mathematical programming problem, we derive a formula for computing the Mordukhovich subdifferential of the val...

In this paper we introduce the concepts of quasimonotone maps and pseudoconvex functions. Moreover, a notion of pseudomonotonicity for multi mappings is introduced; it is shown that, if a function f is continuous, then its pseudoconvexity is equivalent to the pseudomonotonicity of its generalized subdifferential in the sense of Clarke and Rockafellar and prove that a lower semicontinuous functi...