Efficient proximal mapping computation for low-rank inducing norms
type: Item
instance of: scholarly article
title: Efficient proximal mapping computation for low-rank inducing norms
zbMATH Open document ID: 1484.90044
author: Christian Grussler
author: Pontus Giselsson
published in: Journal of Optimization Theory and Applications
publication date: 2022-01-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.07570
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7465211
zbMATH Keywords: low-rank optimization
zbMATH Keywords: low-rank inducing norms
zbMATH Keywords: proximal splitting
zbMATH Keywords: regularization
zbMATH Keywords: matrix completion
describes a project that uses: SeDuMi Interface
describes a project that uses: SDPT3
describes a project that uses: UNLocBoX
describes a project that uses: LRINorm
describes a project that uses: LRIPy
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W3216235576
arXiv ID: 1810.07570
cites work: Convex envelopes for fixed rank approximation
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Q4821526
cites work: Exact matrix completion via convex optimization
cites work: The convex geometry of linear inverse problems
cites work: Proximal Splitting Methods in Signal Processing
cites work: Fast projection onto the simplex and the \(l_1\) ball
cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
cites work: Q3444931
cites work: Low-Rank Inducing Norms with Optimality Interpretations
cites work: Low-Rank Optimization With Convex Constraints
cites work: Validation of subgradient optimization
cites work: Q4273942
cites work: Reduced-rank regression for the multivariate linear model
cites work: Q4369384
cites work: Convex low rank approximation
cites work: Q4856866
cites work: Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
cites work: Nuclear norm system identification with missing inputs and outputs
cites work: Penalty decomposition methods for rank minimization
cites work: New perspectives on \(k\)-support and cluster norms
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Convex Analysis
cites work: Q4864293
cites work: Q4337625
cites work: Proximal methods for the latent group lasso penalty
cites work: On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
DOI: 10.1007/S10957-021-01956-2
description: scientific article