On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes

Related Items (38)

An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise ⋮ On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems ⋮ The Cyclic Block Conditional Gradient Method for Convex Optimization Problems ⋮ Biclustering via structured regularized matrix decomposition ⋮ Scaling algorithms for unbalanced optimal transport problems ⋮ Improved Estimation of High-dimensional Additive Models Using Subspace Learning ⋮ Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Full-Span Log-Linear Model and Fast Learning Algorithm ⋮ On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications ⋮ Targeted Inference Involving High-Dimensional Data Using Nuisance Penalized Regression ⋮ A new large-scale learning algorithm for generalized additive models ⋮ Additive Schwarz Methods for Convex Optimization as Gradient Methods ⋮ Image Recovery for Blind Polychromatic Ptychography ⋮ Random Coordinate Descent Methods for Nonseparable Composite Optimization ⋮ Accelerated alternating descent methods for Dykstra-like problems ⋮ Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ Bregman reweighted alternating minimization and its application to image deblurring ⋮ Alternating minimization methods for strongly convex optimization ⋮ The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem ⋮ A partially proximal linearized alternating minimization method for finding Dantzig selectors ⋮ Primal and dual predicted decrease approximation methods ⋮ Iteration complexity analysis of block coordinate descent methods ⋮ An introduction to continuous optimization for imaging ⋮ Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems ⋮ Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization ⋮ A Laplacian approach to \(\ell_1\)-norm minimization ⋮ An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems ⋮ Iterative splitting schemes for a soft material poromechanics model ⋮ Distance between the fractional Brownian motion and the space of adapted Gaussian martingales ⋮ Accelerated alternating minimization algorithm for Poisson noisy image recovery ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions ⋮ Robust subset selection ⋮ Tomographic reconstruction with spatially varying parameter selection ⋮ The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem ⋮ Network manipulation algorithm based on inexact alternating minimization ⋮ On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces

This page was built for publication: On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes