Pages that link to "Item:Q2954382"
From MaRDI portal
The following pages link to On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes (Q2954382):
Displaying 28 items.
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Primal and dual predicted decrease approximation methods (Q681488) (← 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)
- A partially proximal linearized alternating minimization method for finding Dantzig selectors (Q1983897) (← links)
- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization (Q2033682) (← links)
- A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
- Iterative splitting schemes for a soft material poromechanics model (Q2060080) (← links)
- Robust subset selection (Q2076115) (← links)
- Network manipulation algorithm based on inexact alternating minimization (Q2109010) (← links)
- On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces (Q2115326) (← links)
- Biclustering via structured regularized matrix decomposition (Q2141911) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- Bregman reweighted alternating minimization and its application to image deblurring (Q2224931) (← links)
- Alternating minimization methods for strongly convex optimization (Q2232092) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems (Q2818270) (← links)
- Scaling algorithms for unbalanced optimal transport problems (Q3177709) (← links)
- Tomographic reconstruction with spatially varying parameter selection (Q5000591) (← links)
- Full-Span Log-Linear Model and Fast Learning Algorithm (Q5081145) (← links)
- On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications (Q5084663) (← links)
- A new large-scale learning algorithm for generalized additive models (Q6134363) (← links)
- Image Recovery for Blind Polychromatic Ptychography (Q6168340) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Best-effort adaptation (Q6496424) (← links)
