Yang Yang

Yang Yang

Auto-generated profile, based on publicly available information

Yang Yang

Competence Center for High Performance Computing, Fraunhofer Institute for Industrial Mathematics, Kaiserslautern, Germany

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 December 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
YYYang Yang
Yang Yang
MPMarius Pesavento
Marius Pesavento
ZLZhi-Quan Luo
Zhi-Quan Luo
BOBjorn Ottersten
Bjorn Ottersten
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by solving the original optimization problem with respect to that block variable inexactly. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.

23 October 2018 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Open access
YYYang Yang
Yang Yang
MPMarius Pesavento
Marius Pesavento
SCSymeon Chatzinotas
Symeon Chatzinotas
BOBjorn Ottersten
Bjorn Ottersten
In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed framework is based on a nontrivial combination of the majorization–minimization framework and the successive convex approximation framework proposed in literature for a convex regularization function. The proposed framework has several attractive features, namely, first, flexibility, as different choices of the approximate function lead to different types of algorithms; second, fast convergence, as the problem structure can be better exploited by a proper choice of the approximate function and the stepsize is calculated by the line search; third, low complexity, as the approximate function is convex and the line search scheme is carried out over a differentiable function; fourth, guaranteed convergence to a stationary point. We demonstrate these features by two example applications in subspace learning, namely the network anomaly detection problem and the sparse subspace clustering problem. Customizing the proposed framework by adopting the best-response type approximation, we obtain soft-thresholding with exact line search algorithms for which all elements of the unknown parameter are updated in parallel according to closed-form expressions. The attractive features of the proposed algorithms are illustrated numerically.

19 February 2018 in IEEE Transactions on Communications
Verified
Journal Article
Open access
YCYing Cui
Ying Cui
ZWZitian Wang
Zitian Wang
YYYang Yang
Yang Yang
FYFeng Yang
Feng Yang
LDLianghui Ding
Lianghui Ding
LQLiang Qian
Liang Qian
Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high signal-to-noise ratio (SNR) and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and adopt an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes.

29 May 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
CYChencheng Ye
Chencheng Ye
YCYing Cui
Ying Cui
YYYang Yang
Yang Yang
RWRui Wang Wang
Rui Wang Wang
Most existing caching solutions for wireless networks rest on the ideal assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal random caching designs for perfect, imperfect and unknown file popularity distributions in a large-scale multi-tier wireless network. First, in the case of perfect file popularity distribution, we formulate the successful transmission probability (STP) optimization problem which is nonconvex. We propose an efficient parallel iterative algorithm to obtain a stationary point based on parallel successive convex approximation (SCA). Then, in the case of imperfect file popularity distribution, we formulate the worst-case STP maximization problem. To solve this challenging robust optimization problem, we transform it to an equivalent complementary geometric programming (CGP), and propose an efficient iterative algorithm to obtain a stationary point based on SCA. To the best of our knowledge, this is the first work explicitly considering the estimation error of file popularity distribution in the optimization of caching design. Next, in the case of unknown file popularity distribution, we formulate the stochastic STP (i.e., the STP in the stochastic form) maximization problem. This is a challenging nonconvex stochastic optimization problem, and we propose an efficient iterative algorithm to obtain a stationary point based on stochastic parallel SCA. As far as we know, this is the first work considering stochastic optimization in a large-scale wireless network. Finally, by numerical results, we show that the proposed solutions achieve notable gains over existing schemes in all three cases, and reveal the values of the robust caching optimization and stochastic caching optimization in the cases of imperfect file popularity distribution and unknown file popularity distribution, respectively.

5 February 2018 in IEEE Transactions on Communications
Verified
Journal Article
Open access
JXJiang Xue
Jiang Xue
SBSudip Biswas
Sudip Biswas
ACAli Cagatay Cirik
Ali Cagatay Cirik
HDHuiqin Du
Huiqin Du
YYYang Yang
Yang Yang
MSMathini Sellathurai
Mathini Sellathurai
In this paper, we investigate the energy harvesting (EH) technique and accordingly design transceivers for a K link multiple-input multiple-output (MIMO) interference channel. Each link consists of two full-duplex (FD) internet of things (IoT) nodes exchanging information simultaneously in a bi-directional communication channel. All the nodes suffer from interference, in particular strong self-interference and inter-node interference, due to operating in FD mode and simultaneous transmission at each link, respectively. Further, we divide the received signal at each node into two parts. While one part of the signal is used for information decoding, the other part is used for EH. We jointly design the transmit and receive beamforming vectors and receiver power splitting ratios by minimizing the total transmission power of the system, subject to both signal-to-interference-plus-noise ratio (SINR) and EH threshold constraints. Furthermore, the case of multiple-input single-output (MISO) interference channel is also included for the sake of comparison. We also revisit the above problems for the case when the available channel state information (CSI) at the transmitters is imperfect, where the errors of the CSI are assumed to be norm bounded. Simulation results show that the EH technique can harvest enough energy to support power consumption limited IoT devices by aiding in recharging their respective batteries.

14 June 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
YYYang Yang
Yang Yang
MPMarius Pesavento
Marius Pesavento
SCSymeon Chatzinotas
Symeon Chatzinotas
BOBjorn Ottersten
Bjorn Ottersten
In this paper, we consider the (global and sum) energy efficiency optimization problem in downlink multi-input multi-output multi-cell systems, where all users suffer from multi-user interference. This is a challenging problem due to several reasons: 1) it is a nonconvex fractional programming problem; 2) the transmission rate functions are characterized by (complex-valued) transmit covariance matrices; and 3) the processing-related power consumption may depend on the transmission rate. We tackle this problem by the successive pseudoconvex approximation approach, and we argue that pseudoconvex optimization plays a fundamental role in designing novel iterative algorithms, not only because every locally optimal point of a pseudoconvex optimization problem is also globally optimal, but also because a descent direction is easily obtained from every optimal point of a pseudoconvex optimization problem. The proposed algorithms have the following advantages: 1) fast convergence as the structure of the original optimization problem is preserved as much as possible in the approximate problem solved in each iteration, 2) easy implementation as each approximate problem is suitable for parallel computation and its solution has a closed-form expression, and 3) guaranteed convergence to a stationary point or a Karush-Kuhn-Tucker point. The advantages of the proposed algorithm are also illustrated numerically.