Low-Rank Optimization With Convex Constraints

DOI10.1109/TAC.2018.2813009zbMath1423.90180arXiv1606.01793OpenAlexW3104665944MaRDI QIDQ4562268

Christian Grussler, Pontus Giselsson, Anders Rantzer

Publication date: 19 December 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01793

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) System structure simplification (93B11)

Related Items (9)

Low-Rank Inducing Norms with Optimality Interpretations ⋮ Unnamed Item ⋮ Convex envelopes for fixed rank approximation ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Unnamed Item ⋮ Low-rank nonnegative tensor approximation via alternating projections and sketching ⋮ Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm ⋮ Efficient proximal mapping computation for low-rank inducing norms ⋮ Best Low-rank Approximations and Kolmogorov $n$-widths

This page was built for publication: Low-Rank Optimization With Convex Constraints