Combined phase I—phase II methods of feasible directions

This paper presents several new algorithms, generalizing feasible directions algorithms, for the nonlinear programming problem, min{f0(z) ∣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).

[1]  E. Polak,et al.  Computational methods in optimization : a unified approach , 1972 .

[2]  E. Polak,et al.  OPTIMAL DESIGN OF FRAMED STRUCTURES SUBJECTED TO EARTHQUAKES , 1976 .

[3]  E. Polak,et al.  Rate of Convergence of a Class of Methods of Feasible Directions , 1973 .

[4]  A. Conn.  Constrained Optimization Using a Nondifferentiable Penalty Function , 1973 .

[5]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[6]  E. Polak,et al.  An algorithm for computer aided design problems , 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.

[7]  David Q. Mayne,et al.  Feasible directions algorithms for optimization problems with equality and inequality constraints , 1976, Math. Program..

[8]  T. Pietrzykowski,et al.  A Penalty Function Method Converging Directly to a Constrained Optimum , 1977 .

[9]  G. Zoutendijk,et al.  Methods of Feasible Directions , 1962, The Mathematical Gazette.

[10]  Elijah Polak,et al.  On the rate of convergence of certain methods of centers , 1972, Math. Program..

[11]  A. F. Veinott,et al.  On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming , 1967 .

[12]  D. Mayne,et al.  An outer approximations algorithm for computer-aided design problems , 1979 .

[13]  E. Polak,et al.  Theory of optimal control and mathematical programming , 1969 .

[14]  D. Mayne,et al.  An algorithm for optimization problems with functional inequality constraints , 1976 .