Iterative Minimization Schemes for Solving the Single Source Localization Problem

DOI10.1137/070698014zbMath1180.90242OpenAlexW2039715928MaRDI QIDQ3395023

Amir Beck, Zahar Chikishev, Marc Teboulle

Publication date: 20 August 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070698014

zbMATH Keywords

nonlinear least squaressemidefinite relaxationfixed-point methodsgeneralized trust regionnonsmooth and nonconvex minimizationsingle source location problemWeiszfield algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Related Items

Exact solutions for source localization problem with minimal squared distance error, A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem, A facial reduction approach for the single source localization problem, An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression, Uniqueness and nonuniqueness for the \(L^1\) minimization source localization problem with three measurements, Weiszfeld's method: old and new results, Noisy Euclidean distance matrix completion with a single missing node, A generalized Weiszfeld method for the multi-facility location problem, Euclidean Distance Matrices and Applications, A numerical study of single source localization algorithms for phaseless inverse scattering problems, Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons

Uses Software

• SeDuMi
• GQTPAR