A basic algorithm for the minimization of a differentiable convex function (in particular, a strictly convex quadratic function) defined on the convex hull of m points in R n is outlined. Each iteration of the algorithm is implemented in barycentric coordinates, the number of which is equal to...

A basic algorithm for the minimization of a differentiable convex function (in particular, a strictly convex quadratic function) defined on the convex hull of m points in R <Superscript> n </Superscript> is outlined. Each iteration of the algorithm is implemented in barycentric coordinates, the number of which is equal to...</superscript>