Prerequisites & Notation
Before You Begin
This chapter is the algorithmic heart of the RIS optimization thread. We go into the internals of the three standard methods for the unit-modulus QCQP. Prior familiarity with semidefinite programming (Telecom Ch. 3) is most useful; Riemannian geometry is introduced here from the ground up.
- Semidefinite programming: feasibility, duality, interior-point methods(Review ch03)
Self-check: Can you state the SDP dual of s.t. ?
- Rank-1 PSD matrices:
Self-check: Why is and ?
- Gaussian random vectors on the complex sphere
Self-check: If with , what is the distribution of ?
- Block coordinate descent convergence (Ch. 5)(Review ch05)
Self-check: What regularity conditions guarantee BCD convergence to a stationary point?
Notation for This Chapter
Algorithm-specific notation. We focus on the unit-modulus quadratic problem throughout, so the basic RIS symbols carry over from Ch. 5 and are supplemented by SDR- and manifold-specific terms.
| Symbol | Meaning | Introduced |
|---|---|---|
| Lifted PSD variable in SDR: when rank 1 | s02 | |
| Complex unit-modulus manifold: | s03 | |
| Tangent space at | s03 | |
| Riemannian gradient: Euclidean gradient projected onto tangent space | s03 | |
| Retraction operator: maps tangent vector back to manifold | s03 | |
| Number of Gaussian randomization samples in SDR | s02 | |
| Quadratic-form matrices defining the passive objective () | s01 |