论文： Insights on Transfer Optimization: Because Experience is the Best Teacher（2）---迁移优化定义

（1） Consider a series of K optimization problems (or tasks) that are labeled as T1, T2, . . . , T K , belonging to domains
D1, D2, . . . , DK , respectively. The kth domain, denoted as Dk, consists of a search space Xk, and an auxiliary space . To
elaborate, contains the set Yk of all possible operating conditions for which the optimization exercise may be carried out.

（自己的理解： 一个问题标记为Task1简写为T1，它的空间域为Domain 1 简写为D1，而这个域D1是包含有基向量X，以及其相应的结果y，构成一个空间。而提供给每一个Yk试验中的各种的条件 。 我有点不明白