A parallel line search subspace correction method for composite convex optimization (Q2516372): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SparseLOGREG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: glmnet / 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.1007/s40305-015-0079-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W757760243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / 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: On the Convergence of Block Coordinate Descent Type Methods / 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: Q4383424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of nonsmooth functions with parallel coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain decomposition methods for linear inverse problems with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Correction Methods for Total Variation and $\ell_1$-Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent overlapping domain decomposition method for total variation minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelet Decomposition Method for $L_2/$/TV-Image Deblurring / 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: Q4144736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity analysis of block coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregmanized domain decomposition for image restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sublinear convergence rate of multi-block ADMM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity analysis of randomized block-coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the coordinate descent method for convex differentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds and convergence analysis of feasible descent methods: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel coordinate descent methods for big data optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and uniform convergence of subspace correction methods for some convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of an active-set method for ℓ<sub>1</sub>minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems / rank
 
Normal rank

Latest revision as of 14:16, 10 July 2024

scientific article
Language Label Description Also known as
English
A parallel line search subspace correction method for composite convex optimization
scientific article

    Statements

    A parallel line search subspace correction method for composite convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2015
    0 references
    line search
    0 references
    block coordinate descent method
    0 references
    domain decomposition
    0 references
    Jacobian-type iteration
    0 references
    distributed optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers