need help: non-linear optimization with linear constraint.
- From: jiapu.mail@xxxxxxxxx
- Date: Tue, 28 Feb 2006 14:30:13 +0000 (UTC)
I am totally new to the field of linear/nonlinear programming. I only
have a rough idea about some basic concepts.
The funtion (about 100 variables) to be minimized doesn't have a close
form. And evaluating it requires some sort of simulation. In another
word, first derivative is not avaiable. There are some linear
constraints on those variables.
Based on my readings, the simple solutions are simplex method or
Powell's method. However, I haven't found any material on how to
handle constraint in those methods.
So, any suggestion, any pointer to readings or implementation will be
helpful. Thanks.
.
- Prev by Date: Cut-off phenomenon in random walks
- Next by Date: Re: Classification of algebraic extensions of Z/p
- Previous by thread: Cut-off phenomenon in random walks
- Next by thread: A question to Siegel's Lemma/Minkowski's Second Convex Body Theorem
- Index(es):
Relevant Pages
|
|