In this paper, we are concerned with a set-valued fractional extremal programming problem under inclusion constraints. Our approach consists of using the extremal principle (an approach initiated by Mordukhovich, which does not involve any convex approximations and convex separation arguments)...

In this paper, we propose the concept of a second-order composed contingent derivative for set-valued maps, discuss its relationship to the second-order contingent derivative and investigate some of its special properties. By virtue of the second-order composed contingent derivative, we extend...

In this paper, we first derive several characterizations of the nonemptiness and compactness for the solution set of a convex scalar set-valued optimization problem (with or without cone constraints) in which the decision space is finite-dimensional. The characterizations are expressed in terms...

This paper studies a general vector optimization problem which encompasses those related to efficiency, weak efficiency, strict efficiency, proper efficiency and approximate efficiency among others involving non necessarily preordering relations. Based on existing results about complete...

In non-regular problems the classical optimality conditions are totally inapplicable. Meaningful results were obtained for problems with conic constraints by Izmailov and Solodov (SIAM J Control Optim 40(4):1280–1295, <CitationRef CitationID="CR17">2001</CitationRef>). They are based on the so-called 2-regularity condition of the...</citationref>

In this paper, we consider a class of mathematical programs governed by second-order cone constrained parameterized generalized equations. We reformulate the necessary optimality conditions as a system of nonsmooth equations under linear independence constraint qualification and the strict...

In this paper, we provide some new necessary and sufficient conditions for pseudoconvexity and semistrict quasiconvexity of a given proper extended real-valued function in terms of the Clarke–Rockafellar subdifferential. Further, we extend to programs with pseudoconvex objective function two...

We consider various kinds of solutions to nonsmooth vector equilibrium problems with functional constraints. By using first and second-order approximations as generalized derivatives, we establish both necessary and sufficient optimality conditions. Our first-order conditions are shown to be...

This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives given as the difference of two convex functions, and (lower level) constraints described by a finite number of convex inequalities and a set constraints. First, we are...