NOTE ON NEW ALGORITHMS FOR CONSTRAINED MINIMAX OPTIMIZATION

被引:7
作者
COLEMAN, TF
机构
关键词
D O I
10.1007/BF01609026
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:239 / 242
页数:4
相关论文
共 4 条
[1]   EFFICIENT METHOD TO SOLVE MINIMAX PROBLEM DIRECTLY [J].
CHARALAMBOUS, C ;
CONN, AR .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1978, 15 (01) :162-187
[2]   NEW ALGORITHMS FOR NETWORK OPTIMIZATION [J].
CHARALAMBOUS, C ;
BANDLER, JW .
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 1973, MT21 (12) :815-818
[3]   PENALTY FUNCTION METHOD CONVERGING DIRECTLY TO A CONSTRAINED OPTIMUM [J].
CONN, AR ;
PIETRZYKOWSKI, T .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1977, 14 (02) :348-375
[4]   NEW ALGORITHMS FOR CONSTRAINED MINIMAX OPTIMIZATION [J].
DUTTA, SRK ;
VIDYASAGAR, M .
MATHEMATICAL PROGRAMMING, 1977, 13 (02) :140-155