« first day (3561 days earlier)      last day (920 days later) » 

8:13 AM
@CarlLange :facepalm:
 
 
2 hours later…
10:13 AM
I am looking to minimize a black-box vector function f. It has a real vector input of high dimension (on the order of 100 - 1000) and a scalar output. It's implemented as a compiled function for efficiency.
FindMinimum does indeed work with vector functions, FindMinimum[f[x], {x, init}] where init has the same dimension as x, indicating to FindMinimum that x is a vector.
But now I would like to constrain some of the components of the vector x. They must not change from their initial value. I want to be able to easily adjust which components to fix. What is a good solution for this that is easy to write and does not compromise performance?
I can do something like FindMinimum[{f[x], Indexed[x, i] == init[[i]], ...}, ...] for many different i, but this seems like a pain and I think it does affect performance.
 
10:36 AM
I'll post a main-site question.
 
10:57 AM
0
Q: Efficient multidimensional optimization while constraining some coordinates

SzabolcsI have a function f[x] with a high-dimensional vector input and a scalar output. I am looking to minimize this function while constraining some of the components of x. What is an efficient way of doing this? My key concern is efficiency. A trivial example FindMinimum[{Norm[x], Indexed[x, 1] == 1...

 
Definitely don't have the knowledge to help you, but kudos on the great question!
 

« first day (3561 days earlier)      last day (920 days later) »