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
From MaRDI portal
Publication:4580676
DOI10.1109/TSP.2015.2428224zbMath1394.94340arXiv1311.3045OpenAlexW2963359247MaRDI QIDQ4580676
Ya-Feng Liu, Shi-Qian Ma, Yu-Hong Dai
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
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (8)
Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs ⋮ Alternating direction method of multipliers for nonconvex fused regression problems ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ 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
