A variable-penalty alternating directions method for convex optimization (Q1290650): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02680549 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983357136 / rank
 
Normal rank

Latest revision as of 10:55, 30 July 2024

scientific article
Language Label Description Also known as
English
A variable-penalty alternating directions method for convex optimization
scientific article

    Statements

    A variable-penalty alternating directions method for convex optimization (English)
    0 references
    0 references
    0 references
    3 June 1999
    0 references
    decomposition
    0 references
    parallel computing
    0 references
    alternating directions
    0 references
    sum of two convex functions
    0 references
    convergence
    0 references
    block angular optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers