The solution of the convex combination problem

MaRDI QIDQ1802612zbMATH OpenFDO

Authors Alexander G. Kolpakov

Publication date 11 August 1993

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

simplicial solutions

Mathematics Subject Classification ID

Convex programming (90C25)

Review text

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.

Recommendations

• Discrete problem of convex combinations and its applications
• scientific article; zbMATH DE number 724218
• An algorithm of simplex imbeddings in convex programming
• A method for approximating the solution set of a system of convex inequalities by polytopes
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)

Cited in

(3)

• The problem of designing laminated plates with specified stiffnesses.
• New algorithm for the conical combination representation problem of a vector
• Discrete problem of convex combinations and its applications

This page was built for publication: The solution of the convex combination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802612)