Shifted-comparator Bregman bound
ID: shifted-comparator-bregman-bound
Let be a least-squares solution and . For a minimizer of , expand the objective about . The normal equation for a linear inverse problem removes the data-residual cross term, while the Bregman distance definition givesCompare the minimizer with , where the square vanishes, and divide by . The bound is informative when that comparator has finite penalty.
New to topics? Read the docs here!