Search Results for author:
Found 5 papers, 2 papers with code
An implementation of steepest-descent augmentation for linear programs
Generalizing the simplex method, circuit augmentation schemes for linear programs follow circuit directions through the interior of the underlying polyhedron.
Optimization and Control 52B05, 90C05, 90C08, 90C10
Constructing Clustering Transformations
Clustering is one of the fundamental tasks in data analytics and machine learning.
A Polyhedral Model for Enumeration and Optimization over the Set of Circuits
In this paper, we provide a universal framework for enumerating the set of circuits and optimizing over sets of circuits of a polyhedron in any representation - we propose a polyhedral model in which the circuits of the original polyhedron are encoded as extreme rays or vertices.
Optimization and Control 52B05, 90C05, 90C08, 90C10
A balanced k-means algorithm for weighted point sets
In this paper, we present and analyze a generalization of $k$-means that is capable of handling weighted point sets and prescribed lower and upper bounds on the cluster sizes.
On Soft Power Diagrams
For this purpose, we devise a new model for the computation of a 'soft power diagram', which allows a soft separation of the clusters with 'point counting properties'; e. g. we are able to prescribe how many points we want to classify as outliers.
