English

Burer-Monteiro factorizability of nuclear norm regularized optimization

Optimization and Control 2026-01-06 v2

Abstract

This paper studies the relationship between the nuclear norm-regularized minimization problem, which minimizes the sum of a C2C^2 function hh and a positive multiple of the nuclear norm, denoted by ff, and its factorized problem obtained by the Burer-Monteiro technique. We are interested in deriving conditions that ensure every second-order stationary point of the factorized problem corresponds to a global minimizer of ff, a property we call the rr-factorizability of ff in this paper. Under suitable restricted isometry property (RIP) type assumptions on hh, we prove the rr-factorizability of ff. Moreover, the RIP constant in our paper is tight, in the sense that we can construct concrete examples of ff that fail to be rr-factorizable when the RIP constant is below the threshold. Our technique for constructing such examples is novel and may be of independent interest: specifically, we use a variant of the Von Neumann's trace inequality and relate the existence of such examples to the optimal value of a quadratic program involving the RIP constant, then we explicitly solve this optimization problem to detect all the possible counterexamples.

Cite

@article{arxiv.2505.00349,
  title  = {Burer-Monteiro factorizability of nuclear norm regularized optimization},
  author = {Wenqing Ouyang and Ting Kei Pong and Man-Chung Yue},
  journal= {arXiv preprint arXiv:2505.00349},
  year   = {2026}
}
R2 v1 2026-06-28T23:17:43.393Z