A CONSTRAINT QUALIFICATION FOR CONVEX PROGRAMMING

被引：0

作者：

李师正

机构：

来源：

Acta Mathematicae Applicatae Sinica | 2000年 / 04期

基金：

中国国家自然科学基金;

关键词：

Constraint qualification; convex programmin4;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

This paper derives a new constraint qualification for nondifferential convex programming problem, by using the distance between the feasible set and the perturbed feasible sets. If the feasible sot is bounded, then this constraint qualification is weaker than Stater’s constrains qualification.

引用

页码：362 / 365

页数：4

共 50 条

[1] A constraint qualification for convex programming
Li Shizheng
[J]. Acta Mathematicae Applicatae Sinica, 2000, 16 (4) : 362 - 365
[2] A SIMPLE CONSTRAINT QUALIFICATION IN CONVEX-PROGRAMMING
ZHOU, X
MOKHTARIAN, FS
ZLOBEC, S
[J]. MATHEMATICAL PROGRAMMING, 1993, 61 (03) : 385 - 397
[3] On the necessity of some constraint qualification conditions in convex programming
Tiba, D
Zalinescu, C
[J]. JOURNAL OF CONVEX ANALYSIS, 2004, 11 (01) : 95 - 110
[4] CHARACTERIZATION OF OPTIMALITY IN CONVEX PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION
BENTAL, A
BENISRAEL, A
ZLOBEC, S
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1976, 20 (04) : 417 - 437
[5] ERROR BOUND CHARACTERIZATIONS OF THE CONICAL CONSTRAINT QUALIFICATION IN CONVEX PROGRAMMING
Barbara, Abdessamad
Jourani, Abderrahim
[J]. SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (03) : 2013 - 2040
[6] DUALITY FOR GENERALIZED CONVEX-PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION
WEIR, T
MOND, B
[J]. UTILITAS MATHEMATICA, 1987, 31 : 233 - 242
[7] DUALITY THEOREMS FOR CONVEX-PROGRAMMING WITHOUT CONSTRAINT QUALIFICATION
KANNIAPPAN, P
[J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1984, 36 (APR): : 253 - 266
[8] CHARACTERIZATION OF OPTIMALITY IN CONVEX PROGRAMMING WITHOUT A CONSTRAINT QUALIFICATION - PRELIMINARY-REPORT
BENTAL, A
BENISRAEL, A
ZLOBEC, S
[J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (01): : A222 - A222
[9] CONSTRAINT QUALIFICATION IN A NONDIFFERENTIABLE PROGRAMMING PROBLEM
MOND, B
SCHECHTER, M
[J]. NAVAL RESEARCH LOGISTICS, 1976, 23 (04) : 611 - 613
[10] DUALITY WITHOUT CONSTRAINT QUALIFICATION FOR MULTIOBJECTIVE PROGRAMMING
EGUDO, RR
WEIR, T
MOND, B
[J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, 1992, 33 : 531 - 544

← 1 2 3 4 5 →