A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem.
D. Russell LukeShoham SabachMarc TeboulleKobi ZatlaweyPublished in: J. Glob. Optim. (2017)
Keyphrases
- globally convergent
- single source
- autocalibration
- objective function
- shortest path problem
- search space
- variational inequalities
- np hard
- dynamic programming
- newton method
- convex hull
- optimal solution
- multi source
- convex optimization
- data fusion
- linear programming
- cost function
- convergence rate
- augmented lagrangian
- worst case