A two-stage feasible directions algorithm for nonlinear constrained optimization

We present a feasible directions algorithm, based on Lagrangian concepts, for the solution of the nonlinear programming problem with equality and inequality constraints. At each iteration a descent direction is defined; by modifying it, we obtain a feasible descent direction. The line search procedure assures the global convergence of the method and the feasibility of all the iterates.We prove the global convergence of the algorithm and apply it to the solution of some test problems. Although the present version of the algorithm does not include any second-order information, like quasi-Newton methods, these numerical results exhibit a behavior comparable to that of the best methods known at present for nonlinear programming.

[1]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

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

[3]  M. C. Biggs.  On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming , 1978 .

[4]  Shih-Ping Han,et al.  Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..

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

[6]  Christakis Charalambous,et al.  Nonlinear leastpth optimization and nonlinear programming , 1977, Math. Program..

[7]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[8]  Bùi-Trong-Liêu,et al.  La mèthode des centres dans un espace topologique , 1966 .

[9]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[10]  E. Polak,et al.  A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints , 1973 .

[11]  D. Bertsekas.  On Penalty and Multiplier Methods for Constrained Minimization , 1976 .

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

[13]  M. J. D. Powell,et al.  THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[14]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[15]  Elijah Polak,et al.  Computational methods in optimization , 1971 .

[16]  D. Gabay.  Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization , 1982 .

[17]  R. Tapia.  Diagonalized multiplier methods and quasi-Newton methods for constrained optimization , 1977 .

[18]  M. J. D. Powell,et al.  Algorithms for nonlinear constraints that use lagrangian functions , 1978, Math. Program..

[19]  P. Huard.  Programmation mathématique convexe , 1968 .