相关论文: Fast First-Order Algorithm for Large-Scale Max-Min…

This work addresses weight optimization problem for fully-connected feed-forward neural networks. Unlike existing approaches that are based on back-propagation (BP) and chain rule gradient-based optimization (which implies iterative…

This paper investigates the optimization of beamforming design in a system with integrated sensing and communication (ISAC), where the base station (BS) sends signals for simultaneous multiuser communication and radar sensing. We aim at…

This paper considers stochastic first-order algorithms for convex-concave minimax problems of the form $\min_{\bf x}\max_{\bf y}f(\bf x, \bf y)$, where $f$ can be presented by the average of $n$ individual components which are $L$-average…

Beamforming is an effective means to improve the quality of the received signals in multiuser multiple-input-single-output (MISO) systems. Traditionally, finding the optimal beamforming solution relies on iterative algorithms, which…

This letter considers the weighted sum-rate maximization (WSRMax) problem in downlink multicell multiuser orthogonal frequency-division multiplexing system. The WSRMax problem under per base station transmit power constraint is known to be…

This work presents cost-effective low-rank techniques for designing robust adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the exploitation of the cross-correlation between the array observation data and the…

Hybrid precoding design can be challenging for broadband millimeter-wave (mmWave) massive MIMO due to the frequency-flat analog precoder in radio frequency (RF). Prior broadband hybrid precoding work usually focuses on fully-connected array…

In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted…

Nonnegative matrix factorization (NMF) under the separability assumption can provably be solved efficiently, even in the presence of noise, and has been shown to be a powerful technique in document classification and hyperspectral unmixing.…

We develop a first-order (pseudo-)gradient approach for optimizing functions over the stationary distribution of discrete-time Markov chains (DTMC). We give insights into why solving this optimization problem is challenging and show how…

One of the most attractive recent approaches to processing well-structured large-scale convex optimization problems is based on smooth convex-concave saddle point reformu-lation of the problem of interest and solving the resulting problem…

Stochastic approximation with multiple coupled sequences (MSA) has found broad applications in machine learning as it encompasses a rich class of problems including bilevel optimization (BLO), multi-level compositional optimization (MCO),…

The modified Method of Successive Approximations (MSA) is an iterative scheme for approximating solutions to stochastic control problems in continuous time based on Pontryagin Optimality Principle which, starting with an initial open loop…

This paper considers joint beamformer design towards maximizing the mutual information in a coherent wireless sensor network with noisy observation and multiple antennae. Leveraging the weighted minimum mean square error and block…

A hybrid beamformer (HBF) is designed for integrated sensing and communication (ISAC)-aided millimeter wave (mmWave) systems. The ISAC base station (BS), relying on a limited number of radio frequency (RF) chains, supports multiple…

Power consumption is a major limitation in the downlink of multibeam satellite systems, since it has a significant impact on the mass and lifetime of the satellite. In this context, we study a new energy-aware power allocation problem that…

We consider joint beamforming and stream allocation to maximize the weighted sum rate (WSR) for non-coherent joint transmission (NCJT) in user-centric cell-free MIMO networks, where distributed access points (APs) are organized in clusters…

Optimal physical layer multicasting (PLM) is an NP-hard problem that for simplicity has been studied under idealistic assumptions, e.g., availability of perfect channel state information (CSI), both at the base station (BS) and at the user…

In this paper, we consider a class of structured nonsmooth optimization problems over an embedded submanifold of a Euclidean space, where the first part of the objective is the sum of a difference-of-convex (DC) function and a smooth…

We introduce a numerical framework to verify the finite step convergence of first-order methods for parametric convex quadratic optimization. We formulate the verification problem as a mathematical optimization problem where we maximize a…