My objective function is a sum of n quadratic over linear terms. Here is how the problem looks like:
I know that the denominators of each of these n terms is positive and m<<n. I am trying to represent this objective function in CVXR. Is it possible to do this in CVXR? Thank you!
I doubt that that function is convex but you can try implementing it with CVXR and it will tell you if it is not.
At any rate we can do it with a general nonlinear optimizer such as
optim. Define a functionontofthat maps R^m onto the feasible region and then we can implement it as below. Try it from multiple starting points just to be sure.