Struct MPSolveHPolyoracle

template<typename Polytope, class bfunc>
struct MPSolveHPolyoracle

Compute intersection of H-polytope P := Ax <= b with polynomial curve p(t) = sum a_j (t - t0)^j Uses the MPsolve library

Template Parameters:

• Polytope – Polytope Type

• bfunc – feasibility constraint type

Public Types

typedef Polytope::MT MT

typedef Polytope::VT VT

typedef Polytope::NT NT

typedef Polytope::PointType Point

Public Functions

inline std::tuple<NT, Point, int> apply(NT t_prev, NT t0, NT eta, MT &A, VT &b, Polytope &P, std::vector<Point> &coeffs, bfunc phi, bfunc grad_phi, int ignore_facet = -1, bool positive_real = true)