search for: opimizing

hi, i want to execute the following opimization problem: max r*w s.t.: w*z=1 # sum of w is 1 r, w are [nx1] vectors, z is a [nx1] vector consisting of 1 so far so good, works fine with lp the problem arises with the additional restriction w' * V * w where V is a [nxn] matrix how can i include this restriction since w arises twice? thanks, gg --

Hello, I have a system of quadratic equations (results of a Hamiltonian optimization) which I need to find the roots for. Is there a package and/or function which will find the roots for a quadratic system? Note that I am not opimizing, but rather solving the first order conditions which come from a Hamiltonian. I am basically looking for something in R that will do the same thing as fsolve in Matlab. Thanks, John. ============================================== Dr. John Janmaat Department of Economics Acadia University Tel: 9...

In the documentation, it says that optimize "should only be called when the index will no longer be updated very often, but will be read a lot". Does this mean it actually has a detrimental impact on updates and inserts? In my project there will be many more reads than updates, but there will still be a lot of updates. So should I be calling Optimize once a day or something like that,

Hi, I was wondering if someone could give a brief, big picture overview of the difference between the two optimization functions nlm and nlminb. I'm not familiar with PORT routines, so I was hoping someone could give an explanation. Thanks, Angelo _________________________________________________________________ Instantly invite friends from Facebook and other social networks to join yo

On Thu, 9 Dec 2004, Iman Narasamdya wrote: > Hello, > > Couple of months ago you informed me about LLVM. At that time, I was focusing > my research on GCC RTL. > > I just started looking into LLVM, and I have some questions: > - When the documentation mention IR, does it refer to LLVM assembly language > or to LLVM bytecode? Both. They are semantically equivalent. In

...16 0 43428 23m 3908 S 0.0 2.3 0: 03.1 mongrel_rails > 3961 root 16 0 10012 8964 588 S 0.0 0.9 0:03.51 memcached > 22728 www-data16 0 13536 7536 2620 S 0.0 0.7 0:00.10 httpd > 22379 flipl 16 0 11980 7208 3060 S 0.0 0.7 0: 01.7 emacs We are in process of opimizing our code.And we are concentrating on: 1. Removing unnecessary instance variables 2. Removal of Components( We have only one component left in entire application) 3. Mysql query optimisation, but I am afraid our app, as i said before doesn''t depend so much on databases, if you ignore basic...

Hi Devs, consider below testcase $cat test.cpp constexpr int product() { return 10*20; } int main() { const int x = product(); return 0; } $./clang test.cpp -std=c++11 -S $./clang -v clang version 9.0.0 Target: x86_64-unknown-linux-gnu $cat test.s main: .cfi_startproc # %bb.0: pushq %rbp .cfi_def_cfa_offset 16 .cfi_offset %rbp, -16 movq

Hi Nate! I don't see how that would work. Select doesn't work per element. Say we're trying to vectorize the following C++ code: if(v[0] < 0) v[0] += 1.0f; if(v[1] < 0) v[1] += 1.0f; if(v[2] < 0) v[2] += 1.0f; if(v[3] < 0) v[3] += 1.0f; With SSE assembly this would be as simple as: movaps xmm1, xmm0 // v in xmm0 cmpltps xmm1, zero // zero =