I have found many related optimization references, but there were no method or enlightments for my specific optimization problems.
known： D, W, P_max, h_j, T_k, \sigma_u.
Unknown: p_k. k=1,2,3,...K. (for example, K=3 users)
Here, I intend to find the optimization variables of $\mathbf p = [p_1, p_k, ..., p_K]^{T}$。
Hope for some suggestions or enlightments from convex optimization researchers.
Thanks a lot!
I think you can apply the same optimization algorithms for log as well. As the log is monotonic function and it will not affect by any operation.
You can also update the function. i.e. update the function that not incorporate the log. Optimize without log, then apply log. If you achives the optimization without log, then it will be consistent with log as well.
This is my opinion. Please correct me.
this is nonconvex, what is the dimension of k? how many k's do you have?
This is a bounded variables optimization problem, also the value of the logarithm can be calculated at each k. So you can solve it using WINQSB Solver.
- Badges
- Science topic
- Similar topics
- Computer Communications (Networks)
- Simulators