arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.00880math.OCstat.ML
收藏

一类约束最优化问题的稀疏解

Sparse Solutions of a Class of Constrained Optimization Problems

Lei Yang, Xiaojun Chen, Shuhuang Xiang

摘要:

在本文中,我们考虑了一个著名的稀疏优化问题,旨在找到一个稀疏的解决方案,可能有噪音的欠定线性方程组。在数学上,可以通过针对给定的$A \in \mathbb{R}^{m \times n}$、$\bf{b}\in\mathbb{R}^m$、$σ\geq0$、$0\leq p\leq 1$和$q \geq 1$最小化$\|\bf{x}\|_p^p$服从$\|A\bf{x}-\bf{b}\|_q\leqσ$来以统一的方式对其建模。然后,我们研究这个问题的最优解的各种性质。具体地说,在不对矩阵$A$作任何条件的情况下,给出了最优解的基数和无穷范数的上界,并证明了当$0<p<1$时,所有的最优解都必须在可行集的边界上.此外,对于$q \in \{1,\infty\}$,我们证明了问题与$0<p<1$有有限个最优解,并证明了存在$0<p^*<1$,使任何$0<p<p^*$的问题的解集包含在问题的解集与$p=0$,并进一步存在$0<\bar{p}<p^*$,使问题的解集与任何$0<p\leq\bar{p}$保持不变。还提供了这种$p^*$的估计。此外,为了求解约束非凸非Lipschitz $L_p$-$L_1$问题($0<p<1$和$q=1$),我们提出了一种光滑罚方法,并证明了在一定条件下,生成的序列的任何簇点都是问题的KKT点.数值算例表明了本文算法的有效性,并对不同噪声下的约束$L_p$-$L_1$问题进行了数值模拟。

英文摘要:

In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing $\|\bf{x}\|_p^p$ subject to $\|A\bf{x}-\bf{b}\|_q\leqσ$ for given $A \in \mathbb{R}^{m \times n}$, $\bf{b}\in\mathbb{R}^m$, $σ\geq0$, $0\leq p\leq 1$ and $q \geq 1$. We then study various properties of the optimal solutions of this problem. Specifically, without any condition on the matrix $A$, we provide upper bounds in cardinality and infinity norm for the optimal solutions, and show that all optimal solutions must be on the boundary of the feasible set when $0<p<1$. Moreover, for $q \in \{1,\infty\}$, we show that the problem with $0<p<1$ has a finite number of optimal solutions and prove that there exists $0<p^*<1$ such that the solution set of the problem with any $0<p<p^*$ is contained in the solution set of the problem with $p=0$ and there further exists $0<\bar{p}<p^*$ such that the solution set of the problem with any $0<p\leq\bar{p}$ remains unchanged. An estimation of such $p^*$ is also provided. In addition, to solve the constrained nonconvex non-Lipschitz $L_p$-$L_1$ problem ($0<p<1$ and $q=1$), we propose a smoothing penalty method and show that, under some mild conditions, any cluster point of the sequence generated is a KKT point of our problem. Some numerical examples are given to implicitly illustrate the theoretical results and show the efficiency of the proposed algorithm for the constrained $L_p$-$L_1$ problem under different noises.

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

↑