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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Multicommodity network flows—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier methods: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fermat-Weber location problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on optimization - theory and algorithms. Notes by M. K. V. Murthy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gradient-projection method for solving the nonsymmetric linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming / 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: Q3318601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / 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: Q3995612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3759825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for a Class of Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test of probabilistic models for the propagation of roundoff errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipoint methods for separable nonlinear networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secant approximation methods for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction splittings for block angular parallel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A diagonal quadratic approximation method for large scale linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multistage stochastic networks: An application of scenario aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Parabolic and Elliptic Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / 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: Scenarios and Policy Aggregation in Optimization Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial inverse of a monotone operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the method of partial inverses to convex programming: Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the exponential multiplier method for convex programming / rank
 
Normal rank

Revision as of 19:25, 28 May 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