期刊文献+

INTERIOR POINT PROJECTED REDUCED HESSIAN METHOD WITH TRUST REGION STRATEGY FOR NONLINEAR CONSTRAINED OPTIMIZATION

INTERIOR POINT PROJECTED REDUCED HESSIAN METHOD WITH TRUST REGION STRATEGY FOR NONLINEAR CONSTRAINED OPTIMIZATION
下载PDF
导出
摘要 A interior point scaling projected reduced Hessian method with combination of nonmonotonic backtracking technique and trust region strategy for nonlinear equality constrained optimization with nonegative constraint on variables is proposed. In order to deal with large problems, a pair of trust region subproblems in horizontal and vertical subspaces is used to replace the general full trust region subproblem. The horizontal trust region subproblem in the algorithm is only a general trust region subproblem while the vertical trust region subproblem is defined by a parameter size of the vertical direction subject only to an ellipsoidal constraint. Both trust region strategy and line search technique at each iteration switch to obtaining a backtracking step generated by the two trust region subproblems. By adopting the l 1 penalty function as the merit function, the global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion and the second order correction step are used to overcome Maratos effect and speed up the convergence progress in some ill-conditioned cases. MR Subject Classification 90C30 - 65K05 - 49M40 Keywords trust region method - backtracking step - reduced Hessian - nonmonotonic technique - interior point Supported partially by the National Natural Science Foundation of China (10071050), Science Foundation (02ZA14070) of Shanghai Technical Sciences Committee and Science Foundation (02DK06) of Shanghai Education Committee. A interior point scaling projected reduced Hessian method with combination of nonmonotonic backtracking technique and trust region strategy for nonlinear equality constrained optimization with nonegative constraint on variables is proposed. In order to deal with large problems, a pair of trust region subproblems in horizontal and vertical subspaces is used to replace the general full trust region subproblem. The horizontal trust region subproblem in the algorithm is only a general trust region subproblem while the vertical trust region subproblem is defined by a parameter size of the vertical direction subject only to an ellipsoidal constraint. Both trust region strategy and line search technique at each iteration switch to obtaining a backtracking step generated by the two trust region subproblems. By adopting the l 1 penalty function as the merit function, the global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion and the second order correction step are used to overcome Maratos effect and speed up the convergence progress in some ill-conditioned cases. MR Subject Classification 90C30 - 65K05 - 49M40 Keywords trust region method - backtracking step - reduced Hessian - nonmonotonic technique - interior point Supported partially by the National Natural Science Foundation of China (10071050), Science Foundation (02ZA14070) of Shanghai Technical Sciences Committee and Science Foundation (02DK06) of Shanghai Education Committee.
作者 朱德通
机构地区 Dept.ofMath.
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第3期311-326,共16页 高校应用数学学报(英文版)(B辑)
基金 Supported partially by the National Natural Science Foundation of China( 1 0 0 71 0 5 0 ) ScienceFoundation ( 0 2 ZA1 4 0 70 ) of Shanghai Technical Sciences Committee and Science Foundation ( 0 2 DK0 6) ofShanghai Education Committee.
关键词 MR Subject Classification 90C30 65K05 49M40 MR Subject Classification 90C30 65K05 49M40
  • 相关文献

参考文献9

  • 1Bonnans,J.F.,Pola, C.,A trust region interior point algorithm for linear constrained optimization,SIAM J.Optimization,1997,7(3):717-731.
  • 2Coleman,T.F.,Li,Y.,An interior trust region approach for minimization subject to bounds,SIAM J.Optimization,1996,6(3):418-445.
  • 3Deng Niayang,Xiao Yi,Zhou Fangjun,A nonmonotonic trust region algorithm,Journal of Optimization Theory and Applications,1993,76:259-285.
  • 4Grippo,L.,Lampariello,F.,Lucidi,S.,A nonmonotonic line search technique for Newton's methods,SIAM Journal on Numerical Analysis,1986,23:707-716.
  • 5More,J.J.,Sorensen,D.C.,Computing a trust region step,SIAM Journal on Science and Statistical Computing,1983,4:553-572.
  • 6Nocedal,J.,Overton,M.L.,Projected Hessian updating algorithms for nonlinearly constrained optimization,SIAM J.Numer.Anal.,1985,22:821-850.
  • 7Nocedal,J.,Yuan,Y.,Combining trust region and line search techniques,In: Y.Yuan,ed.,Advances in Nonlinear Programming,Kluver,Dordvechat,1998,153-175.
  • 8Zhang Jianzhong,Zhu Detong,A trust region typed dogleg method for nonlinear optimization,Optimization,1990,21:543-557.
  • 9Zhu Detong,Trust region methods with nonmonotonic back tracking technique for constrained optimization,Optimization,1999,46:81-113.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部