Some advances in low-rank matrix optimization
From MaRDI portal
Recommendations
- Models and algorithms for low-rank and sparse matrix optimization problems
- Preface
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
- The non-convex geometry of low-rank matrix optimization
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
Cited in
(14)- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- When only global optimization matters
- Rank-constrained optimization and its applications
- Optimization challenges in the structured low rank approximation problem
- On optimality of approximate low rank solutions of large-scale matrix equations
- Low-rank spectral optimization via gauge duality
- High-dimensional constrained matrix regression problems
- Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints
- Models and algorithms for low-rank and sparse matrix optimization problems
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
- On critical points of quadratic low-rank matrix optimization problems
- Preface
- A new perspective on low-rank optimization
- Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds
This page was built for publication: Some advances in low-rank matrix optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143973)