arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.04972math.OCcs.NAmath.NA
收藏

一种统一的递进伪凸逼近框架

A Unified Successive Pseudo-Convex Approximation Framework

Intel Deutschland GmbH(英特尔德国有限公司);Darmstadt University of Technology(达姆施塔特工业大学)

Yang Yang, Marius Pesavento

AI总结:

本文提出了一种递进伪凸逼近算法,用于高效计算一大类可能非凸优化问题的 stationary 点。通过求解一系列逐步细化的近似问题,每个问题比原始问题更容易求解。为了保证收敛性,近似问题只需要表现出一种弱形式的凸性,即伪凸性。我们证明该框架不仅包含梯度法和雅可比算法等现有方法作为特殊情况,还导致了具有更简单实现和更快收敛速度的新算法。此外,我们还提出了一种新的线搜索方法用于非可微优化问题,该方法在适当构造的可微函数上进行,相比直接操作原始非可微目标函数的最新线搜索技术,具有更简单的实现。通过多个应用示例,如MIMO广播信道容量计算、大规模MIMO系统中的能量效率最大化和稀疏信号恢复中的LASSO,展示了所提算法的优势。

摘要:

在本文中,我们提出了一种递进伪凸逼近算法,以高效计算一大类可能非凸优化问题的 stationary 点。这些 stationary 点是通过求解一系列逐步细化的近似问题得到的,每个问题比原始问题更容易求解。为了实现收敛性,近似问题只需要表现出一种弱形式的凸性,即伪凸性。我们证明所提出的框架不仅包含了梯度法和雅可比算法等现有方法作为特殊情况,还导致了具有更简单实现和更快收敛速度的新算法。此外,我们还提出了一种新的线搜索方法用于非可微优化问题,该方法是在一个适当构造的可微函数上进行的,相较于直接操作原始非可微目标函数的最新线搜索技术,具有更简单的实现。通过多个应用示例,如MIMO广播信道容量计算、大规模MIMO系统中的能量效率最大化和稀疏信号恢复中的LASSO,展示了所提算法的优势。

英文摘要:

In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of successively refined approximate problems, each of which is much easier to solve than the original problem. To achieve convergence, the approximate problem only needs to exhibit a weak form of convexity, namely, pseudo-convexity. We show that the proposed framework not only includes as special cases a number of existing methods, for example, the gradient method and the Jacobi algorithm, but also leads to new algorithms which enjoy easier implementation and faster convergence speed. We also propose a novel line search method for nondifferentiable optimization problems, which is carried out over a properly constructed differentiable function with the benefit of a simplified implementation as compared to state-of-the-art line search techniques that directly operate on the original nondifferentiable objective function. The advantages of the proposed algorithm are shown, both theoretically and numerically, by several example applications, namely, MIMO broadcast channel capacity computation, energy efficiency maximization in massive MIMO systems and LASSO in sparse signal recovery.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑