Ask an optimization problem (important)# Computation - 科学计算
l*e
1 楼
Hi, All:
I came up with an optimization problem min f(x)= 1/2 x' H x- abs(x) subject
to -c<=x<=c, and sum(x)=0. Here, H is a matrix, x is vector, c is bound.
It looks like quadratic programming. But not really.
I tried the "fmincon" in the optimzation toolbox of Matlab, but it can't
find a statisfactory solution. The problem is not convex ( I think), but
some optimization method should reach a good minima.
Anyone can help? Please! If anyone can solve this, it could be used in a
wonderful
I came up with an optimization problem min f(x)= 1/2 x' H x- abs(x) subject
to -c<=x<=c, and sum(x)=0. Here, H is a matrix, x is vector, c is bound.
It looks like quadratic programming. But not really.
I tried the "fmincon" in the optimzation toolbox of Matlab, but it can't
find a statisfactory solution. The problem is not convex ( I think), but
some optimization method should reach a good minima.
Anyone can help? Please! If anyone can solve this, it could be used in a
wonderful