An exact convex-concave min-max reformulation of ill-posed linear inverse problems is derived, with saddle points characterized by the primal and dual optimal sets.
K-svd: An algorithm for designing overcomplete dictionaries for sparse representation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Convex Duality in Linear Inverse Problems
An exact convex-concave min-max reformulation of ill-posed linear inverse problems is derived, with saddle points characterized by the primal and dual optimal sets.