Block Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems
Axioms · 30.06.2026 · 15 (7) · 491
DOI: 10.3390/axioms15070491 ↗Kurz gefasst
Fachartikel in der Zeitschrift Axioms, online erschienen am 30.06.2026. Verfasst von Zhiwei Ai und 1 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Science and Technology Project of Guangxi, China.
Abstract (Originalsprache)
The robotic grasping problem is firstly cast as a linear complementarity problem and reformulated into nonsmooth equations. We propose two block Kaczmarz methods to solve the equations. The K-means clustering algorithm is utilized to partition the nonsmooth equations. Based on the resulting block information, the subgradient greedy randomized Kaczmarz method and the subgradient multi-step greedy Kaczmarz method are constructed. Asymptotic convergence of the proposed block subgradient Kaczmarz methods is given. Numerical results confirm the superior computational accuracy of the new methods.
Förderung
- National Natural Science Foundation of China
- Science and Technology Project of Guangxi, China
Zitieren
APA
Ai, Z., & Li, C. (2026). Block Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems. Axioms, 15(7), 491. https://doi.org/10.3390/axioms15070491
Vancouver
Ai Z, Li C. Block Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems. Axioms. 2026;15(7):491. doi:10.3390/axioms15070491
BibTeX
@article{Ai2026,
author = {Ai, Zhiwei and Li, Chenliang},
title = {Block Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems},
journal = {Axioms},
year = {2026},
volume = {15},
number = {7},
pages = {491},
doi = {10.3390/axioms15070491}
}
EUVIMED