A barrier method in convex vector optimization with generalized inequality constraints

被引：0
|
作者：
Durea, Marius [1 ,2 ]
Strugariu, Radu [3 ]
机构：
[1] Alexandru Ioan Cuza Univ, Fac Math, Bd Carol I 11, Iasi 700506, Romania
[2] Romanian Acad, Octav Mayer Inst Math, Iasi, Romania
[3] Gheorghe Asachi Tech Univ, Dept Math, Bd Carol I 11, Iasi 700506, Romania
来源：
OPTIMIZATION LETTERS | 2020年 / 14卷 / 03期
关键词：
Openness; Vector convexity; Gerstewitz scalarization; Barrier method; OPTIMALITY CONDITIONS;
D O I：
10.1007/s11590-019-01393-1
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this note we present a barrier method for vector optimization problems with inequality constraints. To this aim, we firstly investigate some constraint qualification conditions and we compare them to the corresponding ones in literature. Then, we define a barrier function and observe that its basic properties do work for fairly general situations, while for meaningful convergence results of the associated barrier method we should restrict ourselves to convex case and finite dimensional setting.
引用
收藏
页码：759 / 769
页数：11
相关论文
共 50 条
12345