Skip to main content
Log in

Experimental analysis of local searches for sparse reflexive generalized inverses

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear equations. Irrespective of whether a given matrix is sparse, its M-P pseudoinverse can be completely dense, potentially leading to high computational burden and numerical difficulties, especially when we are dealing with high-dimensional matrices. The M-P pseudoinverse is uniquely characterized by four properties, but not all of them need to be satisfied for some applications. In this context, Fampa and Lee (Oper. Res. Lett., 46:605–610, 2018) and Xu et al. (SIAM J. Optim., to appear) propose local-search procedures to construct sparse block-structured generalized inverses that satisfy only some of the M-P properties. (Vector) 1-norm minimization is used to induce sparsity and to keep the magnitude of the entries under control, and theoretical results limit the distance between the 1-norm of the solution of the local searches and the minimum 1-norm of generalized inverses with corresponding properties. We have implemented several local-search procedures based on results presented in these two papers and make here an experimental analysis of them, considering their application to randomly generated matrices of varied dimensions, ranks, and densities. Further, we carried out a case study on a real-world data set.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. percentage of variation of the goal variable that is linearly explained by the regression

References

  1. Campbell, S.L., Meyer, C.D.: Generalized inverses of linear transformations. SIAM, (2009)

  2. Dokmanić, I., Gribonval, R.: Beyond Moore-Penrose Part I: generalized inverses that minimize matrix norms. arXiv:1706.08349, (2017)

  3. Dokmanić, I., Gribonval, R.: Beyond Moore-Penrose Part II: the sparse pseudoinverse. https://hal.inria.fr/hal-01547283/file/pseudo-part2.pdf, (2017)

  4. Dokmanić, I., Kolundžija, M., Vetterli, M.: Beyond Moore-Penrose: sparse pseudoinverse. In: ICASSP 2013, pp. 6526–6530. IEEE, (2013)

  5. Elble, J.M., Sahinidis, N.: A review of the LU update in the simplex algorithm. Int. J. Math. Oper. Res. 4, 366–399 (2012)

    Article  MathSciNet  Google Scholar 

  6. Fampa, M., Lee, J.: On sparse reflexive generalized inverses. Oper. Rese. Lett. 46(6), 605–610 (2018)

    Article  MathSciNet  Google Scholar 

  7. Fuentes, V., Fampa, M., Lee, J.: Diving for sparse partially-reflexive generalized inverses. In: Le Thi, H., Le, H., Pham Dinh T. (eds.) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol. 991, pp. 89–98. Springer (2020)

  8. Fuentes, V.K., Fampa, M., Lee, J.: Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose. CLAIO 2016, 343–350 (2016)

    Google Scholar 

  9. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  10. Gondzio, J.: Stable algorithm for updating dense LU factorization after row or column exchange and row and column addition or deletion. Optimization 23, 7–26 (1992)

    Article  MathSciNet  Google Scholar 

  11. Meyer, C.D., Jr.: Generalized inversion of modified matrices. SIAM J. Appl. Math. 24(3), 315–323 (1973)

    Article  MathSciNet  Google Scholar 

  12. Penrose, R.: A generalized inverse for matrices. Math. Proc. Camb. Philos. Soc. 51, 406–413 (1955)

    Article  Google Scholar 

  13. Rohde, C.A.: Contributions to the theory, computation and application of generalized inverses. PhD thesis, North Carolina State University, Raleigh, May 1964. https://www4.stat.ncsu.edu/~boos/library/mimeo.archive/ISMS_1964_392.pdf

  14. Xu, L., Fampa, M., Lee, J., Ponte, G.: Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search. SIAM J. Optim. 31(3), 1722–1747 (2021)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

M. Fampa was supported in part by CNPq grant 303898/2016-0. J. Lee was supported in part by ONR grant N00014-17-1-2296. G. Ponte was supported in part by CNPq PIBIC scholarship 149149/2020-4. M. Fampa, J. Lee and L. Xu were supported in part by funding from the Simons Foundation and the Centre de Recherches Mathématiques, through the Simons-CRM scholar-in-residence program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jon Lee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fampa, M., Lee, J., Ponte, G. et al. Experimental analysis of local searches for sparse reflexive generalized inverses. J Glob Optim 81, 1057–1093 (2021). https://doi.org/10.1007/s10898-021-01087-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-021-01087-y

Keywords

Navigation