A Parallel probabilistic algorithm to find "all" vertices of a polytope

Ivan Lavallee 1 Pham Canh Duong
1 ParaDis
INRIA Rocquencourt
Abstract : This paper presents a new parallel algorithm to find all vertices of a convex polytope. This algorithm is of Monte-Carlo type and requires no assumption of problem nondegeneracy. Redundant constraints have no influence on the main computation. The vertex locating routine uses a new algorithm for nearest point problem in polytopes.
Type de document :
Rapport
[Research Report] RR-1813, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00074859
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:35:35
Dernière modification le : vendredi 16 septembre 2016 - 15:11:56
Document(s) archivé(s) le : mardi 12 avril 2011 - 19:47:02

Fichiers

Identifiants

  • HAL Id : inria-00074859, version 1

Collections

Citation

Ivan Lavallee, Pham Canh Duong. A Parallel probabilistic algorithm to find "all" vertices of a polytope. [Research Report] RR-1813, INRIA. 1992. 〈inria-00074859〉

Partager

Métriques

Consultations de la notice

207

Téléchargements de fichiers

82