Abstract
The Beale-Powell restart algorithm is highly useful for large-scale unconstrained optimization. An example is taken to show that the algorithm may fail to converge. The global convergence of a slightly modified algorithm is proved.
Similar content being viewed by others
References
Fletcher, R., Reeves, C., Function minimization by conjugate gradients,Comput. J., 1964, 7: 149.
Polak, E., Ribière, G., Note sur la convergence de directions conjugées,Rev. Francaise Informat. Recherche Opertionelle, 1969, 3(16): 35.
Polyak, B. T., The conjugate gradient method in extremum problems, USSRCamp. Math. and Math. Phys., 1969, 9: 94.
Dai, Y. H., Yuan. Y., Convergence properties of the Fletcher-Reeves method,IMAJ. Numer. Anal., 1996, 16(2): 155.
Gilbert, J. C., Nocedal, J., Global convergence properties of conjugate gradient methods for optimization,SIAM J. Optimization, 1992, 2(1): 21.
Crowder, H. P., Wolfe, P., Linear convergence of the conjugate gradient method,IBM J. Res. Dev., 1969, 16: 431.
Yuan, Y., Analysis on the conjugate gradient method,Optimization Methods and Software, 1993, 2: 19.
Cohen, A., Rate of convergence of several conjugate gradient algorithms,SIAM J Numer. Anal., 1972, 9: 248.
McCormick, G. P., Ritter, K., Alternative proofs of the convergence properties of the conjugate-gradient method,JOTA, 1975, 13(5): 497.
Powell, M. J. D., Restart procedures of the conjugate gradient method.Math. Program, 1977, 2: 241.
Beale, E. M. L., A derivative of conjugate gradients, inNumerical Methods for Nonlinear Optimization (ed. Lootsma, F.), London: Academic Press, 1972, 39–43.
Deng, N., Li, Z., Global convergence of three terms conjugate gradient methods,Optimization Methods and Software, 1995, 4: 273.
Liao, D., Liu, C.,Some New Techniques in Numerical Weather Prediction, Beijing: Meteorological Publishers, 1995.
Powell, M. J. D., Nonconvex minimization calculations and the conjugate gradient method. inNumerical Analysis, Lecture Notes in Mathematics (ed. Griffths, D. F.), Berlin: Springer-Verlag, 1984, 1066: 122–141.
Morè, J. J., Thuente, D. J., Line search algorithms with guaranteed sufficient decrease,ACM Transactions on Mathematics Software, 1994, 20(3): 286.
Wolfe, P., Convergence conditions for ascent methods,SIAM Review, 1969, 11: 226.
Wolfe, P., Convergence conditions for ascent methods II: Some corrections,SIAM Review, 1969, 13: 185.
Zoutendijk G. Nonlinear programming, computational Methods, inInteger and Nonlinear Programming (ed. Abadie, J.), Amsterdam: North-Holland, 1970, 37–86.
Author information
Authors and Affiliations
Additional information
Project partially supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Dai, Y., Yuan, Y. Convergence properties of Beale-Powell restart algorithm. Sci. China Ser. A-Math. 41, 1142–1150 (1998). https://doi.org/10.1007/BF02871976
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02871976