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= -8 -8 3 3 -1 -3 -7 -5 1 -9 -22 3 7 0 10 5 3 -5 6 -4 0 35 -8 0 4 -1 -3 -2 3 9 1 8 23 4 9 -9 -2 1 3 -3 4 -7 -8 3 -3 -1 -9 8 -9 -2 -9 -3 7 0 -10 -5 -2 -1 -6 0 3 -1 -4 3 -10 -12 -5 -2 9 -3 4 -5 -2 -6 2 5 9 2 -4 -1 2 -3 -2 4 -1 4 10 22 -2 2 -10 -5 -2 2 -7 4 8 -8 -7 -7 -2 4 -7 10 2 -8 -7 -3 2 -6 3 9 3 1 7 -7 3 4 7 8 49 10 -3 -8 2 -6 6 -6 0 -8 9 8 7 3 -1 4 -1 8 -5 3 -8 2 23 -4 7 -7 -9 2 -10 6 2 5 6 10 7 7 3 4 6 4 6 5 1 6 610 r= 2.189627048323297e+03 2.185619749224909e+03 -1.218665163328876e+03 -2.617534068653287e+02 1.783267894568071e+02 7.788557308989739e+02 1.681199368616444e+03 1.697724688785476e+03 -1.269726498058059e+02 1.788249065044075e+03 s= -1.259283255664188e+04 Q= -112 -114 62 -28 -18 -33 -68 -98 1 -91 -114 -215 11 -53 -110 0 -36 -134 -7 -94 62 11 -100 17 -57 73 34 56 -38 -32 -28 -53 17 -123 -36 -25 54 -65 28 14 -18 -110 -57 -36 -100 45 17 -42 -24 -55 -33 0 73 -25 45 -96 13 -37 82 74 -68 -36 34 54 17 13 -103 -25 -46 -117 -98 -134 56 -65 -42 -37 -25 -115 17 -37 1 -7 -38 28 -24 82 -46 17 -87 -97 -91 -94 -32 14 -55 74 -117 -37 -97 -271 best found x= 0 0 2.953041740674958e+00 5.002183244523387e+00 2.792665778567200e+00 3.463587921847273e-01 6.004847542924811e+00 0 0 0