arXiv 1203.45802012-03-20cs.ITmath.ITmath.OC

Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms

Amir Beck, Yonina C. Eldar

备注：: submitted to SIAM Optimization

英文摘要：

This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and coordinate-wise optimality. These conditions are then used to derive three numerical algorithms aimed at finding points satisfying the resulting optimality criteria: the iterative hard thresholding method and the greedy and partial sparse-simplex methods. The first algorithm is essentially a gradient projection method while the remaining two algorithms are of coordinate descent type. The theoretical convergence of these methods and their relations to the derived optimality conditions are studied. The algorithms and results are illustrated by several numerical examples.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Optimality Analysis and Block Sparse Algorithm for Complex Compressed Sensing

Recently, many new challenges in Compressed Sensing (CS), such as block sparsity, arose. In this paper, we present a new algorithm for solving CS with block sparse constraints (BSC) in complex fields. Firstly, based on block sparsity characteristics, we propose a new model to deal with CS with BSC and analyze the properties of the functions involved in this model. We then present a new $τ$-stationary point and analyze corresponding first-order sufficient and necessary conditions. That ensures we to further develop a block Newton hard-thresholding pursuit (BNHTP) algorithm for efficiently solvi…

2022-09-18cs.ITmath.ITmath.OC

Constrained Optimization Involving Nonconvex $\ell_p$ Norms: Optimality Conditions, Algorithm and Convergence

ShanghaiTech University（上海科技大学）；University of Washington（华盛顿大学）；Beihang University（北京航空航天大学）

This paper investigates the optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an $\ell_p$ norm ($0<p<1$) of the variables, which may appear in either the objective or the constraint. This kind of problems have strong applicability to a wide range of areas since usually the $\ell_p$ norm can promote sparse solutions. However, the nonsmooth and non-Lipschtiz nature of the $\ell_p$ norm often cause these problems difficult to analyze and solve. We provide the calculation of the subgradients of the $\ell_p$ norm and the normal cones of…

2022-02-15cs.ITcs.LGmath.IT

稀疏约束的基于社区的群体检测

Sparsity-Constrained Community-Based Group Testing

针对稀疏约束下的社区群体检测问题，提出一种概率算法，以消失错误概率识别感染者，并在特定条件下优于现有方法，同时适用于稀释模型。

2024-03-19cs.ITmath.IT

稀疏约束非线性优化的可分 Bregman 框架

Separable Bregman Framework for Sparsity Constrained Nonlinear Optimization

本文研究基数约束下连续可微函数的稀疏非线性优化问题，基于光滑和相对光滑函数的新下降引理，提出了扩展硬阈值算法的最优性条件与求解框架，并将其有效应用于压缩感知问题。

2024-09-25cs.ITmath.ITmath.OC

Optimality of $\ell_2/\ell_1$-optimization block-length dependent thresholds

The recent work of \cite{CRT,DonohoPol} rigorously proved (in a large dimensional and statistical context) that if the number of equations (measurements in the compressed sensing terminology) in the system is proportional to the length of the unknown vector then there is a sparsity (number of non-zero elements of the unknown vector) also proportional to the length of the unknown vector such that $\ell_1$-optimization algorithm succeeds in solving the system. In more recent papers \cite{StojnicCSetamBlock09,StojnicICASSP09block,StojnicJSTSP09} we considered under-determined systems with the so-…

2013-03-29cs.ITmath.ITmath.OC

Backhaul-Constrained Multi-Cell Cooperation Leveraging Sparsity and Spectral Clustering

Multi-cell cooperative processing with limited backhaul traffic is studied for cellular uplinks. Aiming at reduced backhaul overhead, a sparsity-regularized multi-cell receive-filter design problem is formulated. Both unstructured distributed cooperation as well as clustered cooperation, in which base station groups are formed for tight cooperation, are considered. Dynamic clustered cooperation, where the sparse equalizer and the cooperation clusters are jointly determined, is solved via alternating minimization based on spectral clustering and group-sparse regression. Furthermore, decentraliz…

2015-10-14cs.ITcs.NImath.IT

更多相关论文收起更多论文

Fast Splitting Algorithms for Sparsity-Constrained and Noisy Group Testing

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is present. This problem is relevant in areas such as medical testing, DNA sequencing, communication protocols, and many more. In this paper, we study (i) a sparsity-constrained version of the problem, in which the testing procedure is subjected to one of the following two constraints: items are finitely divisible and thus may participate in at most $γ$ tests; or tests are size-constrained to pool no more than $ρ$ items pe…

2022-10-21cs.DScs.ITmath.IT

A Sparsity-Aware Adaptive Algorithm for Distributed Learning

In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed convex set, known as property set, is constructed based on the received measurements; this defines the region in which the solution is searched for. In this paper, the property sets take the form of hyperslabs. The goal is to find a point that belongs to the intersection of these hyperslabs. To this end, sparsity encouraging variable metric projections onto th…

2011-12-24cs.ITmath.IT

Improved Bounds and Algorithms for Sparsity-Constrained Group Testing

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data science, communications, and many more. Motivated by physical considerations, we consider a sparsity-based constrained setting (Gandikota et al., 2019) in which the testing procedure is subject to one of the following two constraints: items are finitely divisible and thus may participate in at most $γ$ tests; or tests are size-constrained to pool no more th…

2020-11-10cs.ITmath.ITmath.PR

压缩感知与离散断层成像中结构信号的性能界限

Performance Bounds For Co-/Sparse Box Constrained Signal Recovery

本文研究了在有限线性测量下恢复结构信号的性能界限，通过提供双证测试、统计维度近似和实验验证，解决了TV半范数下欠采样率的估计问题。

2018-12-23cs.ITcs.NAeess.SP

通信约束下的假设检验：最优性、鲁棒性与逆数据处理不等式

Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities

IBM Research（IBM研究院）；University of Cambridge（剑桥大学）

本文研究通信约束下的假设检验，证明二元情形样本复杂度仅增加一个紧的对数因子并给出多项式时间算法，同时扩展到鲁棒检验并揭示 M 元情形的 Ω(M) 下界。

2023-12-15cs.DScs.ITcs.LG

Capacity Optimality of OAMP in Coded Large Unitarily Invariant Systems

City University of Hong Kong（香港城市大学）；Japan Institute of Science and Technology (JAIST)（日本北陆先端科学技术大学院大学）；Huawei Technologies Co., Ltd.（华为技术有限公司）

This paper investigates a large unitarily invariant system (LUIS) involving a unitarily invariant sensing matrix, an arbitrary fixed signal distribution, and forward error control (FEC) coding. Several area properties are established based on the state evolution of orthogonal approximate message passing (OAMP) in an un-coded LUIS. Under the assumptions that the state evolution for joint OAMP and FEC decoding is correct and the replica method is reliable, we analyze the achievable rate of OAMP. We prove that OAMP reaches the constrained capacity predicted by the replica method of the LUIS with …

2022-06-23cs.AIcs.ITcs.LG