Let from the normal-operator source condition, and set . Since is a least-squares solution, the normal equation for a linear inverse problem gives . Expand the objective difference and use the Bregman distance definition:
The cross term with the residual of the least-squares solution vanishes by the normal equation; exact data are not required. Compare the minimizing with . At , the completed square is zero. Dividing the resulting inequality by proves the stronger shifted-comparator Bregman bound
Dropping the nonnegative squared term gives the requested estimate. If the comparator lies outside the effective domain of , its distance is infinite and the inequality is valid but gives no finite error bound.

Articles by others on the same topic (0)

There are currently no matching articles.