METHOD FOR CLUSTERING DATA BASED CONVEX OPTIMIZATION

摘要

A method for clustering data based convex optimization is provided. The method includes the steps of: obtaining an optimal feasible solution that satisfies given strong duality using convex optimization for an objective function; and clustering data by extracting eigenvalue from the obtained optimal feasible solution.