多迹/Log-Det约束的秩约束Schur-凸优化
Rank-Constrained Schur-Convex Optimization with Multiple Trace/Log-Det Constraints
摘要:
秩约束优化问题近年来受到越来越多的关注,因为通信和信号处理应用中的许多优化问题都可以转化为秩约束优化问题。然而,由于秩约束的非凸性质,一般秩约束问题的系统解决方案一直是开放的。在本文中,我们专注于一个秩约束优化问题的Schur凸/凹目标函数和多个迹/对数行列式约束。首先,我们推导出一个结构的结果的秩约束问题的最优解,利用优控制理论。基于解的结构,我们将秩约束问题转化为一个等价的酉约束问题。在此基础上,我们推导出一个迭代投影最速下降算法收敛到一个局部最优解。此外,我们将证明,在某些特殊情况下,我们可以得到一个封闭形式的全局最优解。数值结果表明,我们所提出的技术优于基线计划的性能。
英文摘要:
Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization problem. However, due to the non-convex nature of rank constraints, a systematic solution to general rank-constrained problems has remained open for a long time. In this paper, we focus on a rank-constrained optimization problem with a Schur-convex/concave objective function and multiple trace/logdeterminant constraints. We first derive a structural result on the optimal solution of the rank-constrained problem using majorization theory. Based on the solution structure, we transform the rank-constrained problem into an equivalent problem with a unitary constraint. After that, we derive an iterative projected steepest descent algorithm which converges to a local optimal solution. Furthermore, we shall show that under some special cases, we can derive a closed-form global optimal solution. The numerical results show the superior performance of our proposed technique over the baseline schemes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。