Hello,

I was wondering if there is a way ( I mean a “Disciplined Convex” way) to minimize or fix the dynamic range ratio of the solution vector.

For example:

```
cvx_begin
variable x(n)
minimize( norm(A*x-b) )
subject to
max(x)/min(x)< alpha %this is not disciplined convex programming
cvx_end
```

Thanks in advance,

Ignacio

mcg
(Michael C. Grant)
2
If `min(x)`

is positive, you can do this:

`max(x) <= min(x) * alpha`

Ignacio
3
thanks mcg,

no, unfortunately it is not positive. It can have positive and negative values. And if I try to do :

```
max(abs(x)) <= min(abs(x)) * alpha
```

I get the error message that it is not disciplined convex.

Any other ideas?

Thanks again

mcg
(Michael C. Grant)
4
Unfortunately not, because the problem is not convex in your case. CVX cannot solve it.