arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.09378math.OCmath.FA
收藏

关于含l2-misfit项泛函的凸化/ optimization

On convexification/optimization of functionals including an l2-misfit term

Marcus Carlsson

摘要:

我们提供了计算f(x)型泛函的下半连续凸包络的理论,加上一个l2失配,并讨论了各种非凸优化问题的应用。后一项是数据拟合项,而f提供对x的结构约束。通过最小化上面的表达式,可能有额外的约束,我们因此找到了匹配测量数据和在x上强制执行特定结构(如稀疏性或低秩)之间的折衷。对于这些特殊情况,该理论提供了凸松弛技术的替代方案,如l1最小化(向量)和核范数最小化(矩阵)。对于泛函的L2失配包括一个奇异矩阵和凸包络通常是不明确可计算的,我们提供的理论如何极小化(明确可计算)近似凸包络与极小化的原始功能。特别是,我们给出了明确的条件时,两者重合。

英文摘要:

We provide theory for computing the lower semi-continuous convex envelope of functionals of the type f(x) plus an l2 misfit, and discuss applications to various non-convex optimization problems. The latter term is a data fit term whereas f provides structural constraints on x. By minimizing the above expression, possibly with additional constraints, we thus find a tradeoff between matching the measured data and enforcing a particular structure on x, such as sparsity or low rank. For these particular cases, the theory provides alternatives to convex relaxation techniques such as l1 -minimization (for vectors) and nuclear norm-minimization (for matrices). For functionals where the l2 misfit includes a singular matrix and where the convex envelope usually is not explicitly computable, we provide theory for how minimizers of (explicitly computable) approximations of the convex envelope relate to minimizers of the original functional. In particular, we give explicit conditions on when the two coincide.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑