title: Algorithm for Solving a Linear Combination?
body: <p>I have run into the following problem that I need to solve in a project that I'm working on:</p>
  
  <p>Given some number of vectors v_i (in the math sense), and a target vector H, compute a linear combination of the vectors v_i that most closely matches the target vector H, with the constraint that the coefficients must be in [0, 1].</p>
  
  <p>I do not know much about what kind of algorithms / math should be used to approach such a problem. Any prods in the right general direction would be much appreciated!</p>