Where can we read more about protein folding as an optimization problem?
In graphics is the local minimum usually preferred to improve performance or are there any circumstance where we must use the global minimum
^ I also feel like it doesn't make sense to look for local minimum in graphics, because in the worst case it could cause a lot of extra computation. But then, would we have to balance how much computation a bad local minimum could cause, versus the amount of extra computation it would take to ensure our minimum is global?
Does finding a local minimum translate to algorithms for findign global minima? In other words, is there some sort of algorithmic process that can "hop" between local minima in a meaningful sort of way, or would one have to repeat something like gradient descent?