{'fraction_non_alphanumeric': 0.021607605877268798, 'fraction_numerical': 0.0, 'mean_word_length': 5.362637362637362, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Primal-dual interior-point optimization based on majorization-minimization for edge-preserving spectral unmixing

Primal-dual interior-point methods are used in image processing to solve inversion problems that can be reduced to constrained convex minimization. Such iterative methods require the solution of a sequence of linear systems which are used to derive descent directions. This approach is very consuming in terms of computing time and memory usage for large-scale problems, unless the involved matrices have a specific structure. This is the case in the spectral unmixing problem where these matrices are block-diagonal when no spatial regularization is considered. Here, we consider the edge-preserving regularized case and we propose to tackle the linear system solving using a majorization-minimization (MM) approach based on separable quadratic majorant functions. The resulting systems have the same structure as in the non-regularized case and can thereby be solved efficiently. The interior-point algorithm is speeded-up while remaining convergent. An example of spectral unmixing is proposed to illustrate the efficiency of this approach.