The Chen-Teboulle algorithm is the proximal point algorithm
英文摘要：
We revisit the Chen-Teboulle algorithm using recent insights and show that this allows a better bound on the step-size parameter.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
A Revisit of Chen-Teboulle's Proximal-based Decomposition Method
In this paper, we show that Chen-Teboulle's proximal-based decomposition method can be interpreted as a proximal augmented Lagrangian method. More precisely, it coincides with a linearized augmented Lagrangian method. We then proposed three generalized methods based on this interpretation. By invoking recent work (He et al., IMA J. Numer. Anal., 32 (2020), pp. 227--245), we show that the step size condition of Chen-Teboulle's method can be relaxed without adding any further assumptions. Our analysis offers a new insight into this proximal-based decomposition method.
math.OC
Exact Worst-case Performance of First-order Methods for Composite Convex Optimization
We provide a framework for computing the exact worst-case performance of any algorithm belonging to a broad class of oracle-based first-order methods for composite convex optimization, including those performing explicit, projected, proximal, conditional and inexact (sub)gradient steps. We simultaneously obtain tight worst-case guarantees and explicit instances of optimization problems on which the algorithm reaches this worst-case. We achieve this by reducing the computation of the worst-case to solving a convex semidefinite program, generalizing previous works on performance estimation by Dr…
math.OC
The Smoothing Proximal Gradient Algorithm with Extrapolation for the Relaxation of $l_0$ Regularization Problem
In this paper, we consider the exact continuous relaxation model of $l_0$ regularization problem which was given by Bian and Chen (SIAM J. Numer. Anal 58(1): 858-883, 2020) and propose a smoothing proximal gradient algorithm with extrapolation (SPGE) for this kind of problem. We show that any accumulation point of the sequence generated by SPGE algorithm is a lifted stationary point of the relaxation model for a fairly general choice of extrapolation parameter. Moreover, it is shown that the whole sequence generated by SPGE algorithm converges to a lifted stationary point of the relaxation mod…
math.OC
非光滑凸优化中的子博弈完美方法
Subgame Perfect Methods in Nonsmooth Convex Optimization
Johns Hopkins University（约翰斯·霍普金斯大学）；Purdue University（普渡大学）
本文针对带次梯度或近端算子预言机的非光滑凸优化问题，识别并提出满足子博弈完美性的算法，证明其性能不劣于极小极大最优且常更优。
math.OC
松弛近端点算法：紧复杂度界与无动量加速
Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum
本文研究了求解凸优化问题的松弛近端点算法（RPPA），扩展了三种松弛调度，分别建立了紧非遍历 $O(1/N)$、快约 $\sqrt{2}$ 倍及 $O(1/N^{1.2716})$ 的加速收敛速率，并证实了关于银色步长梯度下降的猜想。
math.OC
关于Bredies-Chenchene-Lorenz-Naldi算法
On the Bredies-Chenchene-Lorenz-Naldi algorithm
本文补充Bredies等人提出的算法框架分析，通过关联底层算子不动点集的投影，在线性关系下获得强收敛结果，并给出实例验证。
math.FAmath.OC
更多相关论文收起更多论文
一种新的收敛性分析和某些加速近端前向-后向算法中误差鲁棒性的研究
A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
University of São Paulo（圣保罗大学）
本文分析了带误差的加速近端前向-后向算法的收敛性，证明其在Hilbert空间中保持非渐近收敛速度，并扩展了超级化方法的应用范围。
cs.NAmath.NAmath.OC
结构凸优化的惯性原始对偶法
Inertial primal-dual algorithms for structured convex optimization
Chambolle & Pock（简称CPA）最近提出的结构凸优化的原始对偶法是一种非常有效和流行的算法。Chambolle和Pock在\cite{CP11}中以及Shefi和Teboulle在\cite{ST14}中指出，CPA及其变体与流行的乘子交替方向法（简称ADM）的预处理版本密切相关。在本文中，我们进一步澄清这种连接，并表明，CPAs产生完全相同的点序列与所谓的线性化ADM（简称LADM）适用于原始问题或其拉格朗日对偶，根据不同的更新顺序的原始和对偶变量在CPAs，只要LADM的初始点被适当地选择。LADM对初始点的依赖性可以通过关注算法的循环等价形式来放松。此外，利用这一事实，CPA是一个一般的加权邻近点方法的混合变分不等式制定的KKT系统，其中的权重矩阵是正定的参数条件下的应用程序，我们能够提出和分析的CPA的惯性变量。在一定的条件下，所提出的惯性CPA能保证全局点收敛、非渐近$O(1/k)$和渐近$o(1/k)$收敛速度，其中$k$表示迭代指标.最后，我们通过基于总变分最小化的压缩图像重建实验结果，证明了引入惯性外推步骤所带来的好处。
math.OC
