%0 Journal Article
%T 一种非精确邻近梯度算法<br>An Inexact Proximal Gradient Algorithm
%A 辜随佳
%A 王湘美
%J Pure Mathematics
%P 654-663
%@ 2160-7605
%D 2024
%I Hans Publishing
%R 10.12677/pm.2024.145218
%X 邻近点算法(PPA)是求解非光滑优化问题的一种有效的迭代算法，对特殊结构问题的求解非常高效，但在实际问题中求解大规模可分离问题时花费很大。为解决上述问题且同时又保持PPA算法的优点，本文给出了一种非精确邻近梯度算法。该算法结合了线搜索法与邻近梯度下降算法的思想，在子问题的求解过程中采用近似的梯度，且不需要Lipschitz常数已知。基于以上思想，首先我们给出算法的伪代码，然后建立了算法收敛性的充分条件，最后证明在该条件下，算法迭代所产生序列的每个极限点是原问题的临界点。<br />
The Proximity Algorithm (PPA) is an effective iterative algorithm for solving non-smooth optimization problems, which is very efficient in solving special structural problems, but it is expensive to solve large-scale separable problems in practical problems. In order to solve the above problems and maintain the advantages of PPA algorithm, an inexact proximity gradient algorithm is proposed. The algorithm combines the ideas of the line search method and the proximity gradient descent algorithm, and adopts the approximate gradient in the solution of the sub-problem, and does not need the Lipschitz constant to be known. Based on the above ideas, firstly, we give the pseudocode of the algorithm, then establish the sufficient conditions for the convergence of the algorithm, and finally prove that under this condition, each limit point of the sequence generated by the algorithm iteration is the critical point of the original problem.
%K 邻近点算法，线搜索，收敛性分析，非精确梯度<br>Proximity Algorithm
%K Line Search
%K Convergence Analysis
%K Inexact Gradient
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=88746