A global optimization RLT-based approach for solving the hard clustering problem
From MaRDI portal
Publication:2576449
DOI10.1007/s10898-004-2706-7zbMath1123.62045OpenAlexW2038320188MaRDI QIDQ2576449
Jitamitra Desai, Hanif D. Sherali
Publication date: 13 December 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-2706-7
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
A review of recent advances in global optimization, Large-scale pickup and delivery work area design, Application of the cross-entropy method to clustering and vector quantization, \(\alpha\)-concave hull, a generalization of convex hull, Local search for constrained graph clustering in biological networks, An exact algorithm for semi-supervised minimum sum-of-squares clustering, SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering, New and efficient DCA based algorithms for minimum sum-of-squares clustering, A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning, Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, Qualitative properties of the minimum sum-of-squares clustering problem, Global minimization using an augmented Lagrangian method with variable lower-level constraints, An efficient algorithm for maximal margin clustering, An improved column generation algorithm for minimum sum-of-squares clustering, A heuristic algorithm for solving the minimum sum-of-squares clustering problems, Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, A global optimization RLT-based approach for solving the fuzzy clustering problem, K-means clustering via a nonconvex optimization approach
Uses Software
Cites Work
- Experiments in projection and clustering by simulated annealing
- A lower bound on the complexity of the convex hull problem for simple polyhedra
- On the convex hull of the union of certain polyhedra
- A cutting plane algorithm for a clustering problem
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A comparison of SOM neural network and hierarchical clustering methods
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- Improving Discrete Model Representations via Symmetry Considerations
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cluster Analysis: An Application of Lagrangian Relaxation
- A Branch and Bound Clustering Algorithm
- A Dynamic Programming Algorithm for Cluster Analysis
- Cluster Analysis and Mathematical Programming
- Unnamed Item
