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 条

[41] A Constant Rank Constraint Qualification in Continuous-Time Nonlinear Programming
Moisés Rodrigues Cirilo do Monte
Valeriano Antunes de Oliveira
[J]. Set-Valued and Variational Analysis, 2021, 29 : 61 - 81
[42] A Constant Rank Constraint Qualification in Continuous-Time Nonlinear Programming
do Monte, Moises Rodrigues Cirilo
de Oliveira, Valeriano Antunes
[J]. SET-VALUED AND VARIATIONAL ANALYSIS, 2021, 29 (01) : 61 - 81
[43] A NECESSARY AND SUFFICIENT CONSTRAINT QUALIFICATION FOR SUFFICIENT OPTIMALITY CONDITIONS IN DIFFERENTIABLE PROGRAMMING
Saeki, Yusuke
Kuroiwa, Daishi
[J]. JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2016, 17 (05) : 1013 - 1024
[44] NEW CONSTRAINT QUALIFICATION AND OPTIMALITY FOR LINEAR SEMI-INFINITE PROGRAMMING
Liu, Yanqun
[J]. PACIFIC JOURNAL OF OPTIMIZATION, 2016, 12 (02): : 223 - 232
[45] Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
Mangasarian, OL
[J]. MATHEMATICAL PROGRAMMING, 1998, 83 (02) : 187 - 194
[46] Convex Inequalities Without Constraint Qualification nor Closedness Condition, and Their Applications in Optimization
N. Dinh
M. A. Goberna
M. A. López
M. Volle
[J]. Set-Valued and Variational Analysis, 2010, 18 : 423 - 445
[47] Convex Inequalities Without Constraint Qualification nor Closedness Condition, and Their Applications in Optimization
Dinh, N.
Goberna, M. A.
Lopez, M. A.
Volle, M.
[J]. SET-VALUED AND VARIATIONAL ANALYSIS, 2010, 18 (3-4) : 423 - 445
[48] Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
O. L. Mangasarian
[J]. Mathematical Programming, 1998, 83 : 187 - 194
[49] Constraint qualification, the strong chip, and best approximation with convex constraints in Banach spaces
Li, C
Ng, KF
[J]. SIAM JOURNAL ON OPTIMIZATION, 2003, 14 (02) : 584 - 607
[50] CONVEX QUADRATIC-PROGRAMMING WITH ONE CONSTRAINT AND BOUNDED VARIABLES
DUSSAULT, JP
FERLAND, JA
LEMAIRE, B
[J]. MATHEMATICAL PROGRAMMING, 1986, 36 (01) : 90 - 104

← 1 2 3 4 5 →