An efficient method for convex constrained rank minimization problems based on DC programming (Q1793529): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59141181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3161693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix completion by numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal low-rank approximation to a correlation matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Collaborative Filter Based on Popularity Amongst Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Channel Coding Perspective of Collaborative Filtering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of the position of an equilibrium attitude of the international space station as a problem of stable matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: LMI-based relaxed nonquadratic stabilization conditions for nonlinear systems in the Takagi-Sugeno's form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty decomposition methods for rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum stable set formulations and heuristics based on continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank

Latest revision as of 20:39, 16 July 2024

scientific article
Language Label Description Also known as
English
An efficient method for convex constrained rank minimization problems based on DC programming
scientific article

    Statements

    An efficient method for convex constrained rank minimization problems based on DC programming (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2018
    0 references
    Summary: The constrained rank minimization problem has various applications in many fields including machine learning, control, and signal processing. In this paper, we consider the convex constrained rank minimization problem. By introducing a new variable and penalizing an equality constraint to objective function, we reformulate the convex objective function with a rank constraint as a difference of convex functions based on the closed-form solutions, which can be reformulated as DC programming. A stepwise linear approximative algorithm is provided for solving the reformulated model. The performance of our method is tested by applying it to affine rank minimization problems and max-cut problems. Numerical results demonstrate that the method is effective and of high recoverability and results on max-cut show that the method is feasible, which provides better lower bounds and lower rank solutions compared with improved approximation algorithm using semidefinite programming, and they are close to the results of the latest researches.
    0 references
    0 references
    0 references

    Identifiers