Qualitative properties of the minimum sum-of-squares clustering problem

DOI10.1080/02331934.2020.1778685zbMath1444.68155arXiv1810.02057OpenAlexW3036350659MaRDI QIDQ5121778

Tran Hung Cuong, Jen-Chih Yao, Nguyen Dong Yen

Publication date: 19 September 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.02057

zbMATH Keywords

global solutionsclustering problemlocal solutionsstability propertiessolution existenceattraction sets

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems ⋮ Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications ⋮ Strong convergence theorems for solving pseudo-monotone variational inequality problems and applications ⋮ Revisiting subgradient extragradient methods for solving variational inequalities ⋮ Existence of solution to n-person noncooperative games and minimax regret equilibria with set payoffs ⋮ Quantitative stability of two-stage stochastic linear variational inequality problems with fixed recourse ⋮ Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem ⋮ A hierarchical variational inequality problem for generalized demimetric mappings with applications ⋮ Stability and convergence analysis for set-valued extended generalized nonlinear mixed variational inequality problems and generalized resolvent dynamical systems ⋮ An implicit algorithm for finding a fixed point of a \(Q\)-nonexpansive mapping in locally convex spaces ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems ⋮ Implicit viscosity iterative algorithm for nonexpansive mapping on Hadamard manifolds ⋮ An inertial subgradient extragradient algorithm for modified variational inclusion problem and mixed equilibrium problem in real Hilbert space ⋮ Inertial Mann-type iterative method for solving split monotone variational inclusion problem with applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two Inertial extragradient viscosity algorithms for solving variational inequality and fixed point problems ⋮ An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems ⋮ A parameterized three-operator splitting algorithm and its expansion ⋮ Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings ⋮ On generalized common quasi-eigenvector problems ⋮ On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ SELF ADAPTIVE VISCOSITY-TYPE INERTIAL EXTRAGRADIENT ALGORITHMS FOR SOLVING VARIATIONAL INEQUALITIES WITH APPLICATIONS ⋮ Two projection-based methods for bilevel pseudomonotone variational inequalities involving non-Lipschitz operators ⋮ Improved inertial projection and contraction method for solving pseudomonotone variational inequality problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ ACCELERATED PROJECTION-BASED FORWARD-BACKWARD SPLITTING ALGORITHMS FOR MONOTONE INCLUSION PROBLEMS ⋮ Strong convergence of inertial forward–backward methods for solving monotone inclusions

Cites Work

• On the problem of minimizing a difference of polyhedral convex functions under linear constraints
• The planar \(k\)-means problem is NP-hard
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• NP-hardness of Euclidean sum-of-squares clustering
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• Quadratic programming and affine variational inequalities. A qualitative study.
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• A new efficient algorithm based on DC programming and DCA for clustering
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• A global optimization RLT-based approach for solving the hard clustering problem
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Nonlinear Programming
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item