Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Complexity of multiminimizer minimization
Posted:
Mar 18, 2011 4:41 PM


If somebody has an experience in minimization where the problem has multiple minimizers.
1. Is it necessary to rerun the same subroutine to find next minimizer and so on, until all minimizers will be computed(one rerun  one minimizer)? If so, is it necessary to use as an input for the next rerun, minimizers, computed at the previous reruns?
2. As a rule, the complexity of minimization is being evaluated per one minimizer. If per one minimizer its polynomialtime, what can we say about total complexity?
Thanks.



