COMBINED PHASE-I PHASE-II METHODS OF FEASIBLE DIRECTIONS

被引:53
作者
POLAK, E [1 ]
TRAHAN, R [1 ]
MAYNE, DQ [1 ]
机构
[1] UNIV LONDON IMPERIAL COLL SCI & TECHNOL,LONDON SW7 2AZ,ENGLAND
关键词
Constrained Optimization; Exact Penalty Functions; Feasible Directions; Phase I-Phase II Methods;
D O I
10.1007/BF01588225
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents several new algorithms, generalizing feasible directions algorithms, for the nonlinear programming problem, min{f0(z) {divides}fj(z) ≤ 0, j = 1, 2, ⋯, m}. These new algorithms do not require an initial feasible point. They automatically combine the operations of initialization (phase I) and optimization (phase II). © 1979 North-Holland Publishing Company.
引用
收藏
页码:61 / 73
页数:13
相关论文
共 17 条
[1]  
[Anonymous], 1971, COMPUTATIONAL METHOD
[2]  
Canon M.D., 1970, THEORY OPTIMAL CONTR
[3]  
CONN AR, 1973, 7311 U WAT DEP COMB
[4]  
CONN AR, 1973, SIAM J NUMERICAL ANA, V10
[5]  
Himmelblau DM., 2018, APPL NONLINEAR PROGR
[6]  
John F., 1948, STUDIES ESSAYS COURA
[7]   FEASIBLE DIRECTIONS ALGORITHMS FOR OPTIMIZATION PROBLEMS WITH EQUALITY AND INEQUALITY CONSTRAINTS [J].
MAYNE, DQ ;
POLAK, E .
MATHEMATICAL PROGRAMMING, 1976, 11 (01) :67-80
[8]  
MAYNE DQ, UNPUBLISHED
[9]   RATE OF CONVERGENCE OF A CLASS OF METHODS OF FEASIBLE DIRECTIONS [J].
PIRONNEAU, O ;
POLAK, E .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1973, 10 (01) :161-174
[10]  
PIRONNEAU O, 1972, MATH PROGRAM, V2, P230