Optimality conditions for rank-constrained matrix optimization

DOI10.1007/s40305-019-00245-0zbMath1438.90272OpenAlexW2943013304WikidataQ127930367 ScholiaQ127930367MaRDI QIDQ2314061

Xinrong Li, Wen Song, Nai-Hua Xiu

Publication date: 19 July 2019

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00245-0

zbMATH Keywords

normal conefirst-order optimality conditionsecond-order optimality conditionmatrix optimizationrank constraint

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Quaternion matrix optimization: motivation and analysis, On the continuity of the tangent cone to the determinantal variety, Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy, Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds, Optimality conditions for Tucker low-rank tensor optimization, Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers

Uses Software

• MSCRA_rankmin

Cites Work

• Unnamed Item
• Unnamed Item
• A variational approach of the rank function
• Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
• Critical points of matrix least squares distance functions
• Iterative methods for low rank approximation of graph similarity matrices
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Robust Euclidean embedding via EDM optimization
• A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
• Prox-regularity of rank constraint sets and implications for algorithms
• Tangent and normal cones for low-rank matrices
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Penalty decomposition methods for rank minimization
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• Variational Analysis
• Variational Analysis and Generalized Differentiation I
• Sparse Approximate Solutions to Linear Systems
• Semidefinite Programming
• From Eckart and Young approximation to Moreau envelopes andvice versa
• Greedy Sparsity-Constrained Optimization
• Enlargement Methods for Computing the Inverse Matrix
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers