Related papers: Sum-Rate Maximization via Convex Optimization Usin…
We focus on the problem of minimizing the sum of smooth component functions (where the sum is strongly convex) and a non-smooth convex function, which arises in regularized empirical risk minimization in machine learning and distributed…
In this paper, an intelligent reflecting surface (IRS) is deployed to assist the terahertz (THz) communications. The molecular absorption causes path loss peaks to appear in the THz frequency band, and the fading peak is greatly affected by…
Reconfigurable intelligent surfaces (RIS) is a promising solution to build a programmable wireless environment via steering the incident signal in fully customizable ways with reconfigurable passive elements. In this paper, we consider a…
This letter studies joint transmit beamforming and antenna selection at a secondary base station (BS) with multiple primary users (PUs) in an underlay cognitive radio multiple-input single-output broadcast channel. The objective is to…
This paper investigates the joint data and pilot power optimization for maximum sum spectral efficiency (SE) in multi-cell Massive MIMO systems, which is a non-convex problem. We first propose a new optimization algorithm, inspired by the…
Optimization models with non-convex constraints arise in many tasks in machine learning, e.g., learning with fairness constraints or Neyman-Pearson classification with non-convex loss. Although many efficient methods have been developed…
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…
We design accelerated algorithms with improved rates for several fundamental classes of optimization problems. Our algorithms all build upon techniques related to the analysis of primal-dual extragradient methods via relative Lipschitzness…
In this paper, we use Proximal Cubic regularized Newton Methods (PCNM) to optimize the sum of a smooth convex function and a non-smooth convex function, where we use inexact gradient and Hessian, and an inexact subsolver for the cubic…
In this paper, we study the problem of maximizing continuous submodular functions that naturally arise in many learning applications such as those involving utility functions in active learning and sensing, matrix approximations and network…
State-of-the-art methods for solving smooth optimization problems are nonlinear conjugate gradient, low memory BFGS, and Majorize-Minimize (MM) subspace algorithms. The MM subspace algorithm which has been introduced more recently has shown…
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of a feasible solution by the image of some solution in the…
In this paper, we propose an efficient joint precoding design method to maximize the weighted sum-rate in wideband intelligent reflecting surface (IRS)-assisted cell-free networks by jointly optimizing the active beamforming of base…
Constrained Optimization solution algorithms are restricted to point based solutions. In practice, single or multiple objectives must be satisfied, wherein both the objective function and constraints can be non-convex resulting in multiple…
The security of spatial modulation (SM) aided networks can always be improved by reducing the desired link's power at the cost of degrading its bit error ratio performance and assuming the power consumed to artificial noise (AN) projection…
In this paper, we propose a new distributed energy beamforming and information transfer (DEBIT) scheme for realizing simultaneous wireless information and power transfer (SWIPT) in multiway relay networks (MWRNs), where multiple…
This paper considers a general stochastic resource allocation problem that arises widely in wireless networks, cognitive radio, networks, smart-grid communications, and cross-layer design. The problem formulation involves expectations with…
Reconfigurable holographic surfaces (RHS) are intrinsically amalgamated with reconfigurable intelligent surfaces (RIS), for beneficially ameliorating the signal propagation environment. This potent architecture significantly improves the…
The push-sum based subgradient is an important method for distributed convex optimization over unbalanced directed graphs, which is known to converge at a rate of $O(\ln t/\sqrt{t})$. This paper shows that the subgradient-push algorithm…
In this paper, we introduce a stochastic projected subgradient method for weakly convex (i.e., uniformly prox-regular) nonsmooth, nonconvex functions---a wide class of functions which includes the additive and convex composite classes. At a…