Pages that link to "Item:Q5408210"
From MaRDI portal
The following pages link to On the Convergence of Block Coordinate Descent Type Methods (Q5408210):
Displaying 50 items.
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Schwarz iterative methods: infinite space splittings (Q530579) (← links)
- A mean field game model for the evolution of cities (Q825260) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- Subspace correction methods in algebraic multi-level frames (Q896866) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Accelerated alternating descent methods for Dykstra-like problems (Q1704007) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
- 3D joint hydrogeophysical inversion using similarity measures (Q2009601) (← links)
- Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- T-product factorization method for internet traffic data completion with spatio-temporal regularization (Q2057227) (← links)
- A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization (Q2067860) (← links)
- An alternating algorithm for finding linear Arrow-Debreu market equilibria (Q2075387) (← links)
- Risk-averse policy optimization via risk-neutral policy optimization (Q2082514) (← links)
- Cyclic coordinate descent in the Hölder smooth setting (Q2084003) (← links)
- Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces (Q2115326) (← links)
- Additive Schwarz methods for convex optimization with backtracking (Q2122660) (← links)
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
- A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise (Q2158261) (← links)
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
- Block layer decomposition schemes for training deep neural networks (Q2173515) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding (Q2193348) (← links)
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← links)
- Bregman Itoh-Abe methods for sparse optimisation (Q2203362) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems (Q2225527) (← links)
- Outlier detection in networks with missing links (Q2242182) (← links)
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems (Q2307755) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
