More specifically, I have a problem where it is hard to find the optimal solution w.r.t all the parameters together, so I solve it w.r.t one parameter at a time. In each step, I either use the optimal value of other parameters obtained from the previous step or just keep them as variables to be optimized later. I can not prove the convexity / concavity of the problem but can show the objective function to be monotone w.r.t all the parameters. Thanks in Advance.
Asked
Active
Viewed 67 times
1
-
Have a look at this question – David M. Jun 22 '18 at 02:26
-
Thanks David. It is exactly what I am already doing, but the answer doesn't specify when will the solution be equal to the global one? Is there any theorem / result that I can refer to ? – King008 Jun 22 '18 at 02:33
-
Are you sure you're doing that and not coordinate descent? Also, if the objective is monotone then it can't have an optimum except at the boundary, can it? – Jun 22 '18 at 03:22
-
See also https://math.stackexchange.com/questions/453831/optimization-of-a-function-of-two-variables – Chill2Macht Sep 02 '18 at 01:47