[Numpy-discussion] hairy optimization problem

Mathew Yeates myeates@jpl.nasa....
Thu May 7 09:05:04 CDT 2009


Sebastian Walter wrote:
> N optimization problems. This is very unusual! Typically the problem
> at hand can be formulated as *one* optimization problem.
>
>   
yes, this is really not so much an optimization problem as it is a 
vectorization problem.
I am trying to avoid
1) Evaluate f over and over and find the maximum in the first column. 
Store solution 1.
2) Evaluate f over and over and find the max in the second column. Store 
solution 2.
Rinse, Repeat


More information about the Numpy-discussion mailing list