"one of the variables cannot be constrained by a fixed value. This value changes with another variables."
It is called nonlinear constraint: x>=f(y), and usually you can't use boundary constrained code to solve such problems. You may try one of the variants proposed above by you, but all of them have some pitfalls, either subtle or clearly visible. Say, returning +INF will just force algorithm to stop as soon as it will meet the boundary of the feasible area - to stop at the boundary instead of moving along the boundary.
If you want, you may use Levenberg-Marquardt as underlying optimizer for penalty function / barrier function / Augmented Lagrangian method, it should work for you.
|