## Sammanfattning

Low-rank inducing unitarily invariant norms have been introduced to convexify problems with a low-rank/sparsity constraint. The most well-known member of this family is the so-called nuclear norm. To solve optimization problems involving such norms with proximal splitting methods, efficient ways of evaluating the proximal mapping of the low-rank inducing norms are needed. This is known for the nuclear norm, but not for most other members of the low-rank inducing family. This work supplies a framework that reduces the proximal mapping evaluation into a nested binary search, in which each iteration requires the solution of a much simpler problem. The simpler problem can often be solved analytically as demonstrated for the so-called low-rank inducing Frobenius and spectral norms. The framework also allows to compute the proximal mapping of increasing convex functions composed with these norms as well as projections onto their epigraphs.

Originalspråk | engelska |
---|---|

Sidor (från-till) | 168-194 |

Tidskrift | Journal of Optimization Theory and Applications |

Volym | 192 |

Nummer | 1 |

Tidigt onlinedatum | 2021 |

DOI | |

Status | Published - 2022 |

## Ämnesklassifikation (UKÄ)

- Reglerteknik