---
title: Matrix-Inverse-Free WMMSE Methods
url: https://www.emergentmind.com/topics/matrix-inverse-free-wmmse
type: topic
---

# Matrix-Inverse-Free WMMSE Methods

Matrix-inverse-free WMMSE refers to a family of algorithmic designs for solving the weighted sum-rate (WSR) maximization problem in multi-user MIMO networks that avoid the computational bottleneck of direct matrix inversion, a limitation of classic weighted minimum mean-square error (WMMSE) methods. These approaches instead use first-order updates (gradient descent, projected gradient, polynomial approximation, or low-dimensional reductions) and are highly parallelizable, making them suitable for real-time and large-scale applications in wireless communications.

## 1. Problem Setting and Limitations of Classical WMMSE

The standard framework involves downlink MU-MIMO beamforming, where a base station with $M$ transmit antennas serves $K$ users, each potentially with $N$ antennas. The goal is to maximize the WSR under a sum-power constraint:
\[
\max_{\{V_k\}}\quad \sum_{k=1}^K \alpha_k R_k
\quad\text{s.t.}\quad \sum_{k=1}^K \mathrm{Tr}(V_k V_k^H) \leq P_\mathrm{max}
\]
where $R_k$ is the user $k$ rate.

This non-convex problem is transformable into an equivalent WMMSE problem by introducing auxiliary receive filters $\{U_k\}$ and weight matrices $\{W_k\}$ and jointly updating $\{U_k\}$, $\{W_k\}$, and $\{V_k\}$ via block coordinate descent. However, the $V_k$-update in classic WMMSE requires inverting an $M\times M$ matrix per iteration, resulting in $\mathcal O(M^3)$ complexity that becomes prohibitive for large $M$ or latency-sensitive applications [2510.20507], [2205.08877], [2006.08448].

## 2. Core Principles of Matrix-Inverse-Free WMMSE

Matrix-inverse-free WMMSE methods remove all \emph{explicit} matrix inversions from the iterative update pipeline. This is achieved by:

- **First-order updates:** Using gradient descent or projected gradient descent (PGD) for the $V_k$ (precoder) step instead of direct inversion.
- **Polynomial approximations:** Approximating matrix inverses via truncated series expansions, such as in model-driven deep learning approaches.
- **Low-dimensional reduction:** Transforming the problem into a reduced subspace where only small-dimensional inversions are needed.
- **Recursion and iterative refinements:** Alternate approaches using methods like the Newton-Schulz iteration for approximating inverses.

The result is an iterative structure that relies only on matrix-matrix multiplications, additions, projections onto convex sets, and possibly scalar operations—operations that are inherently parallel and suitable for GPU/FPGA acceleration [2510.20507], [2205.08877].

## 3. Representative Algorithms and Methodologies

### 3.1 Block Coordinate Gradient Descent (BCGD) and Projected PGD

- **A-MMMSE [2510.20507]:** Replaces the $V_k$ closed-form with a projected BCGD step. Each $V_k$ is updated as:
  \[
  V_k^{t} = \Pi_{\|\cdot\|_F^2 \leq P_\mathrm{max}} \big[ V_k^{t-1} - \gamma \nabla_{V_k} f(U^t, W^t, V^{t-1}) \big]
  \]
  Projection onto the Frobenius-norm ball is implemented as rescaling if the power constraint is exceeded.
- **PGD WMMSE [2006.08448]:** For MISO (multi-user single-output), uses $K$ steps of projected gradient within each outer loop, fully avoiding inversions or eigen-decompositions.

### 3.2 Polynomial Expansion and Deep Unfolding

- **Learned Truncated Polynomial Expansion (TPE) [2402.12595]:** Approximates $(H^H H + \sigma^2 I)^{-1}$ via
  \[
  X^{-1} \approx \sum_{\ell=0}^{L-1} c_\ell X^\ell
  \]
  The coefficients $\{c_\ell\}$ are learned offline to best match the linear MMSE or WMMSE mapping over typical channels.
- **Deep-unfolded WMMSE [2006.08448], [2205.08877]:** Each forward layer in the unfolded network mimics a WMMSE iteration but replaces all inversion steps with differentiable, learned module blocks.

### 3.3 Low-Dimensional and Recursion-Based Reductions

- **Reduced WMMSE (R-WMMSE) [2205.06225]:** For MU-MIMO under sum-power constraints, exploits the fact that all stationary-point precoders lie in the range of $H^H$, so the problem is reduced to optimizing over $D$-dim (sum of user stream counts), requiring only $D\times D$ inversions (where $D\ll M$).
- **PAPC-WMMSE [2205.06225]:** For per-antenna power constraints, recasts the precoder update as a sequence of small norm-ball projections, avoiding large matrix solves entirely.

### 3.4 Gradient and Iterative Approximation in General MU-MIMO

- **MIF-WMMSE [2205.08877]:** Uses gradient-descent and Newton-Schulz recursion for the weight matrix updates, bringing all update complexity down to matrix-multiplies.
- **Finite-horizon optimization with Chebyshev steps [2503.11356]:** Applies a fractional programming reformulation and then runs a fixed, optimally scheduled sequence of gradient steps with Chebyshev-optimal step-sizes to minimize the subproblem residual without inversion.

## 4. Convergence Theory and Optimality

Matrix-inverse-free WMMSE approaches are instances of inexact block coordinate descent over composite (often nonconvex) objectives. Convergence proofs rely on:

- **Block-wise convexity:** Each subproblem is convex in its own block (e.g., $U$, $W$, $V$ individually).
- **Lipschitz continuity:** Ensures sufficient decrease of auxiliary cost for small enough step sizes.
- **Projection and bounding:** The use of power constraint projections ensures iterates remain feasible and in a compact set.
- **Global convergence:** Every accumulation point is a stationary (KKT) point of the original WSR maximization [2510.20507], [2205.06225], [2205.08877].

Furthermore, finite-layer deep-unfolded versions achieve nearly all the performance gains of classic WMMSE when the number of iterations/layers and PGD steps per layer are chosen appropriately [2006.08448], [2205.08877].

## 5. Computational Complexity and Parallel Implementation

A principal benefit of all matrix-inverse-free WMMSE algorithms is replacing $\mathcal{O}(M^3)$ inversion bottlenecks with $\mathcal{O}(KM^2d)$ or $\mathcal{O}(MND)$ multiply-adds per iteration. This unlocks:

- **Scalable acceleration:** Matrix-matrix operations are highly parallel and map directly to GPU/FPGA hardware (cUBLAS, PyTorch, etc.) [2510.20507], [2205.08877].
- **Reduced latency:** Wall-clock time reductions up to $5\times$ (CPU) or $3\times$ (GPU) in high-dimensional simulations (e.g., $M=512, K=20$).
- **Suitability for large-scale MIMO:** Enables realtime adaptation in massive MIMO where $M\gg K,N$ [2503.11356].

| WMMSE Algorithm        | Per-iteration Cost      | Inversion Needed?         |
|-----------------------|------------------------|---------------------------|
| Classical WMMSE       | $O(M^3)$               | Yes ($M\times M$)         |
| A-MMMSE / BCGD        | $O(KM^2 d)$            | No                        |
| R-WMMSE               | $O(D^3)$               | Only $D\times D$ ($D\ll M$) |
| PGD-Unfolded           | $O(LK M^2)$            | No                        |
| TPE-Deep Learning     | $O(LNK)$ (detection)   | No                        |

## 6. Performance Profile and Empirical Results

Simulation studies across various platforms and problem sizes consistently show:

- **Empirical optimality:** For a fixed number of iterations or computation budget, matrix-inverse-free and unfolded WMMSE variants reach $\geq 98\%$ of the classical WMMSE WSR, and frequently outperform truncated or ill-budgeted classic WMMSE [2006.08448], [2503.11356], [2510.20507].
- **Acceleration via warm starts:** Staged initialization (e.g., unweighted MSE minimization followed by full WMMSE) can further cut convergence time by $20$–$35\%$ [2510.20507].
- **Quantitative speedup:** In large MU-MIMO, matrix-inverse-free BCGD and finite-horizon Chebyshev-optimized GD are between $2\times$ and $5\times$ faster per problem solved, both on CPU and GPU [2510.20507], [2503.11356].
- **Robustness to SNR and scaling:** These methods maintain near-optimal sum-rate across low to high SNRs and for $M$ up to several thousand.

## 7. Implementation Considerations and Practical Guidelines

- **Initialization:** Appropriate scaling (e.g., matched-filter output rescaled to feasible power) is essential for stable convergence [2006.08448].
- **Step-size scheduling:** Learning or choosing Chebyshev-optimal, adaptive, or progressively shrinking step sizes accelerates convergence and avoids overshooting [2503.11356].
- **Batching and vectorization:** All core updates are amenable to batch execution over multiple users or antennas, allowing end-to-end integration with model-driven or data-driven acceleration frameworks [2510.20507], [2402.12595].
- **Hardware mapping:** For on-device or real-time deployment, matrix-inverse-free architectures minimize dependency on serial or non-parallelizable operations.

## References

- "An Accelerated Mixed Weighted-Unweighted MMSE Approach for MU-MIMO Beamforming" [2510.20507]
- "A matrix-inverse-free implementation of the MU-MIMO WMMSE beamforming algorithm" [2205.08877]
- "Finite Horizon Optimization for Large-Scale MIMO" [2503.11356]
- "Deep unfolding of the weighted MMSE beamforming algorithm" [2006.08448]
- "Rethinking WMMSE: Can Its Complexity Scale Linearly With the Number of BS Antennas?" [2205.06225]
- "Truncated Polynomial Expansion-Based Detection in Massive MIMO: A Model-Driven Deep Learning Approach" [2402.12595]
- "Highly Accelerated Weighted MMSE Algorithms for Designing Precoders in FDD Systems with Incomplete CSI" [2312.01888]

Source: https://www.emergentmind.com/topics/matrix-inverse-free-wmmse