The solution of the convex combination problem (Q1802612)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The solution of the convex combination problem |
scientific article; zbMATH DE number 205035
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The solution of the convex combination problem |
scientific article; zbMATH DE number 205035 |
Statements
The solution of the convex combination problem (English)
0 references
11 August 1993
0 references
The paper presents an algorithm for the solution of the following problem: given points \(x_ 1,x_ 2,\dots,x_ k\) and \(x\) in a \(k\)- dimensional space, determine the set of all coefficients (in \(n\)- dimensional space) of convex combinations of \(x_ 1,\dots,x_ k\) giving \(x\). This set is equal to the convex combination of so-called simplicial solutions. The efficiency of the algorithm is also studied.
0 references
simplicial solutions
0 references
