DocumentCode
545315
Title
A relaxed version of Bregman´s method for interval convex programming
Author
Xingbai, He ; Shouchang, Zhou
Author_Institution
Electrical Engineering Department of Chongqing University, Chongqing, Sichuan 630044, P. R. of China
Volume
5
fYear
1992
fDate
Oct. 29 1992-Nov. 1 1992
Firstpage
2188
Lastpage
2189
Abstract
A relaxed Version of Bregman´s interval convex programming method is presented. It is shown that the relaxation procedure preserved the convergence properties of Bregman´ algorithm for a suitable choice of the relaxation parameters.
Keywords
Computed tomography; Convergence; Impedance; Programming; X-ray imaging;
fLanguage
English
Publisher
ieee
Conference_Titel
Engineering in Medicine and Biology Society, 1992 14th Annual International Conference of the IEEE
Conference_Location
Paris, France
Print_ISBN
0-7803-0785-2
Electronic_ISBN
0-7803-0816-6
Type
conf
DOI
10.1109/IEMBS.1992.5762230
Filename
5762230
Link To Document