Given , the residual method minimizes a penalty subject to . Every exact solution is feasible, so a reconstruction has penalty no larger than that of any J-minimizing solution.
Suppose is nonnegative and sequentially lower semicontinuous, and its sublevel sets are strongly sequentially compact. For a solvable exact equation , every sequence of residual-method minimizers with has a strongly convergent subsequence, and every limit is a J-minimizing solution. Indeed, comparison with an exact penalty minimizer bounds all reconstructions in one compact sublevel set; the residual bound gives . Continuity of and lower semicontinuity of identify each subsequential limit as an exact minimizer. Thus the distance to a set of exact penalty minimizers tends to zero. Uniqueness of the exact minimizer upgrades this to full strong convergence.
Uniqueness cannot be omitted: for , , and on , the sublevel sets are compact intervals but the minimizers do not converge.

Articles by others on the same topic (0)

There are currently no matching articles.