Abstract
In this paper, the subgradient projection iteration is used to find an approximation solution of a weighted least-squares problem with respect to linear imaging system. Instead of an exact or approximate line search in each iteration, the step length in this paper is fixed by the weighted least-square function and the current iteration. Using weighted singular value decomposition, we estimate the bounds of step length. Consequently, we provide the decreasing property and the sufficient condition for convergence of the iterative algorithm. Furthermore, we perform a numerical experiment on a two dimensional image reconstruction problem to confirm the validity of this subgradient projection iteration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
