Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition

Documenti analoghi

• Burer-Monteiro factorizability of nuclear norm regularized optimization
  di: Ouyang, Wenqing, et al.
  Pubblicazione: (2025)
• Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
  di: Tang, Tianyun, et al.
  Pubblicazione: (2024)
• Robust principal component analysis with rank and cardinality regularization under matrix factorization
  di: Li, Wenjing, et al.
  Pubblicazione: (2026)
• Accelerated projected gradient algorithms for sparsity constrained optimization problems
  di: Alcantara, Jan Harold, et al.
  Pubblicazione: (2022)
• A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
  di: Hou, Di, et al.
  Pubblicazione: (2025)