Nonsmooth rank-one matrix factorization landscape

DOI10.1007/s11590-021-01819-9zbMath1497.90195OpenAlexW3211952685WikidataQ114222153 ScholiaQ114222153MaRDI QIDQ2673521

Lexiao Lai, Cédric Josz

Publication date: 10 June 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01819-9

zbMATH Keywords

subdifferential regularitynonsmooth rank-one factorization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Certifying the Absence of Spurious Local Minima at Infinity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
• A new decision method for elementary algebra
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Weak Sharp Minima in Mathematical Programming
• Algorithmic Aspects of Machine Learning
• An Invitation to Tame Optimization
• First-Order Methods in Optimization
• Non-convex Optimization for Machine Learning
• Nonconvex Robust Low-Rank Matrix Recovery
• On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion

This page was built for publication: Nonsmooth rank-one matrix factorization landscape