DC Programming and DCA for Secrecy Rate Maximization via Null Space AF Relay Beamforming in a Wireless Network with Multiple Eavesdroppers
Authors:
- Le ThiLTLe Thi
- Hoai AnHAHoai An
- Thi Thuy TranTTThi Thuy Tran
- Nhu Tuan NguyenNNNhu Tuan Nguyen
- 2 January 2026
- book chapter
- Published by Springer Nature
- p. 46-60
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- DC approximation approaches for sparse optimizationEuropean Journal of Operational Research, 2015
- Feature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithmsNeural Networks, 2014
- Self-organizing maps by difference of convex functions optimizationData Mining and Knowledge Discovery, 2014
- DC Programming and DCA for General DC Programs2014
- Recent Advances in DC Programming and DCA2014
- DC programming in communication systems: challenging problems and methodsVietnam Journal of Computer Science, 2013
- DC Programming and DCA Based Cross-Layer Optimization in Multi-hop TDMA Networks2013
- Solving QoS Routing Problems by DCA2010
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- The Wire-Tap ChannelBell System Technical Journal, 1975