Hello guys, im news here…and i need help
I am working on a wireless communication optimization problem that includes a nonlinear constraint. To handle this, I use fractional programming techniques such as Dinkelbach’s method, as well as the arithmetic-geometric mean (AGM) approach to linearize the constraint.
The problem solves correctly for SNR values in the range of 50–60 dB and produces valid results. However, when the SNR increases beyond this range, the optimization sometimes returns NaN, a numeric value, or -Inf. I am not sure where the issue is coming from.
Could you please help me identify the cause of this behavior?
Here is the part of the code that represents the optimization problem, i used AGM here:
You should look at the solver and CVX output and optimal variable values after each iteration, and see what the resulting inputs are for the next iteration. Perhaps the optimal values, and therefore input values for the next iteration, are getting wilder and wilder with each successive iteration, until eventually, failure occurs for some reason.
You should look at the stated reason for failure. It might be that he problem is assessed infeasible, or unbounded, or the solver had numerical difficulties.
It may be that (with your starting values), you are getting 'lucky" for certain values of SNR, and not getting lucky for high values.
If the input numbers become very large, that could result in numerical difficulties, or failure for a variety of reasons. You should look at the solver and CVX output.
In any event, your algorithm might be diverging, as I warned is possible.