Abstract
PSB (Powell-Symmetric-Broyden) algorithm is a very important algorithm and has been extensively used in trust region methods. However, there are few studies on the line search type PSB algorithm. The primary reason is that the direction generated by this class of algorithms is not necessarily a descent direction of the objective function. In this paper, by combining a nonmonotone line search technique with the PSB method, we propose a nonmonotone PSB algorithm for solving unconstrained optimization. Under proper conditions, we establish global convergence and superlinear convergence of the proposed algorithm. At the same time we verify the efficiency of the proposed algorithm by some numerical experiments.
Similar content being viewed by others
References
An, X.M., Li, D.H., Xiao, Y.H.: Sufficient descent directions in unconstrained optimization. Comput. Optim. Appl. 10, 1573–2894 (2009)
Byrd, R.H., Khalfan, H.F., Schnabel, R.B.: Analysis of a symmetric rank-one trust region method. SIAM J. Optim. 6, 1025–1039 (1996)
Byrd, R.H., Nocedal, J., Yuan, Y.X.: Global convergence of a class of quasi-Newton methods on convex problem. SIAM J. Numer. Anal. 24, 1171–1190 (1987)
Dai, Y.H.: On the nonmonotone line search. J. Optim. Theory Appl. 112(2), 315–330 (2002)
Dai, Y.H.: Convergence properties of the BFGS algorithm. SIAM J. Optim. 13, 693–701 (2003)
Dai, Y.H., Yuan, Y.X.: A class of globally convergent conjugate gradient methods. Sci. China Ser. A 46(2), 251–261 (2003)
Dennis, J.E. Jr., Moré, J.J.: A characterization of superlinear convergence and its applications to quasi-Newton methods. Math. Comput. 28, 549–560 (1974)
Grippo, L., Sciandrone, M.: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method. Comput. Optim. Appl. 23, 143–169 (2002)
Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton’s method. SIAM J. Numer. Anal. 23, 707–716 (1986)
Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60, 401–419 (1989)
Hther, B.: Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization. Results Math. 41, 320–333 (2002)
Li, D.H.: Global convergence of nonsingular Broyden’s method for solving unconstrained optimizations. Math. Numer. Sin. 17, 321–330 (1995)
Li, D.H., Fukushima, M.: A derivative-free line search and global convergence of Broyden-like method for nonlinear equations. Optim. Methods Softw. 13, 181–201 (2000)
Li, D.H., Fukushima, M.: Globally convergent Broyden-like methods for symmetric equations and applications to VIP, NCP, and MCP. Ann. Oper. Res. 103, 71–79 (2001)
Li, D.H., Fukushima, M.: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11, 1054–1064 (2001)
Liu, G.H., Han, J.Y., Sun, D.F.: Global convergence of the BFGS algorithm with nonmonotone line search. Optimization 34, 147–159 (1995)
Luksan, L., Vlcek, J.: Sparse and partially separable test problems for unconstrained and equality constrained optimization. Research Report No. V-767, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic (1998)
Moré, J.J., Trangenstein, J.A.: On the global convergence of Broyden’s method. Math. Comput. 30, 523–540 (1976)
Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 2, pp. 1–27. Academic Press, New York (1975)
Shi, Z.J., Shen, J.: Convergence of nonmonotone line search method. J. Comput. Appl. Math. 193, 397–412 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
The work is supported in part by the NNSF of China (No. 60872129, 60835004) and the Science and Technology project of Hunan Province (No. 2009SK3027).
Rights and permissions
About this article
Cite this article
Li, J., Yang, YF. & Yu, B. A nonmonotone PSB algorithm for solving unconstrained optimization. Comput Optim Appl 52, 267–280 (2012). https://doi.org/10.1007/s10589-011-9408-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-011-9408-0