cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope.
Dimitrios ChamzasConstantinos ChamzasKonstantinos MoustakasPublished in: CoRR (2020)
Keyphrases
- convex hull
- semidefinite
- multi dimensional
- corner detection
- feature points
- convex optimization
- lattice points
- convex sets
- stable set
- convex relaxation
- directed graph
- piecewise linear
- corner detectors
- facet defining inequalities
- data sets
- smooth curves
- planar curves
- semidefinite programming
- random walk
- sufficient conditions
- learning algorithm