Abstract
We present an improved method. If we assume that the objective function is twice continuously differentiable and uniformly convex, we discuss global and superlinear convergence of the improved quasi-Newton method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Byrd R H, Nocedal J. A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J Numer Anal, 1989,26(3): 727–739
Powell M J D. Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Cottle R W ed. Nonlinear Programming. Philadephia: SIAM-AMS Proceedings, vol IX, Americal Methematical Society, Providence, 1976
Pearson J D. Variable metric methods of minimization. Computer J, 1969,12: 171–178
Byrd R H, Nocedal J, Yuan Yaxiang. Global convergence of a class of quasi-Newton methods on convex problems. SIAM J Numer Anal, 1987,24:1171–1189
Dennis J E, More J J. A characterization of superlinear convergence and its application to quasi-Newton methods. Math Comput, 1974,28: 549–560
Author information
Authors and Affiliations
Additional information
Fei Pusheng: born in Mar. 1941. Professor. Current research interest is in optimization theory and application
Supported by the National Natural Science Foundation of China
Rights and permissions
About this article
Cite this article
Pusheng, F., Zhong, C. An improved quasi-newton method for unconstrained optimization. Wuhan Univ. J. of Nat. Sci. 1, 35–37 (1996). https://doi.org/10.1007/BF02827575
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02827575