A convex approximation method for multiuser MISO sum rate maximization under discrete rate constraints.
Hoi-To WaiQiang LiWing-Kin MaPublished in: ICASSP (2013)
Keyphrases
- objective function
- detection method
- preprocessing
- absolute difference
- geometric constraints
- clustering method
- segmentation method
- inequality constraints
- convex sets
- high accuracy
- support vector machine
- computational cost
- dynamic programming
- model selection
- similarity measure
- high precision
- constrained optimization
- relative error
- approximation methods
- polygonal approximation
- cost function
- convex constraints