Abstract

Abstract An efficient, function-space-based second-order method for the $H^1$-projection onto the Gibbs simplex is presented. The method makes use of the theory of semismooth Newton methods in function spaces as well as Moreau–Yosida regularization and techniques from parametric optimization. A path-following technique is considered for the regularization parameter updates. A rigorous first- and second-order sensitivity analysis of the value function for the regularized problem is provided to justify the update scheme. The viability of the algorithm is then demonstrated for two applications found in the literature: binary image inpainting and labeled data classification. In both cases, the algorithm exhibits mesh-independent behavior.

Full Text
Published version (Free)

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 call