A fast algorithm for nonsmooth penalized clustering
Sign Up to like & getrecommendations! Published in 2018 at "Neurocomputing"
DOI: 10.1016/j.neucom.2017.08.048
Abstract: Abstract As a novel framework of clustering analysis, penalized clustering is able to learn the number of clusters automatically, and therefore has aroused widespread interest recently. To address the computational difficulties arising from the nonsmoothness… read more here.
Keywords: algorithm nonsmooth; fast algorithm; nonsmooth penalized; penalized clustering ... See more keywords
A Distributed Continuous-Time Algorithm for Nonsmooth Constrained Optimization
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2020.2965905
Abstract: This article studies a distributed convex optimization problem with nonsmooth local objective functions subject to local inequality constraints and a coupled equality constraint. By combining the dual decomposition technique and subgradient flow method, a new… read more here.
Keywords: optimization; time; distributed continuous; algorithm nonsmooth ... See more keywords