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

求解变分不等式约束最优化问题的一种具有收敛速度的方法

A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints

Harshal D. Kaushik, Farzad Yousefian

摘要:

考虑一类具有Cartesian变分不等式(CVI)约束的最优化问题,其中目标函数是凸的,且CVI与单调映射和凸笛卡儿积集相关联.这个数学公式捕捉了广泛的最优化问题,包括那些复杂的存在的平衡约束,互补约束,或内部级别的大规模最优化问题。特别是,一个重要的激励应用程序产生于多代理网络中均衡的效率估计的概念,例如,通信网络和电力系统。在文献中,现有的求解具有CVI约束的最优化问题的方法的迭代复杂性似乎是未知的。为了解决这个问题,我们开发了一个一阶方法,称为平均随机块迭代正则化梯度(aRB-IRG)。主要贡献包括:(i)在CVI的相关集有界且目标函数不可微且凸的情况下,我们得到了新的平均意义下的非渐近次优性和不可行收敛速度。当我们抑制随机块坐标方案时,我们还获得了收敛速度的确定性变体。重要的是,本文似乎是第一个工作,为这类问题提供这些速率保证。(ii)在CVI集无界且目标函数光滑且强凸的情况下,利用Tikhonov轨线的性质,证明了aRB-IRG算法在几乎处处和平均意义下的整体收敛.我们提供了计算网络古诺竞争模型的最佳纳什均衡的数值实验。

英文摘要:

We consider a class of optimization problems with Cartesian variational inequality (CVI) constraints, where the objective function is convex and the CVI is associated with a monotone mapping and a convex Cartesian product set. This mathematical formulation captures a wide range of optimization problems including those complicated by the presence of equilibrium constraints, complementarity constraints, or an inner-level large scale optimization problem. In particular, an important motivating application arises from the notion of efficiency estimation of equilibria in multi-agent networks, e.g., communication networks and power systems. In the literature, the iteration complexity of the existing solution methods for optimization problems with CVI constraints appears to be unknown. To address this shortcoming, we develop a first-order method called averaging randomized block iteratively regularized gradient (aRB-IRG). The main contributions include: (i) In the case where the associated set of the CVI is bounded and the objective function is nondifferentiable and convex, we derive new non-asymptotic suboptimality and infeasibility convergence rate statements in a mean sense. We also obtain deterministic variants of the convergence rates when we suppress the randomized block-coordinate scheme. Importantly, this paper appears to be the first work to provide these rate guarantees for this class of problems. (ii) In the case where the CVI set is unbounded and the objective function is smooth and strongly convex, utilizing the properties of the Tikhonov trajectory, we establish the global convergence of aRB-IRG in an almost sure and a mean sense. We provide the numerical experiments for computing the best Nash equilibrium in a networked Cournot competition model.

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

↑