A dual parametrization method for convex semi-infinite programming

被引：34

作者：

Ito, S ^{[1
]}

Liu, Y

Teo, KL

机构：

[1] Inst Stat Math, Ctr Dev Stat Comp, Minato Ku, 4-6-7 Minami Azabu, Tokyo 1068569, Japan

[2] Hong Kong Polytech Univ, Dept Appl Math, Kowloon, Peoples R China

来源：

ANNALS OF OPERATIONS RESEARCH | 2000年 / 98卷 / 1-4期

关键词：

semi-infinite programming; convex programming; optimality condition; duality; converse duality; quadratic semi-infinite programming; linear semi-infinite programming;

D O I：

10.1023/A:1019208524259

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

We formulate convex semi-infinite programming problems in a functional analytic setting and derive optimality conditions and several duality results, based on which we develop a computational framework for solving convex semi-infinite programs.

引用

页码：189 / 213

页数：25

共 62 条

[1]

LIMIT ANALYSIS WITH THE DUAL AFFINE SCALING ALGORITHM [J].

ANDERSEN, KD ;

CHRISTIANSEN, E .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1995, 59 (02) :233-243

[2]

ANDERSON EJ, 1985, LECT NOTES EC MATH S, V259

[3]

[Anonymous], 1993, WILEY INTERSCIENCE S

[4]

[Anonymous], 1987, WILEY INTERSCIENCE S

[5]

Coope ID, 1998, NONCON OPTIM ITS APP, V25, P137

[6]

A DUALITY THEOREM FOR CONVEX PROGRAMS [J].

DORN, WS .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (04) :407-414

[7]

DORN WS, 1960, Q APPL MATH, V18, P155, DOI [10.1090/qam/112751, DOI 10.1090/QAM/112751]

[8]

AN INTERIOR POINT ALGORITHM FOR SEMI-INFINITE LINEAR-PROGRAMMING [J].

FERRIS, MC ;

PHILPOTT, AB .

MATHEMATICAL PROGRAMMING, 1989, 43 (03) :257-276

[9]

ON AFFINE SCALING AND SEMIINFINITE PROGRAMMING [J].

FERRIS, MC ;

PHILPOTT, AB .

MATHEMATICAL PROGRAMMING, 1992, 56 (03) :361-364

[10]

GLASHOFF K, 1978, EINFUHRUNG LINEARE O

← 1 2 3 4 5 6 7 →