论文信息 - A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization

A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization

This paper mainly aims to study a new nonmonotone line search slackness technique for unconstrained optimization problems and show that it possesses the global convergence without needing condition of convexity. We establish the corresponding algorithm and illustrate its effectiveness by virtue of some numerical tests. Simulation results indicate that the proposed method is very effective for non-convex functions.

Ping Hu | Xu-Qing Liu

[1] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..

[2] Wenyu Sun,et al. Adaptive nonmonotone line search method for unconstrained optimization , 2008 .

[3] Wenyu Sun,et al. Global convergence of nonmonotone descent methods for unconstrained optimization problems , 2002 .

[4] Wenyu Sun,et al. An unconstrained optimization method using nonmonotone second order Goldstein’s line search , 2007 .

[5] Y. H. Yu,et al. Nonmonotone Line Search Algorithm for Constrained Minimax Problems , 2002 .

[6] Z. J. Shi,et al. New Inexact Line Search Method for Unconstrained Optimization , 2005 .

[7] Jie Shen,et al. Convergence of PRP method with new nonmonotone line search , 2006, Appl. Math. Comput..

[8] Zhen-Jun Shi,et al. Convergence of nonmonotone line search method , 2006 .

[9] Zhensheng Yu,et al. A new nonmonotone line search technique for unconstrained optimization , 2008 .

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

[11] L. Grippo,et al. A truncated Newton method with nonmonotone line search for unconstrained optimization , 1989 .