A a set-valued optimization problem min<Subscript> C </Subscript> F(x), x ∈X <Subscript>0</Subscript>, is considered, where X <Subscript>0</Subscript> ⊂ X, X and Y are normed spaces, F: X <Subscript>0</Subscript> ⊂ Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x <Superscript>0</Superscript>,y <Superscript>0</Superscript>), y <Superscript>0</Superscript> ∈F(x <Superscript>0</Superscript>), and are called...</superscript></superscript></superscript></superscript></subscript></subscript></subscript></subscript>

In this paper, we extend the concept of cone-convexlikeness of single-valued maps to set-valued maps and study super efficiency in cone-convexlike vector optimization with set-valued maps. Under the assumption of the cone-convexlikeness, some characterizations of super efficiency are established...

We state second order necessary optimality conditions for a vector optimization problem with an arbitrary feasible set and an order in the final space given by a pointed convex cone with nonempty interior. We establish, in finite-dimensional spaces, second order optimality conditions in dual...

In this paper a new algorithm for minimizing locally Lipschitz functions is developed. Descent directions in this algorithm are computed by solving a system of linear inequalities. The convergence of the algorithm is proved for quasidifferentiable semismooth functions. We present the results of...

A new subdifferential for a locally Lipschitzian function is proposed. Based on this subdifferential, Newton methods and inexact-Newton methods for solving the system of nonsmooth equations and for solving the system of equations of smooth compositions of nonsmooth functions, are developed. The...

We give a framework for the globalization of a nonsmooth Newton method. In part one we start with recalling B. Kummer’s approach to convergence analysis of a nonsmooth Newton method and state his results for local convergence. In part two we give a globalized version of this method. Our...

The aim of this paper is to develop a method of study of Tykhonov well-posedness notions for vector valued problems using a class of scalar problems. Having a vectorial problem, the scalarization technique we use allows us to construct a class of scalar problems whose well-posedness properties...

This paper deals with the super efficient sets in vector optimization of set-valued maps. It is proved that these sets are connected under an assumption of cone-convexlikeness and upper semicontinuity. Copyright Springer-Verlag Berlin Heidelberg 1998

This paper att empts to give a unified approach to the existing three types of variational principles for vector valued functions: A. B. Nemeth (1986), Chr. Tammer (1992) and G. Isac (1996). Some of the results we obtain are variants of the authors' mentioned above. Some are even stronger than...

This paper deals with multiobjective optimization programs in which the objective functions are ordered by their degree of priority. A number of approaches have been proposed (and several implemented) for the solution of lexicographic (preemptive priority) multiobjective optimization programs....