Skip to main content
SpringerLink
Log in

Concave minimization for sparse solutions of absolute value equations

  • Published:
Transactions of Tianjin University Aims and scope Submit manuscript

Abstract

Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series of linear programming. It is proved that a sparse solution can be found under the assumption that the connected matrixes have range space property(RSP). Numerical experiments are also conducted to verify the efficiency of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mangasarian O L, Meyer R R. Absolute value equations [J]. Linear Algebra and Its Applications, 2006, 419(2/3): 359–367.

    Article  MathSciNet  MATH  Google Scholar 

  2. Mangasarian O L. Absolute value programming [J]. Computational Optimization and Applications, 2007, 36(1): 43–53.

    Article  MathSciNet  MATH  Google Scholar 

  3. Mangasarian O L. Absolute value equation solution via concave minimization[J]. Optimization Letters, 2007, 1(1): 3–8.

    Article  MathSciNet  MATH  Google Scholar 

  4. Prokopyev O. On equivalent reformulations for absolute value equations [J]. Computational Optimization and Applications, 2009, 44(3): 363–372.

    Article  MathSciNet  MATH  Google Scholar 

  5. Rohn J. A theorem of the alternatives for the equations AX ? B x ? b [J]. Linear Multilinear Algebra, 2004, 52(6): 421–426.

    Article  MathSciNet  MATH  Google Scholar 

  6. Mangasarian O L. A generalized Newton method for absolute value equations [J]. Optimization Letters, 2009, 3(1): 101–108.

    Article  MathSciNet  MATH  Google Scholar 

  7. Hu S L, Huang Z H. A note on absolute value equations [J]. Optimization Letters, 2010, 4(3): 417–424.

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhang M, Huang Z H, Li Y F. The sparsest solution to the system of absolute value equations [J]. Journal of the Operations Research Society of China, 2015, 3(1): 31–51.

    Article  MathSciNet  Google Scholar 

  9. Candès E J, Romberg J K, Tao T. Stable signal recovery from incomplete and inaccurate measurements [J]. Communications on Pure and Applied Mathematics, 2006, 59(8): 1207–1223.

    Article  MathSciNet  MATH  Google Scholar 

  10. Candès E J, Romberg J, Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information [J]. IEEE Transactions on Information Theory, 2006, 52(2): 489–509.

    Article  MATH  Google Scholar 

  11. Donoho D L. Compressed sensing[J]. IEEE Transactions on Information Theory, 2006, 52(4): 1289–1306.

    Article  MathSciNet  MATH  Google Scholar 

  12. Donoho D L, Elad M. Optimality sparse representation in general (nonorthogonal) dictionaries via l1 minimization [J]. Proceedings of the National Academy of Sciences of the United States of America, 2003, 100(5): 2197–2202.

    Article  MathSciNet  MATH  Google Scholar 

  13. Donoho D L, Huo X. Uncertainty principles and ideal atomic decomposition [J]. IEEE Transactions on Information Theory, 2001, 47(7): 2845–2862.

    Article  MathSciNet  MATH  Google Scholar 

  14. Gribonval R, Nielsen M. Sparse decompositions in unions of bases [J]. IEEE Transactions on Information Theory, 2003, 49(12): 3320–3325.

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhang Y. Theory of compressive sensing via l1-minimization: A non-RIP analysis and extensions [J]. Journal of the Operations Research Society of China, 2013, 1(1): 79–105.

    Article  MATH  Google Scholar 

  16. Zhao Y B, Li D. Reweighted l1-minimization for sparse solutions to underdetermined linear systems [J]. SIAM Journal on Optimization, 2012, 22(3): 1065–1088.

    Article  MathSciNet  MATH  Google Scholar 

  17. Zhou S L, Kong L C, Xiu N H. New bounds for RIC in compressed sensing [J]. Journal of the Operations Research Society of China, 2013, 1(2): 227–237.

    Article  MathSciNet  MATH  Google Scholar 

  18. Luo Z Y, Qin L X, Kong L C et al. The nonnegative zeronorm minimization under generalized Z-matrix measurement [J]. Journal of Optimization Theory and Applications, 2014, 160(3): 854–864.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Sciences, Tianjin University, Tianjin, 300072, China

    Xiaohong Liu  (刘晓红) & Jie Fan  (樊 婕)

  2. Center for Applied Mathematics, Tianjin University, Tianjin, 300072, China

    Wenjuan Li  (李文娟)

Authors
  1. Xiaohong Liu  (刘晓红)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Fan  (樊 婕)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenjuan Li  (李文娟)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaohong Liu  (刘晓红).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, X., Fan, J. & Li, W. Concave minimization for sparse solutions of absolute value equations. Trans. Tianjin Univ. 22, 89–94 (2016). https://doi.org/10.1007/s12209-016-2640-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12209-016-2640-z

Keywords

Search

Navigation