NECESSARY CONDITIONS FOR MIN-MAX PROBLEMS AND ALGORITHMS BY A RELAXATION PROCEDURE

被引：93

作者：

SHIMIZU, K

AIYOSHI, E

机构：

来源：

关键词：

D O I：

10.1109/TAC.1980.1102226

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：62 / 66

页数：5

共 12 条

[1] LAGRANGE MULTIPLIER THEOREM FOR MAX-MIN WITH SEVERAL CONSTRAINTS [J].

BRAM, J .

[2]

DANSKIN JM, 1967, THEORY MAX MIN ITS A

[3]

Demjano VF, 1968, J COMPUTER SYSTEM SC, V2, P342

[4]

Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810

[5] ALGORITHM FOR MINIMAX PARAMETER OPTIMIZATION [J].

HELLER, JE ;

CRUZ, JB .

[6] THE CUTTING-PLANE METHOD FOR SOLVING CONVEX PROGRAMS [J].

KELLEY, JE .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04) :703-712

[7]

LASDON L, 1970, OPTIMIZATION THEORY

[8]

Mangasarian O. L., 1969, NONLINEAR PROGRAMMIN

[9]

MEDANIC J, 1972, 5TH P IFAC C PAR

[10] VALIDITY OF A FAMILY OF OPTIMIZATION METHODS [J].

MEYER, R .

SIAM JOURNAL ON CONTROL, 1970, 8 (01) :41-+