Convex methods for rank-constrained optimization problems

DOI10.1137/1.9781611974072.18MaRDI QIDQ6566262zbMATH OpenFDO

Authors Van Sy Mai, Dipankar Maity, Bhaskar Ramasubramanian, Michael C. Rotkowitz

Publication date 3 July 2024

zbMATH Keywords

rank of a matrixnuclear norm of a matrix

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Low-rank inducing norms with optimality interpretations
• An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
• Rank optimization of a matrix via a splitting technique
• Rank-constrained optimization and its applications
• An efficient method for convex constrained rank minimization problems based on DC programming

Cited in

(1)

• On the automatic construction of interface coupling operators for non-matching meshes by optimization methods

This page was built for publication: Convex methods for rank-constrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566262)