Steve Jacobsen (jacobsen@ee.ucla.edu), Khosrow Moshirvaziri (moshir@ee.ucla.edu)
LINEAR REVERSE CONVEX MINIMIZATION PROBLEM (m=21, n=10):

min cx
   Ax < b
    x > 0
   g(x) < 0 
   
   where
   
    g(x) = -x'x + (sum(j,sqrt(x(j)))**1.5 + d'x + g0
    
A,b =
  -8   -2     3    -1     3     3     1   -10     1      9          6 
   3   -2    -8     5    -5    -6    -4     5    -1     -8        -15 
  -8   -4    -1    -3    -2    -5     1    10    -0     -9        -14 
   4    2    -7     1     2     6    -7    -8    -4     -5        -10 
  -3   -2    -4    -9     2     3     7     2    -4      9          6 
  -5    9     3    -0    -7    -5     3     8    -7      5         10 
  -5   -3    10     4     6     6     2     9     9     -7         38 
   2    3    -1    -3     8     9     4     2    -4      7         34 
  -2    7    -2    -2   -10     4     8     6     4     -2         18 
  -7    8     8    10     3    -3    -3     2     7     -7         24 
   3    3    -6     7    -7    -4     7     4    -4      4         13 
  10    0    -3    -6    -5    -6    -8     5     5      8          5 
   7    4     2    -1     3    -1    -8    -5    10      4         20 
  -4   -9    -5     2    -3     4     5    -2     7     -5         -4 
  -2   -9    -7     2    -9    -7     1     3    -4     -4        -31 
  -8   -1     1    -3    -1     4    -9    -3     2     -0        -11 
   7    9     2     3    -2    -0    -0     2    -6      0         21 
   0   -1     4    -2     4     3     8     0     8     -8         23 
   9  -10    -9     3    -7     2    -8    -8    -4     -8        -34 
   5    3     8     8     5     1     2     8     5      8        590 
-305 -230  -100    -0   -79   100   -44  -124  -205   -153       1000 

c =
 -7
  9
  0
 -2
 -3
  8
  2
 -1
 -0
 -9
    
d =
  5.464583517687990e+01 
 -7.728292350030387e+01
 -6.269320952429332e+00
  1.995095946893027e+01
  1.681912863110777e+01 
 -6.253291884255700e+01 
 -1.599924730852873e+01
  1.946675106791899e+01 
 -1.246943348261322e+01
  4.576879097305010e+01


g0 =-2.205204330268671e+02


optimal x =
   2.252817130973334e+00
   2.199266505103090e-01
   2.804880543198247e+00
   1.395598216726147e+00
   1.704413343422612e+00
   0.0                  
   2.247260087083443e+00
   9.599676531088815e-01
   8.427873545589306e-01
   2.093303999457479e+00