In this paper we consider cardinality-constrained convex programs that minimize a convex function subject to a cardinality constraint and other linear constraints. This class of problems has found many applications, including portfolio selection, subset selection and compressed sensing. We propose a successive convex approximation method for this class of problems in which the cardinality funct...

Unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) systems offer significant advantages in coverage and deployment flexibility, but suffer from endurance limitations due to the limited onboard energy. This article proposes improve energy efficiency of UAV-enabled WPT with multiple ground sensors by utilizing reconfigurable intelligent surface (RIS). Specifically, total consumpt...

Relay-enabled backscatter communication (BC) is an intriguing paradigm to alleviate energy shortage and improve throughput of Internet-of-Things (IoT) devices. Most the existing works focus on resource allocation that considered unequal continuous time for both source-relay relay-destination links. However, may be infeasible since in practice, shall carried out integral multiple subframe durati...

This paper exploits reconfigurable intelligent surfaces (RIS) to enhance physical layer security (PLS) in a challenging radio environment. By adjusting the reflecting coefficients, RIS can provide programmable wireless environment so that electromagnetic wave propagate desired way. Specifically, we consider scenario where multiple user pairs communicate simultaneously over same channel multiuse...

Federated edge learning (FEEL) is envisioned as a promising paradigm to achieve privacy-preserving distributed learning. However, it consumes excessive time due the existence of straggler devices. In this article, novel topology-optimized FEEL (TOFEL) scheme proposed tackle heterogeneity issue in federated and improve communication-and-computation efficiency. Specifically, problem jointly optim...

The strong convergence of a broad class of outer approximation methods for minimizing a convex function over the intersection of an arbitrary number of convex sets in a reflexive Banach space is studied in a unified framework. The generic outer approximation algorithm under investigation proceeds by successive minimizations over the intersection of convex supersets of the feasibility set determ...

The uplink of a cell-free massive multiple-input multiple-output with maximum-ratio combining (MRC) and zero-forcing (ZF) schemes are investigated. A power allocation optimization problem is considered, where two conflicting metrics, namely the sum rate fairness, jointly optimized. As there no closed-form expression for achievable in terms large scale-fading (LSF) components, fairness trade-off...

This paper investigates the security enhancement of an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network, where a base station (BS) serves users securely with assistance distributed IRSs. Considering that eavesdropper’s instantaneous channel state information (CSI) is challenging to acquire in practice, we utilize secrecy outage probability (SOP) as met...

A numerical method is proposed for optimal robust control synthesis. The method applies to the case when the coefficients of the characteristic polynomial depend linearly on the uncertain parameters. A primal/dual pair of infinite-dimensional convex problems is solved by successive finite-dimensional approximations. The primal/dual pair has no duality gap, and both upper and lower bounds produc...

Abstract Many practical problems, such as computer science, communications network, product design, system control, statistics and finance, etc.,can be formulated a probabilistic constrained optimization problem (PCOP) which is challenging to solve since it usually nonconvex nonsmooth. Effective methods for the mostly focus on approximation techniques, convex approximation, D.C. (difference of ...