A smoothing alternating minimization-based algorithm for clustering with sum-min of duclidean norms

MaRDI QIDQ5146243zbMATH OpenFDO

Authors Shoham Sabach, Marc Teboulle, Sergey Voldman

Publication date 25 January 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/Pafa/vol3/pafav3n4p653.pdf

zbMATH Keywords

clusteringsmoothingglobal convergencegradient methodsalternating minimizationsemialgebraic functionsnonconvex-nonsmooth minimizationKurdyka-Lojasiewisz property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Inverse problems in optimal control (49N45)

Recommendations

• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• An algorithm for minimizing clustering functions
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• The hyperbolic smoothing clustering method
• On the solution of min-sum-min problems

Cited in

(5)

• Qualitative properties of k-center problems
• Local solutions of the multi-source Weber problem
• Local versions of sum-of-norms clustering
• Non-convex split Feasibility problems: models, algorithms and theory
• A semi-alternating algorithm for solving nonconvex split equality problems

This page was built for publication: A smoothing alternating minimization-based algorithm for clustering with sum-min of duclidean norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146243)