On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms
作者:
Highlights:
•
摘要
The Newton-PCG (preconditioned conjugate gradient) like algorithms are usually very efficient. However, their efficiency is mainly supported by the numerical experiments. Recently, a new kind of Newton-PCG-like algorithms is derived in (J. Optim. Theory Appl. 105 (2000) 97; Superiority analysis on truncated Newton method with preconditioned conjugate gradient technique for optimization, in preparation) by the efficiency analysis. It is proved from the theoretical point of view that their efficiency is superior to that of Newton's method for the special cases where Newton's method converges with precise Q-order 2 and α(⩾2), respectively. In the process of extending such kind of algorithms to the more general case where Newton's method has no fixed convergence order, the first is to get the solutions to the one-dimensional optimization problems with many different parameter values of α. If these problems were solved by numerical method one by one, the computation cost would reduce the efficiency of the Newton-PCG algorithm, and therefore is unacceptable. In this paper, we overcome the difficulty by deriving an analytic expression of the solution to the one-dimensional optimization problem with respect to the parameter α.
论文关键词:65K05,90C30,Newton-PCG-like algorithm,One-dimensional optimization problem,Analytic expression
论文评审过程:Received 18 December 2000, Revised 10 December 2001, Available online 14 May 2002.
论文官网地址:https://doi.org/10.1016/S0377-0427(02)00414-4