Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Randomized iterative methods for generalized absolute value equations: Solvability and error bounds (2405.04091v2)

Published 7 May 2024 in math.NA and cs.NA

Abstract: Randomized iterative methods, such as the Kaczmarz method and its variants, have gained growing attention due to their simplicity and efficiency in solving large-scale linear systems. Meanwhile, absolute value equations (AVE) have attracted increasing interest due to their connection with the linear complementarity problem. In this paper, we investigate the application of randomized iterative methods to generalized AVE (GAVE). Our approach differs from most existing works in that we tackle GAVE with non-square coefficient matrices. We establish more comprehensive sufficient and necessary conditions for characterizing the solvability of GAVE and propose precise error bound conditions. Furthermore, we introduce a flexible and efficient randomized iterative algorithmic framework for solving GAVE, which employs sampling matrices drawn from user-specified distributions. This framework is capable of encompassing many well-known methods, including the Picard iteration method and the randomized Kaczmarz method. Leveraging our findings on solvability and error bounds, we establish both almost sure convergence and linear convergence rates for this versatile algorithmic framework. Finally, we present numerical examples to illustrate the advantages of the new algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (77)
  1. Solving absolute value equation using complementarity and smoothing functions. Journal of Computational and Applied Mathematics, 327:196–207, 2018.
  2. Method of alternating projections for the general absolute value equation. Journal of Fixed Point Theory and Applications, 25(1):39, 2023.
  3. On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J. Sci. Comput., 40(1):A592–A606, 2018.
  4. On the global convergence of the inexact semi-smooth Newton method for absolute value equation. Computational Optimization and Applications, 65(1):93–108, 2016.
  5. Convex optimization. Cambridge university press, 2004.
  6. Random activations in primal-dual splittings for monotone inclusions with a priori information. J. Optim. Theory Appl., pages 1–26, 2022.
  7. Sébastien Bubeck et al. Convex optimization: Algorithms and complexity. Foundations and Trends® in Machine Learning, 8(3-4):231–357, 2015.
  8. A globally and quadratically convergent method for absolute value equations. Computational optimization and applications, 48:45–58, 2011.
  9. Optimal parameter of the SOR-like iteration method for solving absolute value equations. Numerical Algorithms, pages 1–28, 2023.
  10. An inverse-free dynamical system for solving the absolute value equations. Applied Numerical Mathematics, 168:170–181, 2021.
  11. Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations. IMA Journal of Numerical Analysis, 43(2):1036–1060, 2023.
  12. A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations. arXiv preprint arXiv:2111.13808, to appear in Journal of Computational Mathematics, 2021.
  13. Regularized Kaczmarz algorithms for tensor recovery. SIAM J. Imaging Sci., 14(4):1439–1471, 2021.
  14. Frank H Clarke. Optimization and nonsmooth analysis. SIAM, 1990.
  15. Avet: A novel transform function to improve cancellable biometrics security. IEEE Transactions on Information Forensics and Security, 18:758–772, 2022.
  16. Solving nonlinear absolute value equations. arXiv preprint arXiv:2402.16439, 2024.
  17. Randomized extended average block Kaczmarz for solving least squares. SIAM J. Sci. Comput., 42(6):A3541–A3559, 2020.
  18. A generalization of the Gauss–Seidel iteration method for solving absolute value equations. Applied Mathematics and Computation, 293:156–167, 2017.
  19. Survey of a class of iterative row-action methods: The Kaczmarz method. arXiv preprint arXiv:2401.02842, 2024.
  20. Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. Journal of Theoretical Biology, 29(3):471–481, December 1970.
  21. On adaptive sketch-and-project for solving linear systems. SIAM J. Matrix Anal. Appl., 42(2):954–989, 2021.
  22. Randomized iterative methods for linear systems. SIAM J. Matrix Anal. Appl., 36(4):1660–1690, 2015.
  23. Farhad Khaksar Haghani. On generalized traub’s method for absolute value equations. Journal of Optimization Theory and Applications, 166(2):619–625, 2015.
  24. Randomized Douglas-Rachford methods for linear systems: Improved accuracy and efficiency. SIAM J. Optim., 34(1):1045–1070, 2024.
  25. On pseudoinverse-free randomized methods for linear systems: Unified framework and acceleration. arXiv preprint arXiv:2208.05437, 2022.
  26. Algebraic reconstruction techniques can be made computationally efficient (positron emission tomography application). IEEE Trans. Medical Imaging, 12(3):600–609, 1993.
  27. Nicholas J Higham. Accuracy and stability of numerical algorithms. SIAM, 2002.
  28. JB Hiriart-Urruty. Mean value theorems in nonsmooth analysis. Numerical Functional Analysis and Optimization, 2(1):1–30, 1980.
  29. Milan Hladík. Bounds for the solutions of absolute value equations. Computational Optimization and Applications, 69:243–266, 2018.
  30. Milan Hladík. Properties of the solution set of absolute value equations and the related matrix classes. SIAM Journal on Matrix Analysis and Applications, 44(1):175–195, 2023.
  31. Some notes on the solvability conditions for absolute value equations. Optimization Letters, 17(1):211–218, 2023.
  32. A generalized newton method for absolute value equations associated with second order cones. Journal of Computational and Applied Mathematics, 235(5):1490–1501, 2011.
  33. Stochastic alternating structure-adapted proximal gradient descent method with variance reduction for nonconvex nonsmooth optimization. Mathematics of Computation, 93(348):1677–1714, 2024.
  34. S Karczmarz. Angenäherte auflösung von systemen linearer glei-chungen. Bull. Int. Acad. Pol. Sic. Let., Cl. Sci. Math. Nat., pages 355–357, 1937.
  35. Sor-like iteration method for solving absolute value equations. Applied Mathematics and Computation, 311:195–202, 2017.
  36. Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions. Optimization Letters, pages 1–19, 2024.
  37. Ji Liu and Stephen Wright. An accelerated randomized Kaczmarz algorithm. Math. Comp., 85(297):153–178, 2016.
  38. Convergence analysis of inexact randomized iterative methods. SIAM Journal on Scientific Computing, 42(6):A3979–A4016, 2020.
  39. Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods. Comput. Optim. Appl., 77(3):653–710, 2020.
  40. Minimal error momentum Bregman-Kaczmarz. arXiv preprint arXiv:2307.15435, 2023.
  41. Stochastic gradient descent for linear systems with missing data. Numer. Math. Theory Methods Appl., 12(1):1–20, 2019.
  42. OL Mangasarian. Absolute value programming. Computational optimization and applications, 36:43–53, 2007.
  43. OL Mangasarian. A generalized Newton method for absolute value equations. Optimization Letters, 3:101–108, 2009.
  44. OL Mangasarian and RR Meyer. Absolute value equations. Linear Algebra and Its Applications, 419(2-3):359–367, 2006.
  45. Olvi L Mangasarian. Absolute value equation solution via concave minimization. Optimization Letters, 1(1):3–8, 2007.
  46. Olvi L Mangasarian and J Ren. New improved error bounds for the linear complementarity problem. Mathematical Programming, 66(1-3):241–255, 1994.
  47. Gary C McDonald. Ridge regression. Wiley Interdisciplinary Reviews: Computational Statistics, 1(1):93–100, 2009.
  48. An overview of absolute value equations: From theory to solution methods and challenges. arXiv preprint arXiv:2404.06319, 2024.
  49. Randomized Kaczmarz with averaging. BIT Numerical Mathematics, 61:337–359, 2021.
  50. Ion Necoara. Faster randomized block Kaczmarz algorithms. SIAM J. Matrix Anal. Appl., 40(4):1425–1452, 2019.
  51. Linear convergence of first order methods for non-strongly convex optimization. Mathematical Programming, 175:69–107, 2019.
  52. Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Math. Program., 155:549–573, 2016.
  53. Paved with good intentions: analysis of a randomized block Kaczmarz method. Linear Algebra and its Applications, 441:199–221, 2014.
  54. Two-subspace projection method for coherent overdetermined systems. J. Fourier Anal. Appl., 19(2):256–269, 2013.
  55. Jong-Shi Pang. Error bounds in mathematical programming. Mathematical Programming, 79(1-3):299–332, 1997.
  56. A stochastic approximation method. Ann. Math. Statistics, pages 400–407, 1951.
  57. Stephen M Robinson. Some continuity properties of polyhedral multifunctions. pp. 206-214, Springer, 1981.
  58. Jiri Rohn. A theorem of the alternatives for the equation A⁢x+B⁢|x|=b𝐴𝑥𝐵𝑥𝑏{A}x+{B}|x|=bitalic_A italic_x + italic_B | italic_x | = italic_b. Linear and Multilinear Algebra, 52(6):421–426, 2004.
  59. Jiri Rohn. On unique solvability of the absolute value equation. Optimization Letters, 3(4):603–606, 2009.
  60. An iterative method for solving absolute value equations and sufficient conditions for unique solvability. Optimization Letters, 8:35–44, 2014.
  61. Davod Khojasteh Salkuyeh. The Picard–HSS iteration method for absolute value equations. Optimization Letters, 8:2191–2202, 2014.
  62. Linear convergence of the randomized sparse Kaczmarz method. Math. Program., 173(1):509–536, 2019.
  63. A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl., 15(2):262–278, 2009.
  64. Semidefinite programming. SIAM review, 38(1):49–95, 1996.
  65. A verification method for enclosing solutions of absolute value equations. Collectanea mathematica, 64(1):17–38, 2013.
  66. Numerical validation for systems of absolute value equations. Calcolo, 54:669–683, 2017.
  67. David Williams. Probability with martingales. Cambridge university press, 1991.
  68. Handbook of semidefinite programming: theory, algorithms, and applications, volume 27. Springer Science & Business Media, 2012.
  69. The unique solution of the absolute value equations. Applied Mathematics Letters, 76:195–200, 2018.
  70. A note on unique solvability of the absolute value equation. Optimization Letters, 14(7):1957–1960, 2020.
  71. On the unique solution of the generalized absolute value equation. Optimization Letters, 15:2017–2024, 2021.
  72. Error bounds and a condition number for the absolute value equations. Mathematical Programming, 198(1):85–113, 2023.
  73. On adaptive stochastic heavy ball momentum for solving linear systems. arXiv:2305.05482, to appear in SIAM Journal on Matrix Analysis and Applications, 2023.
  74. Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems. Numer. Algor., 94:1403–1420, 2023.
  75. Fuzhen Zhang. Matrix theory: basic results and techniques. Springer Science & Business Media, 2011.
  76. Hui Zhang. New analysis of linear convergence of gradient-type methods via unifying error bound conditions. Mathematical Programming, 180(1-2):371–416, 2020.
  77. Semidefinite relaxation methods for tensor absolute value equations. SIAM Journal on Matrix Analysis and Applications, 44(4):1667–1692, 2023.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets