On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming (Q3454507): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bing-sheng He / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Ming Yuan / rank
Normal rank
 
Property / author
 
Property / author: Bing-sheng He / rank
 
Normal rank
Property / author
 
Property / author: Xiao-Ming Yuan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RASL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2210533708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077092 / 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: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the alternating direction method of multipliers to separable convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of projection and contraction methods for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new inexact alternating directions method for monotone variational inequalities / 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: On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: New parallel descent-like method for solving a class of variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable-penalty alternating directions method for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5618030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / 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: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities / rank
 
Normal rank

Latest revision as of 02:47, 11 July 2024

scientific article
Language Label Description Also known as
English
On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
scientific article

    Statements

    On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2015
    0 references
    convex programming
    0 references
    augmented Lagrangian method
    0 references
    Jacobian decomposition
    0 references
    contraction methods
    0 references
    convergence rate
    0 references
    operator splitting methods
    0 references
    0 references
    0 references
    0 references
    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