Existence of optimal solutions for the convex control problem

Let ARn×nA\in\mathbb{R}^{n \times n}, BRn×mB\in\mathbb{R}^{n \times m}, T>0T>0, β1,2,,m1\beta\in\\{1,2,\dots,m-1\\}, and αj(0,T]\alpha_j\in(0,T] for j=1,2,,mj=1,2,\dots,m, as in Problem~

.Existenceconjecture.Foreverysuchchoiceofdata,optimalsolutionsofProblem . **Existence conjecture.** For every such choice of data, optimal solutions of Problem~

exist. The existence of optimal solutions is used in the paper's preceding results and is said to follow by an argument similar to a cited lemma, but no proof is supplied.

Sources & referencesView supporting material

Primary source

Takuya Ikeda, Kazunori Sakurama and Kenji Kashima, “Multiple sparsity constrained control node scheduling with application to rebalancing of mobility networks”, arXiv:2108.12624 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.