Matrix completion under interval uncertainty (Q1752160): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: softImpute / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HOGWILD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ADMiRA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2591758317 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.2467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation matrix nearness and completion under observation uncertainty / 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: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in robust optimization: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-rank matrix completion using alternating minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMiRA: Atomic Decomposition for Minimum Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust least square semidefinite programming with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Block Coordinate Descent for Minimizing Partially Separable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research and data mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: `Horses for courses' in demand forecasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Coordinate Descent Method for Learning with Big Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel coordinate descent methods for big data optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized Iterative Hard Thresholding for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable approximations and decomposition methods for the augmented Lagrangian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized low rank approximations of matrices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:10, 15 July 2024

scientific article
Language Label Description Also known as
English
Matrix completion under interval uncertainty
scientific article

    Statements

    Matrix completion under interval uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    matrix completion
    0 references
    robust optimization
    0 references
    collaborative filtering
    0 references
    coordinate descent
    0 references
    large-scale optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references