A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint (Q2347563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ming-Fang Ni / rank
Normal rank
 
Property / author
 
Property / author: Ming-Fang Ni / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59435349 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1186/s13660-015-0668-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144871370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for robust and stable principal component pursuit problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating proximal gradient method for convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach for minimizing composite norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations / 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: Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A customized proximal point algorithm for convex minimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementable first-order primal-dual algorithm for structured convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent / 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: Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 03:14, 10 July 2024

scientific article
Language Label Description Also known as
English
A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint
scientific article

    Statements

    A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2015
    0 references
    proximal point method
    0 references
    customized
    0 references
    stable principal component pursuit
    0 references
    primal-dual algorithm
    0 references

    Identifiers