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.
On the computation of the least distance from a polyhedral convex set
1980
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_421699-doc_149777.pdf
accesso aperto
Descrizione: On the computation of the least distance from a polyhedral convex set
Dimensione
3.48 MB
Formato
Adobe PDF
|
3.48 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
