Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning (Q2353007): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q719969
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hu-An Li / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Yall1 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071631699 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.5035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / 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: Q4821526 / 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: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latent variable graphical model selection via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2996497 / 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: On the global and linear convergence of the generalized alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Splitting Algorithms for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Split Bregman Method for L1-Regularized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4979593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified primal-dual algorithm framework based on Bregman iteration / 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: The Group Lasso for Logistic Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3161693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating direction algorithm for matrix completion with nonnegative factors / rank
 
Normal rank

Latest revision as of 11:12, 10 July 2024

scientific article
Language Label Description Also known as
English
Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
scientific article

    Statements

    Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2015
    0 references
    convex programs
    0 references
    alternating direction method
    0 references
    linearized alternating direction method
    0 references
    proximal alternating direction method
    0 references
    parallel splitting
    0 references
    adaptive renalty
    0 references
    0 references
    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