An alternating direction-based contraction method for linearly constrained separable convex programming problems (Q2841146): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bing-sheng He / rank
 
Normal rank
Property / author
 
Property / author: Min Tao / rank
 
Normal rank
Property / author
 
Property / author: Ming-Hua Xu / rank
 
Normal rank
Property / author
 
Property / author: Xiao-Ming Yuan / 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.1080/02331934.2011.611885 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006160074 / 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: 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: 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: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities / 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: Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent method for structured monotone variational inequalities / rank
 
Normal rank

Latest revision as of 16:35, 6 July 2024

scientific article
Language Label Description Also known as
English
An alternating direction-based contraction method for linearly constrained separable convex programming problems
scientific article

    Statements

    An alternating direction-based contraction method for linearly constrained separable convex programming problems (English)
    0 references
    0 references
    24 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    alternating direction method
    0 references
    convex programming
    0 references
    linear constraint
    0 references
    separable structure
    0 references
    contraction method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references