arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.04265math.OC
收藏

使用混合牛顿法在复空间中的优化

Optimization in complex spaces with the Mixed Newton Method

Sergey Bakhurin, Roland Hildebrand, Mohammad Alkousa, Alexander Titov, Nikita Yudin

AI总结:

提出混合牛顿法用于复变量函数的无条件最小化,利用混合Wirtinger导数计算搜索方向,并在全纯函数绝对值平方和上表现出优越的全局收敛性。

摘要:

我们提出了一种用于无条件最小化复变量函数 $f(z)$ 的二阶方法。我们称之为混合牛顿法,因为其使用混合 Wirtinger 导数 $\frac{\partial^2f}{\partial\bar z\partial z}$ 来计算搜索方向,这与经典牛顿法中使用的完整 Hessian 矩阵 $\frac{\partial^2f}{\partial(z,\bar z)^2}$ 不同。该方法是为无线网络通信中的特定应用而开发的,但其在更一般的函数 $f$ 类上被证明具有优越的全局收敛性,即全纯函数绝对值的平方和。特别地,对于此类目标函数,极小值被吸引域所包围,而迭代点则被排斥离开其他类型的临界点。我们提供了渐近收敛速率的公式,并证明了在标量情况下,该方法可简化为著名的用于寻找全纯函数零点的复牛顿法。在这种情况下,它表现出一般意义上的分形全局收敛模式。

英文摘要:

We propose a second-order method for unconditional minimization of functions $f(z)$ of complex arguments. We call it the Mixed Newton Method due to the use of the mixed Wirtinger derivative $\frac{\partial^2f}{\partial\bar z\partial z}$ for computation of the search direction, as opposed to the full Hessian $\frac{\partial^2f}{\partial(z,\bar z)^2}$ in the classical Newton method. The method has been developed for specific applications in wireless network communications, but its global convergence properties are shown to be superior on a more general class of functions $f$, namely sums of squares of absolute values of holomorphic functions. In particular, for such objective functions minima are surrounded by attraction basins, while the iterates are repelled from other types of critical points. We provide formulas for the asymptotic convergence rate and show that in the scalar case the method reduces to the well-known complex Newton method for the search of zeros of holomorphic functions. In this case, it exhibits generically fractal global convergence patterns.

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

↑