Convex vector functions and their subdifferential
---Publisher, magazine: ,
Publication year: 1998
Lưu Trích dẫn Chia sẻAbstract
The continuity of a convex vector function on relative interior points of its domain is studied. As a corollary of this we can see that a convex vector function is Lipschitz near any relative interior point of its domain. A new concept of subdifferential of a convex function is introduced and some its properties similar to those in the scalar case are shown. The inclusive relations between generalized Jacobian and subdifferential, the convexcity of a vector function and the monotonicity of its subdifferential are also established. Further, some neccessary and sufficient conditions for the existence of efficient solutions of vector optimization problems are also proved.
Tags: Convex vector function, subdifferential, Lipschitz function, monotone function vector optimization problem.
Các bài viết liên quan đến tác giả Đinh Thế Lục
An open mapping theorem using unbounded generalized Jacobians
A multiplier rule for multiobjective programming problems with continuous data
Recessively compact sets: properties and uses
Generating the weakly efficient set of nonconvex multiobjective problems
Chain rules for approximate Jacobians of continuous functions
Convex composite non-Lipschitz programming
Sharp variational conditions for convex composite nonsmooth functions
Equi-surjective systems of linear operators and applications
Pseudo-Jacobians and a necessary condition in dynamic optimization