Re: bp(eye(n),ones(1,n),1,zeros(1,n),0) gives infeasible primal!!!

[Carlos E Murillo-Sanchez]

Hi;

I'm sorry that it has taken this long for me to reply; I've
been away.

The documentation should be clearer in saying that matrices Q and A
are supposed to be sparse.  The following minimizes the
sum of squares subject to the sum of variables being equal
to one and all variables in [0,1] .

>>n=5;[x,y,s,w,how]=bp(sparse(eye(n)),sparse(ones(1,n)),1,zeros(1,n),0,1:n,zeros(1,n),1:n,ones(1,n),[],0)

x =

    0.2000
    0.2000
    0.2000
    0.2000
    0.2000


y =

    0.2000


s =

     0


w =

  1.0e-010 *

    0.1866
    0.1866
    0.1866
    0.1866
    0.1866


how =

optimal solution


Hossein Mobahi wrote:

Hello,

I just installed BPMPD_MEX 2.21.1 and tested the
following line

[x,y,s,w,how]=bp([],ones(1,n),1,ones(1,n),0,1:n,zeros(1,n),1:n,ones(1,n))

and varaible "how" was set to 'infeasible primal'. I
think something is wrong with the solver. This test
simply says given n variables bounded between 0 and
one, minmize their sum of squares, when the sum of
vars is equal to one.

Your help would be appreciated!

THanks

H.M.