Tightness of the maximum likelihood semidefinite relaxation for angular synchronization

Maximum likelihood estimation problems are, in general, intractable optimization problems. As a result, it is common to approximate the maximum likelihood estimator (MLE) using convex relaxations. In some cases, the relaxation is tight: it recovers the true MLE. Most tightness proofs only apply to s...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 163; no. 1-2; pp. 145 - 167
Main Authors:	Bandeira, Afonso S., Boumal, Nicolas, Singer, Amit
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2017 Springer Nature B.V
Subjects:	Algorithms Analysis Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Computer science Convex analysis Estimating Estimating techniques Full Length Paper Heuristic Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Maximum likelihood method Noise Numerical Analysis Optimization Phases Semidefinite programming Studies Synchronism Synchronization Theoretical Tightness Angular synchronization Maximum likelihood estimation Semidefinite programming 90C22 (Semidefinite programming) Tightness of convex relaxation 90C26 (Nonconvex programming, global optimization) 62F10 (Point estimation)
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!