Probability-one homotopy methods for constrained clustering

DOI10.1016/j.cam.2018.04.035zbMath1478.62162OpenAlexW2805707435WikidataQ129828140 ScholiaQ129828140MaRDI QIDQ1643878

Naren Ramakrishnan, Layne T. Watson, David R. Easterling

Publication date: 20 June 2018

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2018.04.035

zbMATH Keywords

homotopy algorithmmultiobjectiveconstrained clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multi-objective and goal programming (90C29) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (2)

Unnamed Item ⋮ A TFC-based homotopy continuation algorithm with application to dynamics and control problems

Uses Software

• HOMPACK90
• UCI-ml
• HOMPACK

Cites Work

• Unnamed Item
• A globally convergent algorithm for computing fixed points of \(C^2\) maps
• Probability-one homotopies in computational science
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• Algorithm 652
• Constrained Clustering
• A discriminative model for semi-supervised learning
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Solving the Nonlinear Complementarity Problem by a Homotopy Method
• Algorithm 777: HOMPACK90
• Constraint qualifications in maximization problems
• Duality in nonlinear programming
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: Probability-one homotopy methods for constrained clustering