相关论文: A Convex Approximation of the Relaxed Binaural Bea…
Binaural speech enhancement (BSE) aims to jointly improve the speech quality and intelligibility of noisy signals received by hearing devices and preserve the spatial cues of the target for natural listening. Existing methods often suffer…
There is an increasing interest in quantum algorithms for optimization problems. Within convex optimization, interior-point methods and other recently proposed quantum algorithms are non-trivial to implement on noisy quantum devices. Here,…
Integrated sensing and communications (ISAC) has emerged as a promising paradigm to unify wireless communications and radar sensing, enabling efficient spectrum and hardware utilization. A core challenge with realizing the gains of ISAC…
We address the problem of downlink beamformer design for signal-to-interference-plus-noise ratio (SINR) balancing in a multiuser multicell environment with imperfectly estimated channels at base stations (BSs). We first present a…
In this paper, we propose beamforming schemes to simultaneously transmit data securely to multiple information receivers (IRs) while transferring power wirelessly to multiple energy-harvesting receivers (ERs). Taking into account the…
We study binary optimization problems of the form \( \min_{x\in\{-1,1\}^n} f(Ax-b) \) with possibly nonsmooth loss \(f\). Following the lifted rank-one semidefinite programming (SDP) approach\cite{qian2023matrix}, we develop a…
This paper addresses the robust adaptive beamforming (RAB) problem via the worst-case signal-to-interference-plus-noise ratio (SINR) maximization over distributional uncertainty sets for the random interference-plus-noise covariance (INC)…
This paper investigates reconfigurable intelligent surface (RIS)-assisted secure multiuser communication systems subject to hardware impairments (HIs). We jointly optimize the beamforming vectors at the base station (BS) and the phase…
The existence of multiple irregular obstacles in the environment introduces nonconvex constraints into the optimization for motion planning, which makes the optimal control problem hard to handle. One efficient approach to address this…
Nonconvex optimization refers to the process of solving problems whose objective or constraints are nonconvex. Historically, this type of problems have been very difficult to solve to global optimality, with traditional solvers often…
While Cram\'er-Rao lower bound is an important metric in sensing functions in integrated sensing and communications (ISAC) designs, its optimization usually involves a computationally expensive solution such as semidefinite relaxation. In…
This paper introduces novel transmit beamforming approaches for the cognitive radio (CR) Z-channel. The proposed transmission schemes exploit non-causal information about the interference at the SBS to re-design the CR beamforming…
In this paper, we investigate the downlink secure beamforming (BF) design problem of cloud radio access networks (C-RANs) relying on multicast fronthaul, where millimeter-wave and microwave carriers are used for the access links and…
The robust adaptive beamforming (RAB) problem for general-rank signal model with an additional positive semi-definite constraint is considered. Using the principle of the worst-case performance optimization, such RAB problem leads to a…
Existing methods for robust multigroup multicast beamforming obtain feasible points using semidefinite relaxation (SDR) and Gaussian randomization, and have high computational complexity. In this letter, we consider the robust multigroup…
Diffusion models serve as a powerful generative framework for solving inverse problems. However, they still face two key challenges: 1) the distortion-perception tradeoff, where improving perceptual quality often degrades reconstruction…
Through spatial multiplexing and diversity, multi-input multi-output (MIMO) cognitive radio (CR) networks can markedly increase transmission rates and reliability, while controlling the interference inflicted to peer nodes and primary users…
This paper proposes an elegant optimization framework consisting of a mix of linear-matrix-inequality and second-order-cone constraints. The proposed framework generalizes the semidefinite relaxation (SDR) enabled solution to the typical…
This work considers the decentralized successive convex approximation (SCA) method for minimizing stochastic non-convex objectives subject to convex constraints, along with possibly non-smooth convex regularizers. Although SCA has been…
A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink…