Proceedings of the 2020 3rd International Conference on Computer Science and Software Engineering 2020
DOI: 10.1145/3403746.3403900
|View full text |Cite
|
Sign up to set email alerts
|

The distributed Gauss-Newton methods for solving the inverse of approximated Hessian with application to target localization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…We reconstruct the lightning channel geometry of clouds and ground flashes by locating the temporal and spatial changes of the lightning source [17] and use the thunder channel reconstruction model of three, four, and five microphone systems to calculate the error accuracy. Wu, et al [18] used a wireless sensor network with random topology, which is used to solve the problem of target location. Through special decomposition technology to exchange local information with neighboring anchor nodes, the centralized Gauss-Newton method is modified into a distributed solution, which has the ability to resist environmental noise while ensuring convergence.…”
Section: Related Workmentioning
confidence: 99%
“…We reconstruct the lightning channel geometry of clouds and ground flashes by locating the temporal and spatial changes of the lightning source [17] and use the thunder channel reconstruction model of three, four, and five microphone systems to calculate the error accuracy. Wu, et al [18] used a wireless sensor network with random topology, which is used to solve the problem of target location. Through special decomposition technology to exchange local information with neighboring anchor nodes, the centralized Gauss-Newton method is modified into a distributed solution, which has the ability to resist environmental noise while ensuring convergence.…”
Section: Related Workmentioning
confidence: 99%
“…The rank-one relaxation may lead to produce a suboptimal solution that is not the optimal solution of the original optimization problem. To obtain the rank-one solution of the convex SDP problem, many mathematical methods are proposed to deal with the troublesome problem [45]- [48]. To solve the low-rank SDP problems, the factorization method is introduced by obtaining a reformulation of the original SDP problem in [49].…”
Section: Related Workmentioning
confidence: 99%