Convergence Theory of Feasible Direction Methods

ISBN: 9787030026330

出版社: Science Press

出版年: 1991

页数: 118

定价: 50.00元

装帧: Unknown Binding

内容简介

Consider a maximization problem and an iterative algorithm for solving it. The algorithm generates a sequence of points increasing in the value of the objective function. Two cases may occur for the sequence of generated points: (1) The sequence converges to a point or has no cluster point. (2) The sequence has a cluster point but does not converge to the duster point.It is a natural viewpoint that the sequence in case (1) is easier to be handled than that in case (2). Thus, in the literature, when the global convergence of an algorithm is hard to be established, one usually first study it with assumption that the generated sequence is convergent.