摘要
本文研究的是这样一类问题,找到一个解,使其在满足给定的约束条件下,使某一个目标函数极小.在本文中这个目标函数就是与先验解之间的IS距离.这类问题可以归结为非线性优化问题,为降低求解的难度,本文将问题分解为多个于问题,然后采用一种选代策略,通过交替地求解这些子问题,达到求解原问题的目的.CT图像重建的一个应用例子表明,这种思路是可行的,构造的算法是有效的.
in this paper, a solution is expected to minimize the object function with manyconstraints. While the object function selected is ltakura Saito(IS) distortion to the a proiriknowledge, the constructed problem becomes a nonlinear optimization problem. This paper divides thisproblem into many subproblems and proves that alternative solution of these subproblems willeventually solve the previous problem. An application with respect to CT reconstruction demonstratesthe feasibility and efficiency of the algorithm.
出处
《计算机学报》
EI
CSCD
北大核心
1998年第S1期335-340,共6页
Chinese Journal of Computers
关键词
IS距离
约束优化
交替迭代算法
收敛性及收敛解
IS distortion, constrained optimization, alternative iteration algorithm, convergence and solution