Combined phase I—phase II methods of feasible directions

1. E. Polak and D.Q. Mayne, “An algorithm for optimization problems with functional inequality constraints”,IEEE Transactions on Automatic Control, AC-21 (2) (1976) 184–193.

   Google Scholar 

2. E. Polak, K.S. Pister and D. Ray, “Optimal design of framed structures subjected to earthquakes”,Engineering Optimization 2 (1976) 65–71.

   Google Scholar 

3. E. Polak and R. Trahan, “An algorithm for computer aided design problems”,Proceedings of the 1976 IEEE conference of decision and control, Dec. 1976, pp. 537–542.

4. D.Q. Mayne, E. Polak and R. Trahan, “An outer approximations algorithm for computer aided design problems”, to appear.

5. F. John, “Extreme problems with inequalities as side conditions”, in: K.O. Friedrichs, O.W. Neugebauer and J.J. Stoker, eds.,Studies and essays: Courant anniversary volume (Interscience, New York, 1948).

   Google Scholar 

6. G. Zoutendijk,Methods of feasible directions (Elsevier, Amsterdam, 1970).

   Google Scholar 

7. D.M. Topkis and A.F. Veinott, Jr., “On the convergence of some feasible direction algorithms for nonlinear programming”,SIAM Journal on Control, 5 (2) (1967) 268–279.

   Google Scholar 

8. O. Pironneau and E. Polak, “Rate of convergence of a class of methods of feasible directions”,SIAM Journal on Numerical Analysis 10 (1) (1973) 161–173.

   Google Scholar 

9. S.I. Zukhovitskii, R.A. Polyak and M.E. Primak, “An algorithm for the solution of convex programming problems”,DAN USSR 153 (5) (1963) 991–1000.

   Google Scholar 

10. M.D. Canon, C.D. Cullum, Jr. and E. Polak,Theory of optimal control and mathematical programming (McGraw-Hill, New York, 1970).

    Google Scholar 

11. E. Polak,Computational methods in optimization: a unified approach (Academic Press, New York, 1971).

    Google Scholar 

12. O. Pironneau and E. Polak, “On the rate of convergence of certain methods of centers”,Mathematical Programming, 2 (2) (1972) 230–257.

    Google Scholar 

13. D.M. Himmelblau,Applied nonlinear programming (McGraw-hill, New York, 1972).

    Google Scholar 

14. D.Q. Mayne and E. Polak, “Feasible directions algorithms for optimization problems with equality and inequality constraints”,Mathematical Programming, 11 (1) (1976) 67–80.

    Google Scholar 

15. E. Polak, R. Trahan and D.Q. Mayne, Combined phase I—phase II methods of feasible directions, Memorandum No. UCB/ERL M77 139, Electronics Research Laboratory, College of Engineering, University of California, Berkeley (1977).

    Google Scholar 

16. A.R. Conn, “Constrained optimization using a non differentiable penalty function”,SIAM Journal on Numerical Analysis 10 (4) (1973).

17. A.R. Conn and T. Pietrzykowski, “A penalty function method converging directly to a constrained optimum”, Research Report 73-11, Dept. of Combinatorics and Optimization, University of Waterloo, Ontario (1973).

    Google Scholar 

Download references