The sparsest solution to the system of absolute value equations
From MaRDI portal
Publication:2356345
DOI10.1007/s40305-014-0067-6zbMath1351.90138OpenAlexW2033423930MaRDI QIDQ2356345
Yu-Fan Li, Min Zhang, Zheng-Hai Huang
Publication date: 29 July 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0067-6
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Statistical aspects of information-theoretic topics (62B10)
Related Items (8)
The new iteration methods for solving absolute value equations. ⋮ A relaxed proximal ADMM method for block separable convex programming ⋮ A modified SOR-like method for absolute value equations associated with second order cones ⋮ SOR-like iteration method for solving absolute value equations ⋮ Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem ⋮ The new iteration algorithm for absolute value equation ⋮ A new two-step iterative method for solving absolute value equations ⋮ Two new fixed point iterative schemes for absolute value equations
Cites Work
- \(s\)-goodness for low-rank matrix recovery
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Absolute value equation solution via linear programming
- New bounds for RIC in compressed sensing
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- A generalized Newton method for absolute value equations associated with second order cones
- A globally and quadratically convergent method for absolute value equations
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Absolute value equations
- Absolute value programming
- A generalized Newton method for absolute value equations
- Global and finite convergence of a generalized Newton method for absolute value equations
- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
- Minimum norm solution to the absolute value equation in the convex case
- Absolute value equation solution via dual complementarity
- A note on absolute value equations
- On equivalent reformulations for absolute value equations
- EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
- Decoding by Linear Programming
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- A theorem of the alternatives for the equationAx+B|x| =b
- Sparse Approximate Solutions to Linear Systems
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
This page was built for publication: The sparsest solution to the system of absolute value equations
