然而精确地解子问题太昂贵有时也不可能，在许多文献里讨论了不精确邻近点算法(IPPA)。

However, solving the sub-problems is either expensive or impossible. The inexact proximal point algorithm (IPPA) was developed in many literature.

youdao

本文证明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.

youdao

给出求解单调变分不等式问题的一个近似邻近点算法，在不需要任何中间步骤的条件下证明算法的收敛性。

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.

youdao

给出求解单调变分不等式问题的一个近似邻近点算法，在不需要任何中间步骤的条件下证明算法的收敛性。

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.

youdao