A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization

In this paper we propose a two-piece update of projected Hessian algorithm with trust region method for solving nonlinear equality constrained optimization problems. In order to deal with large scale problems, a two-piece update of two side reduced Hessian is used to replace full Hessian matrix. By adopting the l"1 penalty function as the merit function, a nonmonotonic trust region strategy is suggested which does not require the merit function to reduce its value in every iteration. The calculation of a correction step, which is necessary from theoretical point to overcome Maratos effect but sometime brings in negative results in practice, is avoided in most cases by setting a criterion to judge its necessity. The proposed algorithm which switches to nonmonotonic trust region strategy possess global convergence while maintaining one-step Q-superlinear local convergence rates if at least one of the update formula is updated at each iteration. The numerical experiment is reported to show the effectiveness of the proposed algorithms.

[1]  L. Grippo,et al.  A nonmonotone line search technique for Newton's method , 1986 .

[2]  M. J. D. Powell,et al.  On the global convergence of trust region algorithms for unconstrained minimization , 1984, Math. Program..

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

[4]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

[5]  Chaya Gurwitz.  Local Convergence of a Two-Piece Update of a Projected Hessian Matrix , 1994, SIAM J. Optim..

[6]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[7]  T. Coleman,et al.  On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem , 1984 .

[8]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[9]  Ya-Xiang Yuan.  Advances in Nonlinear Programming , 1998 .

[10]  Jorge Nocedal,et al.  Combining Trust Region and Line Search Techniques , 1998 .

[11]  Ya-Xiang Yuan,et al.  A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..

[12]  Jianzhon Zhang,et al.  A convergent secant method for constrained optimization , 1994 .

[13]  N. Deng,et al.  Nonmonotonic trust region algorithm , 1993 .

[14]  Richard A. Tapia,et al.  A trust region strategy for nonlinear equality constrained op-timization , 1984 .

[15]  Detong Zhu,et al.  A nonmonotonic trust region method for constrained optimization problems , 1999 .

[16]  E. Omojokun.  Trust region algorithms for optimization with nonlinear equality and inequality constraints , 1990 .

[17]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .