A question about convex analysis# Computation - 科学计算
h*e
1 楼
Can anybody tell me a fast and robust algorithm to determine whether a
vector point x is inside a cone formed by a set of vector points {x1, x2, ..
., xn}? x1, x2, ..., xn can be linear dependent. Cone is the linear
summation of {x1, x2, ..., xn} with non-negative coefficients.
A similar question is how to determine whether x is inside the convex hull
formed by {x1, x2, ..., xn}.
Thank you.
vector point x is inside a cone formed by a set of vector points {x1, x2, ..
., xn}? x1, x2, ..., xn can be linear dependent. Cone is the linear
summation of {x1, x2, ..., xn} with non-negative coefficients.
A similar question is how to determine whether x is inside the convex hull
formed by {x1, x2, ..., xn}.
Thank you.