As per title: I have a convex payoff (finance) to approximate with available instruments traded.
I want to minimize $Ax-b$
s.t. $x>0$ and $Ax\ge b$
$A$ is a $n \times k$ matrix
$b$ is a $n \times 1$ vector
$x$ is a $k \times 1$ vector
$n > k $ always.
I cannot use least square error because in some parts $Ax$ would be lower than $b$ and this cannot happen.
I would use Matlab to solve for this, but I am struggling to find a solution (that is not the LSE...) and I do not know what is the best optimisation tool to use to solve it and how to input...
I am not expert about the topic, I was not able to find a similar question.
Thanks a lot
