The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction

QR Code

The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction

The problem of finding a sparse solution for linear equations has been investigated extensively in recent years. This is an NP-hard combinatorial problem, and one popular method is to relax such combinatorial requirement into an approximated convex problem, which can avoid the computational complexi...

Full description

Bibliographic Details
Main Authors:	Wang, Y., Zhou, Guanglu, Zhang, X., Liu, W., Caccetta, Louis
Format:	Journal Article
Published:	2016
Online Access:	http://hdl.handle.net/20.500.11937/15730

Similar Items

Parameter selection for nonnegative l1 matrix/tensor sparse decomposition
by: Wang, Y., et al.
Published: (2015)

An Alternative Lagrange-Dual based Algorithm for Sparse Signal Reconstruction
by: Wang, Y., et al.
Published: (2011)

Nonnegative polynomial optimization over unit spheres and convex programming relaxations
by: Zhou, Guanglu, et al.
Published: (2012)

Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
by: Zhang, X., et al.
Published: (2017)

Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor
by: Zhou, Guanglu, et al.
Published: (2013)

Spectral theory of nonnegative tensors
by: Yang, Q., et al.
Published: (2013)

An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
by: Liu, Y., et al.
Published: (2010)

Nonnegative blind source separation by sparse component analysis based on determinant measure
by: Yang, Z., et al.
Published: (2012)

On the largest eigenvalue of a symmetric nonnegative tensor
by: Zhou, Guanglu, et al.
Published: (2013)

Finding the largest eigenvalue of a nonnegative tensor
by: Ng, M., et al.
Published: (2009)

A convex geometry based blind source separation method for separating nonnegative sources
by: Yang, Z., et al.
Published: (2014)

Feasible semismooth Newton method for a class of stochastic linear complementarity problems
by: Zhou, Guanglu, et al.
Published: (2008)

The SC1 property of an expected residual function arising from stochastic complementarity problems
by: Zhou, Guanglu, et al.
Published: (2008)

A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions
by: Zhou, Guanglu, et al.
Published: (2010)

A fast algorithm for the spectral radii of weakly reducible nonnegative tensors
by: Zhou, Guanglu, et al.
Published: (2018)

Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
by: Zhou, Guanglu, et al.
Published: (2013)

Image Reconstruction via Manifold Constrained Convolutional Sparse Coding for Image Sets
by: Yang, L., et al.
Published: (2017)

Convergence analysis of a block improvement method for polynomial optimization over unit spheres
by: Wang, Y., et al.
Published: (2015)

Nonsingular H-tensor and its criteria
by: Wang, Y., et al.
Published: (2016)

Properties of expected residual functions arising from stochastic complementarity problems
by: Ling, C., et al.
Published: (2011)

Distributed proximal-gradient methods for convex optimization with inequality constraints
by: Li, J., et al.
Published: (2014)

Compensated convexity methods for approximations and interpolations of sampled functions in Euclidean spaces: applications to contour lines, sparse data and inpainting
by: Zhang, Kewei, et al.
Published: (2018)

Inverse nonnegative local coordinate factorization for visual tracking
by: Liu, Fanghui, et al.
Published: (2017)

An efficient nonnegative matrix factorization approach in flexible Kernel space
by: Zhang, D., et al.
Published: (2009)

An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints
by: Li, J., et al.
Published: (2015)

The largest eigenvalue of nonnegative tensors
by: Ibrahim, Nur Fadhilah
Published: (2013)

Pursuit differential game problem with multiple players on a closed convex set with more general integral constraints
by: Ahmed, Idris, et al.
Published: (2020)

A globally and quadratically convergent method for absolute value equations
by: Caccetta, Louis, et al.
Published: (2011)

Minimum Time Synchronization of Chaotic Systems via Numerical Optimal Control Techniques
by: Xu, Honglei, et al.
Published: (2014)

A quadratically convergent method for minimizing a sum of euclidean norms with linear constraints
by: Zhou, Guanglu
Published: (2007)

A multi-product newsvendor problem with budget and loss constraints
by: Zhou, Y., et al.
Published: (2014)

Regularised nonnegative shared subspace learning
by: Gupta, Sunil, et al.
Published: (2011)

Coefficient Conditions for Starlikeness of Nonnegative Order
by: M. Ali, Rosihan, et al.
Published: (2012)

Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria
by: Xu, Honglei, et al.
Published: (2016)

Pursuit differential game of many pursuers with integral constraints on compact convex set
by: Ferrara, Massimiliano, et al.
Published: (2019)

An alternating direction method for solving convex nonlinear semidefinite programming problems
by: Zhang, S., et al.
Published: (2013)

Positive solutions for three-point semipositone boundary value problems with convex nonlinearity
by: Zhang, Xinguang
Published: (2009)

Triangulability of convex graphs and convex skewness
by: Ali, Niran Abbas, et al.
Published: (2021)

Non-differentiable second order symmetric duality in mathematical programming with F-convexity
by: Yang, X., et al.
Published: (2003)

Nonnegative matrix factorization and metamorphic malware detection
by: Ling, Yeong Tyng, et al.
Published: (2019)

Cannot write session to /tmp/vufind_sessions/sess_afd7g3r4pfb3kp3p47vacsp6g3