`scipy.optimize._trustregion_constr.qp_subproblem:box_intersections`

Signature

def box_intersections ( z , d , lb , ub , entire_line = False )

Find the intersection between segment (or line) and box constraints.

Find the intersection between the segment (or line) defined by the parametric equation x(t) = z + t*d and the rectangular box lb <= x <= ub.

z : array_like, shape (n,): Initial point.
d : array_like, shape (n,): Direction.
lb : array_like, shape (n,): Lower bounds to each one of the components of x. Used to delimit the rectangular box.
ub : array_like, shape (n, ): Upper bounds to each one of the components of x. Used to delimit the rectangular box.
entire_line : bool, optional: When True, the function returns the intersection between the line x(t) = z + t*d (t can assume any value) and the rectangular box. When False, the function returns the intersection between the segment x(t) = z + t*d, 0 <= t <= 1, and the rectangular box.

ta, tb : float: The line/segment x(t) = z + t*d is inside the box for for ta <= t <= tb.
intersect : bool: When True, there is a intersection between the line (or segment) and the rectangular box. On the other hand, when False, there is no intersection.