
Discrete lossless convexification for pointing constraints
Discrete Lossless Convexification (DLCvx) formulates a convex relaxation for a specific class of discrete-time non-convex optimal control problems. It establishes sufficient conditions under which the solution of the relaxed problem satisfies the original non-convex constraints at specified time grid points. Furthermore, it provides an upper bound on the number of time grid points where these sufficient conditions may not hold, and thus the original constraints could be violated. This paper ext…