The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(8 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Yong Wang / rank | |||
Property / author | |||
Property / author: Xin Zhang / rank | |||
Property / author | |||
Property / author: Yong Wang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Xin Zhang / rank | |||
Normal rank | |||
Property / review text | |||
The subject of the article is located in a scientifically active area of finding a sparse solution for linear equations. It usually includes a formulation into a combinatorial optimization problem which is usually relaxed as a convex or a non-convex problem. The authors investigate the non-convex problem with the nonnegative constraint which has an application in signal reconstruction. They consider obtaining Lipschitz continuous problem from the non-Lipschitz one to reduce the computational complexity of the original problem and develop a fast algorithm based on the limited-memory BFGS algorithm to find its sparse solution. They show that the proposed algorithm has better or comparable performance in terms of the CPU time by producing more sparse solutions than convex methods or non-convex methods. This article is well written, structured and explained, it contains five sections: Section 1 Introduction, Section 2 Preliminaries, Section 3 A reformulation, Section 4 Algorithm description, and Section 5 Numerical illustrations, and Section 6 Conclusion. In fact, future scientific work on other application fields such as face recognition and image signal decomposition as well as investigating the equivalence relationship would be interesting. | |||
Property / review text: The subject of the article is located in a scientifically active area of finding a sparse solution for linear equations. It usually includes a formulation into a combinatorial optimization problem which is usually relaxed as a convex or a non-convex problem. The authors investigate the non-convex problem with the nonnegative constraint which has an application in signal reconstruction. They consider obtaining Lipschitz continuous problem from the non-Lipschitz one to reduce the computational complexity of the original problem and develop a fast algorithm based on the limited-memory BFGS algorithm to find its sparse solution. They show that the proposed algorithm has better or comparable performance in terms of the CPU time by producing more sparse solutions than convex methods or non-convex methods. This article is well written, structured and explained, it contains five sections: Section 1 Introduction, Section 2 Preliminaries, Section 3 A reformulation, Section 4 Algorithm description, and Section 5 Numerical illustrations, and Section 6 Conclusion. In fact, future scientific work on other application fields such as face recognition and image signal decomposition as well as investigating the equivalence relationship would be interesting. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Başak Akteke-Öztürk / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94A12 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6641402 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonnegative sparse solution | |||
Property / zbMATH Keywords: nonnegative sparse solution / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
non-Lipschitz continuous | |||
Property / zbMATH Keywords: non-Lipschitz continuous / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
non-convex optimization problem | |||
Property / zbMATH Keywords: non-convex optimization problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial optimization | |||
Property / zbMATH Keywords: combinatorial optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
signal reconstruction | |||
Property / zbMATH Keywords: signal reconstruction / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
limited-memory BFGS algorithm | |||
Property / zbMATH Keywords: limited-memory BFGS algorithm / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: l1_ls / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: L-BFGS / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: LBFGS-B / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-016-0869-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2308325646 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Approximation via Penalty Decomposition Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative thresholding for sparse approximations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimized Projections for Compressed Sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Sparse Representation Based on Smoothed ℓ0 Norm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decoding by Linear Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact matrix completion via convex optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2900668 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Subband Adaptive Iterative Shrinkage/Thresholding Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Thresholding-based iterative selection procedures for model selection and shrinkage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Restricted isometry properties and nonconvex compressive sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Limited Memory Algorithm for Bound Constrained Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the limited memory BFGS method for large scale optimization / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:12, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The non-convex sparse problem with nonnegative constraint for signal reconstruction |
scientific article |
Statements
The non-convex sparse problem with nonnegative constraint for signal reconstruction (English)
0 references
20 October 2016
0 references
The subject of the article is located in a scientifically active area of finding a sparse solution for linear equations. It usually includes a formulation into a combinatorial optimization problem which is usually relaxed as a convex or a non-convex problem. The authors investigate the non-convex problem with the nonnegative constraint which has an application in signal reconstruction. They consider obtaining Lipschitz continuous problem from the non-Lipschitz one to reduce the computational complexity of the original problem and develop a fast algorithm based on the limited-memory BFGS algorithm to find its sparse solution. They show that the proposed algorithm has better or comparable performance in terms of the CPU time by producing more sparse solutions than convex methods or non-convex methods. This article is well written, structured and explained, it contains five sections: Section 1 Introduction, Section 2 Preliminaries, Section 3 A reformulation, Section 4 Algorithm description, and Section 5 Numerical illustrations, and Section 6 Conclusion. In fact, future scientific work on other application fields such as face recognition and image signal decomposition as well as investigating the equivalence relationship would be interesting.
0 references
nonnegative sparse solution
0 references
non-Lipschitz continuous
0 references
non-convex optimization problem
0 references
combinatorial optimization
0 references
signal reconstruction
0 references
computational complexity
0 references
algorithm
0 references
limited-memory BFGS algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references