Pages that link to "Item:Q2198528"
From MaRDI portal
The following pages link to Two relaxation methods for rank minimization problems (Q2198528):
Displaying 7 items.
- A variational approach of the rank function (Q356507) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- A novel method for a class of structured low-rank minimizations with equality constraint (Q1675980) (← links)
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem (Q1785372) (← links)
- An efficient method for convex constrained rank minimization problems based on DC programming (Q1793529) (← links)
- Low-rank factorization for rank minimization with nonconvex regularizers (Q2044472) (← links)
- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint (Q5501696) (← links)