Steve Jacobsen (jacobsen@ee.ucla.edu), Khosrow Moshirvaziri (moshir@ee.ucla.edu) LINEAR REVERSE CONVEX MINIMIZATION PROBLEM (m=15, n=10): min cx Ax < b x > 0 g(x) < 0 where g(x) = xQx + rx + s, and g is concave. A,b = -6 -2 -3 5 -0 7 7 9 4 2 41 -9 4 3 -0 -5 -7 -2 5 9 9 24 4 2 5 -5 -8 -10 7 1 -5 1 9 4 9 10 -5 9 4 -5 8 -6 -7 38 9 7 -3 -3 -9 7 -2 2 -4 10 34 -2 1 -5 -7 0 3 1 7 8 -2 21 0 -8 10 -0 -2 5 -1 -7 3 -7 10 7 3 4 8 -4 5 -4 -6 -7 1 24 -9 -2 5 8 8 10 -6 4 4 -5 35 -9 4 3 -9 1 8 -7 -7 -2 -0 -1 1 8 -9 8 -1 -5 1 -8 -2 -1 11 3 5 3 0 9 -4 6 -5 -0 9 45 -10 -5 8 0 -9 -3 -9 -10 -7 -7 -34 -2 -9 -5 -4 5 0 1 -2 2 -6 -1 6 1 7 6 8 3 5 4 2 0 610 c= -1 -7 9 -2 -7 8 -8 -7 -9 -3 Q= -197 -160 -60 -3 40 -41 83 76 142 -90 -160 -282 38 -19 -92 27 -10 -17 56 -62 -60 38 -330 79 -74 -108 149 18 191 83 -3 -19 79 -240 44 43 -51 148 48 -35 40 -92 -74 44 -309 134 -98 -90 -75 54 -41 27 -108 43 134 -254 95 -104 97 -0 83 -10 149 -51 -98 95 -196 -68 -172 -100 76 -17 18 148 -90 -104 -68 -372 -157 54 142 56 191 48 -75 97 -172 -157 -266 -16 -90 -62 83 -35 54 -0 -100 54 -16 -250 r= 4.411978811294546e+02 2.239379292129644e+03 -2.283822528825278e+03 6.802756615380547e+02 2.169408442339402e+03 -1.508812643865129e+03 2.767460987565179e+03 2.149240920515768e+03 2.527069714240320e+03 1.722284730252099e+03 s= -1.670522671639838e+04 optimal x = 6.775140339043996E+00 2.721330851436755E+00 1.644755784610632E+00 4.299587490068864E+00 9.479278116362500E-01 0.000000000000000E+00 2.505148917890884E+00 3.485717288043849E+00 5.405583905748595E+00 0.000000000000000E+00