Randomized subspace correction methods for convex optimization
From MaRDI portal
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A finite element approach for the dual Rudin-Osher-Fatemi model and its nonoverlapping domain decomposition methods
- A full approximation scheme multilevel method for nonlinear variational inequalities
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated, parallel, and proximal coordinate descent
- Adaptive restart for accelerated gradient schemes
- Additive Schwarz methods for convex optimization as gradient methods
- Additive Schwarz methods for fourth-order variational inequalities
- Additive Schwarz methods for semilinear elliptic problems with convex energy functionals: convergence rate independent of nonlinearity
- Algebraic multigrid methods
- An \(L^1\) penalty method for general obstacle problems
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- An additive analysis of multiplicative Schwarz methods
- An introduction to continuous optimization for imaging
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Convergence analysis of the fast subspace descent method for convex optimization problems
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
- Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Convex analysis and monotone operator theory in Hilbert spaces
- Coordinate descent algorithms
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Fast gradient methods for uniformly convex and weakly smooth problems
- Fast nonoverlapping block Jacobi method for the dual Rudin-Osher-Fatemi model
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- Gradient methods for minimizing composite functions
- Greedy and randomized versions of the multiplicative Schwarz method
- scientific article; zbMATH DE number 1138069 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Iteration complexity analysis of block coordinate descent methods
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Iterative Methods by Space Decomposition and Subspace Correction
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- On the complexity analysis of randomized block-coordinate descent methods
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- On the convergence of block coordinate descent type methods
- On the linear convergence of additive Schwarz methods for the p-Laplacian
- One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact
- Overlapping domain decomposition methods for total variation denoising
- Parallel coordinate descent methods for big data optimization
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Randomized and fault-tolerant method of subspace corrections
- Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
- Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- Sharpness, restart, and acceleration
- Stochastic block mirror descent methods for nonsmooth and stochastic optimization
- Stochastic dual coordinate ascent methods for regularized loss minimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
- Two-level overlapping Schwarz preconditioners with universal coarse spaces for 2mth-order elliptic problems
- Universal gradient methods for convex optimization problems
- Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
This page was built for publication: Randomized subspace correction methods for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267090)
