Two relaxation methods for rank minimization problems (Q2198528): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / 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: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty method for rank minimization problems in symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of Successive “Unobservable” Cyber Data Attacks in Power Systems Through Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distance matrices, semidefinite programming and sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rank-corrected procedure for matrix completion with fixed basis coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation theory of matrix rank minimization and its application to quadratic equations / 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: An implementable proximal point algorithmic framework for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on nonnegative rank via nonnegative nuclear norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid, robust, and reliable blind deconvolution via nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank matrix completion by alternating steepest descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees of Riemannian Optimization for Low Rank Matrix Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Lipschitz surrogates for zero-norm and rank optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank

Latest revision as of 14:49, 23 July 2024

scientific article
Language Label Description Also known as
English
Two relaxation methods for rank minimization problems
scientific article

    Statements

    Two relaxation methods for rank minimization problems (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2020
    0 references
    0 references
    constraint qualification
    0 references
    optimality conditions
    0 references
    rank minimization
    0 references
    semidefinite programs with complementarity constraints
    0 references
    0 references
    0 references
    0 references