English

Computing Proximity Operators of Scale and Signed Permutation Invariant Functions

Optimization and Control 2024-04-02 v1

Abstract

This paper investigates the computation of proximity operators for scale and signed permutation invariant functions. A scale-invariant function remains unchanged under uniform scaling, while a signed permutation invariant function retains its structure despite permutations and sign changes applied to its input variables. Noteworthy examples include the 0\ell_0 function and the ratios of 1/2\ell_1/\ell_2 and its square, with their proximity operators being particularly crucial in sparse signal recovery. We delve into the properties of scale and signed permutation invariant functions, delineating the computation of their proximity operators into three sequential steps: the w\mathbf{w}-step, rr-step, and dd-step. These steps collectively form a procedure termed as WRD, with the w\mathbf{w}-step being of utmost importance and requiring careful treatment. Leveraging this procedure, we present a method for explicitly computing the proximity operator of (1/2)2(\ell_1/\ell_2)^2 and introduce an efficient algorithm for the proximity operator of 1/2\ell_1/\ell_2.

Cite

@article{arxiv.2404.00713,
  title  = {Computing Proximity Operators of Scale and Signed Permutation Invariant Functions},
  author = {Jianqing Jia and Ashley Prater-Bennette and Lixin Shen},
  journal= {arXiv preprint arXiv:2404.00713},
  year   = {2024}
}
R2 v1 2026-06-28T15:39:38.172Z