Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
From MaRDI portal
Publication:5348257
DOI10.1137/16M1102653zbMath1368.90104arXiv1611.02456MaRDI QIDQ5348257
Wotao Yin, Yat Tin Chow, Tianyu Wu
Publication date: 15 August 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.02456
fixed pointimage reconstructionrobust least squaresnonnegative matrix factorizationcyclicnonexpansive operatorcoordinate updateshuffled cyclic
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Related Items
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, Cyclic Coordinate Dual Averaging with Extrapolation, An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization, Acceleration of primal-dual methods by preconditioning and simple subproblem procedures, Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation, Markov chain block coordinate descent, CoordinateWise Descent Methods for Leading Eigenvalue Problem, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- On the complexity analysis of randomized block-coordinate descent methods
- Iteration complexity analysis of block coordinate descent methods
- A projection-proximal point algorithm for solving generalized variational inequalities
- A three-operator splitting scheme and its optimization applications
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the convergence of the coordinate descent method for convex differentiable minimization
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Coordinate-friendly structures, algorithms and applications
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Cone-constrained eigenvalue problems: Theory and algorithms
- Coordinate descent algorithms
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Pathwise coordinate optimization
- An efficient augmented Lagrangian method with applications to total variation minimization
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Descent Methods for Nonnegative Matrix Factorization
- On the proximal point method for equilibrium problems in Hilbert spaces
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
- On the rate of convergence of the image space reconstruction algorithm
- Distributed asynchronous computation of fixed points
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
- On Tensors, Sparsity, and Nonnegative Factorizations
- Minimizing Certain Convex Functions
- Convergence Rate Analysis of Several Splitting Schemes
- A Parameter Free ADI-Like Method for the Numerical Solution of Large Scale Lyapunov Equations
- On the Convergence of Block Coordinate Descent Type Methods
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence of a block coordinate descent method for nondifferentiable minimization
