- #1

- 8

- 0

Can any one tell me how to find the minimal L1 norm solution to the problem Ax=b using a linear programming method possibly the simplex search??

Any links where I can find something ??

Khan.

- Thread starter umarkhan
- Start date

- #1

- 8

- 0

Can any one tell me how to find the minimal L1 norm solution to the problem Ax=b using a linear programming method possibly the simplex search??

Any links where I can find something ??

Khan.

- #2

- 47

- 0

http://reference.wolfram.com/mathematica/tutorial/ConstrainedOptimizationLinearProgramming.html

Take a look at the paragraph

Cheers

blue2script

- #3

- 8

- 0

Thanks for the link. I tried some thing similar for the system x1 + x2 = 1. I converted to linear programming problem and then used linprog from matlab. The trick is to to put the L1 norm minimization in the for of two inequalities for each variable.

f=[1 1 0 0 ]';

A=[-1 0 -1 0;

-1 0 1 0;

0 -1 0 -1;

0 -1 0 1];

b=[0 0 0 0]';

Aeq=[0 0 1 1];

beq=[1];

[x,fval,exitflag,output,lambda] =linprog(f,A,b,Aeq,beq,[0 0 -10 -10]',[1e10 1e10 10 10 ])

- Last Post

- Replies
- 5

- Views
- 6K

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 2

- Views
- 2K

- Replies
- 10

- Views
- 7K

- Last Post

- Replies
- 2

- Views
- 515

- Last Post

- Replies
- 10

- Views
- 4K

- Last Post

- Replies
- 1

- Views
- 8K

- Last Post

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 5

- Views
- 2K

- Last Post

- Replies
- 2

- Views
- 18K