![]() ![]() Objective values that are greater than 12 and less than 17.īisection involves solving a sequence of optimization problems. ![]() Problem.solve(qcp=True, low=12, high=17) would limit the bisection to The keyword arguments low and high for example, Solving a QCP, which can sometimes be helpful. You can optionally provide your own upper and lower bound when QCPs, and it will automatically find an upper and lower bound for theīisection. Solving DQCP problems ¶Ī DQCP problem problem can be solved by calling problem.solve(qcp=True).ĬVXPY uses a bisection method on the optimal value of the problem to solve \(f\) is quasiconvex if and only if its domain is a convex set and its Quasiconvexity generalizes convexity: a function Disciplined quasiconvex programming (DQCP) is a generalization of DCP for
0 Comments
Leave a Reply. |