A dual reformulation and solution framework for regularized convex clustering problems
European Journal of Operational Research(2021)
摘要
•We derive the dual optimization form for regularized convex clustering problems.•Embedding a projection operator and a proximal operator in fast gradient methods.•A general framework is developed for convex/co-convex clustering with regularization.•Develop and analyze algorithms with other co-clustering algorithms.
更多查看译文
关键词
Global optimization,Convex clustering,Mathematical programming,Gradient descent,Duality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络