Convergence analysis of REG-ADMM proves fixed points are KKT stationary points of REG-SDP and gives explicit rho for global optimality under clean measurements using tightness of the convex relaxation.
Foundations and Trends R⃝ in Machine Learning 3(1):1–122
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convergence Analysis of Nonconvex ADMM for Rigid Registration
Convergence analysis of REG-ADMM proves fixed points are KKT stationary points of REG-SDP and gives explicit rho for global optimality under clean measurements using tightness of the convex relaxation.