A Parallel probabilistic algorithm to find "all" vertices of a polytope - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

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

Ivan Lavallee
  • Function : Author
Pham Canh Duong
  • Function : Author

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1813.pdf (545.16 Ko) Télécharger le fichier

Dates and versions

inria-00074859 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074859 , version 1

Cite

Ivan Lavallee, Pham Canh Duong. A Parallel probabilistic algorithm to find "all" vertices of a polytope. [Research Report] RR-1813, INRIA. 1992. ⟨inria-00074859⟩
86 View
38 Download

Share

Gmail Facebook Twitter LinkedIn More