Discrete-Time Lossless Convexification for pointing constraints
Code for DT-LCvx with applications to pointing-constrained problems.
Paper available at https://arxiv.org/abs/2501.06931
-
Notifications
You must be signed in to change notification settings - Fork 0
Discrete-Time Lossless Convexification (DT-LCvx) 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.
UW-ACL/DT-LCvx-Pointing
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Discrete-Time Lossless Convexification (DT-LCvx) 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.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published