Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">L_{q}</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach

DOI10.1109/TSP.2015.2428224MaRDI QIDQ4580676zbMATH OpenOpenAlexFDO

Authors Ya-Feng Liu, Yuhong Dai, Shiqian Ma

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.3045

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)

Abstract: In an interference limited network, joint power and admission control (JPAC) aims at supporting a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. Various convex approximation deflation approaches have been developed for the JPAC problem. In this paper, we propose an effective polynomial time non-convex approximation deflation approach for solving the problem. The approach is based on the non-convex $el{l}_q$-minimization approximation of an equivalent sparse $el{l}_0$-minimization reformulation of the JPAC problem where $qin(0,1).$ We show that, for any instance of the JPAC problem, there exists a $$ such that it can be exactly solved by solving its $el{l}_q$-minimization approximation problem with any $$. We also show that finding the global solution of the $el{l}_q$ approximation problem is NP-hard. Then, we propose a potential reduction interior-point algorithm, which can return an $epsilon$-KKT solution of the NP-hard $el{l}_q$-minimization approximation problem in polynomial time. The returned solution can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure, resulting in the polynomial time non-convex approximation deflation approach for the JPAC problem. Numerical simulations show that the proposed approach outperforms the existing convex approximation approaches in terms of the number of supported links and the total transmission power, particularly exhibiting a quite good performance in selecting which subset of links to support.

Cited in

(9)

• Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
• Joint Power and Admission Control via Linear Programming Deflation
• A smoothing SQP framework for a class of composite L_q minimization over polyhedron
• Alternating direction method of multipliers for nonconvex fused regression problems
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices
• An augmented Lagrangian method for non-Lipschitz nonconvex programming
• Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited

This page was built for publication: Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580676)