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.
具体描述
读后感
评分
评分
评分
评分
用户评价
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有