A two-phase heuristic for the bottleneck k-hyperplane clustering problem

DOI10.1007/S10589-013-9567-2MaRDI QIDQ2636610zbMATH OpenOpenAlexFDO

Authors E. Amaldi, Kanika Dhyani, Leo Liberti

Publication date 30 January 2014

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-013-9567-2

zbMATH Keywords

heuristicsapproximationshyperplane clustering\(k\)-hyperplane center problemhyperplane cover problemmixed-integer nonlinear formulation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Recommendations

• A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• On the multisource hyperplanes location problem to fitting set of points
• Exact \(L_{2}\)-norm plane separation

Cites work

• scientific article; zbMATH DE number 4153914 (Why is no real title available?)
• scientific article; zbMATH DE number 1947381 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• A bilinear algorithm for sparse representations
• A clustering technique for the identification of piecewise affine systems
• Approximation algorithms for projective clustering
• Covering things with things
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Fitting hyperplanes by minimizing orthogonal deviations
• Locating lines and hyperplanes. Theory and algorithms
• Median hyperplanes in normed spaces -- a survey
• On the complexity of locating linear facilities in the plane
• Optimization models and algorithms for the hyperplane clustering problem
• Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Writing global optimization software
• \(k\)-plane clustering

Cited in

(4)

• A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• Optimization models and algorithms for the hyperplane clustering problem
• The equivalence between principal component analysis and nearest flat in the least square sense

Describes a project that uses

Uses Software

• Bonmin
• CPLEX
• AMPL
• SNOPT

This page was built for publication: A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem

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