Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Complexity of multi-minimizer minimization
Replies: 2   Last Post: Mar 19, 2011 10:41 AM

 Messages: [ Previous | Next ]
 Yuly Shipilevsky Posts: 17 Registered: 1/25/05
Re: RE: Complexity of multi-minimizer minimization
Posted: Mar 19, 2011 10:41 AM

Thanks, Ben,

> By "minimizer" do you mean a function, as in l.p.?

No. I mean any point x0 from a feasible region F,
such point that:

f(x0) = min { f(x) } , for all x from some

feasible region F.

> Can we assume each iteration is over a bounded set,
> again similar to l.p.?

Yes.

>it seems we have n minimization problems, each with >respect to a different function f^i, where "^" >indicates a superscript.

We have one minimization of some function f(x),
subject to F, the problem that has several minimizing
points x1, ... , xn:

f(x1) = ... = f(xn) = min{ f(x) } , for all x
from some feasible region F.

Date Subject Author
3/18/11 Yuly Shipilevsky
3/18/11 Ben Brink
3/19/11 Yuly Shipilevsky