Given a bunch of affine equations and convex inequalities, how to efficiently determine whether these convex constraints have nonempty feasible region? If nonempty, just need to return one feasible point.
Just need to tell me the name of this algorithm or the terminology of this problem. Thank you!