Steve Jacobsen (jacobsen@ee.ucla.edu), K. Moshirvaziri (moshir@ee.ucla.edu) CONCAVE MININIMIZATION PROBLEM (m=15, n=10): min f(x) Ax < b x > 0 where f(x) = xQx + rx + s A,b= -1 -6 -6 -0 7 10 7 -0 0 -9 15 2 5 -9 1 -6 -10 -10 -7 5 -10 -27 -1 6 4 6 -1 10 -3 6 5 -5 38 1 -5 4 -4 4 2 8 6 1 9 38 -1 3 5 6 -4 7 6 -5 -10 2 22 -4 -3 5 -6 4 -2 -6 3 -1 4 5 -1 -6 3 -10 -1 -4 -8 1 -4 -4 -22 2 -3 -0 -2 -5 -4 -1 -7 6 9 6 5 1 -0 1 1 -2 -5 3 -4 2 12 2 1 -9 7 -2 -5 10 -3 -4 -8 0 4 -10 -4 -9 6 9 8 -5 -2 -2 5 -9 4 -9 5 9 -0 -6 3 -2 5 13 -5 -3 -0 1 -5 -8 4 2 -2 -4 -6 9 -7 9 -0 3 -4 -10 1 3 2 18 8 6 4 0 8 1 4 2 1 3 500 r= 9.647411705412013e+01 4.424846072078486e+02 1.332550873230408e+03 -6.261294303205964e+02 -7.010136636144778e+02 4.571205768581691e+02 2.300515184988217e+02 6.556814241829683e+02 1.217309906426911e+02 2.774373957209556e+02 s= -4.548538035451575e+03 Q= -174 108 -150 45 70 72 14 38 -45 2 108 -172 68 -89 40 -25 41 -29 26 50 -150 68 -311 100 66 3 148 -57 -105 -115 45 -89 100 -130 -19 -25 8 -20 24 115 70 40 66 -19 -185 -86 15 -89 32 -0 72 -25 3 -25 -86 -262 -50 -111 -36 126 14 41 148 8 15 -50 -359 21 71 115 38 -29 -57 -20 -89 -111 21 -141 -3 -2 -45 26 -105 24 32 -36 71 -3 -91 -66 2 50 -115 115 -0 126 115 -2 -66 -361 best found x = 0.000000000000000E+00 3.086167263179158E-01 2.239151964447783E+00 3.848761830085436E+00 3.300233287632746E+00 0.000000000000000E+00 2.398617798097466E+00 0.000000000000000E+00 3.986302103311398E+00 1.067260606168673E+00