PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Arioli M., Laratta A., Menchi O. On the computation of the least distance from a polyhedral convex set. Internal note IEI-B80-29, 1980.
 
 
Abstract
(English)
Some active set methods for computing the least distance of a point from a polyhedral convex set are presented, which are based on orthogonal an Gauss-Jordan-Like tranformations. The applicability and reliability of theese methods are examined and numerical experiments are made on a large number of randomly generated test problemns, plotting the obtained results.
Subject Polyedral convex set


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional