大规模结构稀疏最优化问题的降维技术及其在凸聚类中的应用
A Dimension Reduction Technique for Large-scale Structured Sparse Optimization Problems with Application to Convex Clustering
摘要:
本文提出了一种新的自适应筛选(AS)技术和一种增强的自适应筛选(EAS)技术,它们与求解器无关,可以加速求解具有内在结构稀疏性的大规模凸优化问题的优化算法。我们建立了有限收敛性的AS技术和EAS技术与不精确解的减少的子问题。作为一个重要的应用,我们将AS技术和EAS技术应用到凸聚类模型上,这可以将最先进的算法SSNAL加速7倍以上,将算法ADMM加速14倍以上。
英文摘要:
In this paper, we propose a novel adaptive sieving (AS) technique and an enhanced AS (EAS) technique, which are solver independent and could accelerate optimization algorithms for solving large scale convex optimization problems with intrinsic structured sparsity. We establish the finite convergence property of the AS technique and the EAS technique with inexact solutions of the reduced subproblems. As an important application, we apply the AS technique and the EAS technique on the convex clustering model, which could accelerate the state-of-the-art algorithm SSNAL by more than 7 times and the algorithm ADMM by more than 14 times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。