...u)为锥,因此, c^b(u)=Na(t正),Vu∈皿”,Vc>0. 对此问题,经典的求解方法为邻近点算法(Proximal Point Algorithm):给定初始点 U0∈Q,据如下迭代格式解出uk+l: 0∈(t正知+l—t‘奄)+akT(u知+1), 其中,{Q七)c【QInin,oo),QIllin>0...
基于24个网页-相关网页
In this dissertation, we focus on adapting proximal point algorithms to solve set-valued equations, variational inequalities problems and optimization problems.
本文主要研究用邻近点算法求解集值映射方程,变分不等式问题和最优化化问题。
参考来源 - 邻近点算法及其在最优化问题中的应用·2,447,543篇论文数据,部分数据来源于NoteExpress
然而精确地解子问题太昂贵有时也不可能,在许多文献里讨论了不精确邻近点算法(IPPA)。
However, solving the sub-problems is either expensive or impossible. The inexact proximal point algorithm (IPPA) was developed in many literature.
本文证明DC函数最小化问题邻近点算法的一个收敛性定理,并对此问题提出一类非精确邻近点算法。
In this paper we prove a convergence theorem of the proximate point algorithm for minimization of DC function, and propose a kind of inexact proximate point algorithm for the minimization problem.
给出求解单调变分不等式问题的一个近似邻近点算法,在不需要任何中间步骤的条件下证明算法的收敛性。
This paper presents a approximate proximal algorithm finding the zero of a maximal monotone operator in Hilbert space, whose error criterion is weaker than that in the literatures.
应用推荐