An efficient algorithm for batch images alignment with adaptive rank-correction term
From MaRDI portal
Publication:1624632
DOI10.1016/j.cam.2018.07.007zbMath1405.90053OpenAlexW2885065054MaRDI QIDQ1624632
Shuangyue Wang, Zheng-Fen Jin, Yun-hai Xiao
Publication date: 16 November 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.07.007
alternating direction method of multipliersnon-smooth convex minimizationsymmetric Gauss-Seidel iterationaccelerated proximal gradient algorithmbatch images alignment
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem
- TILT: transform invariant low-rank textures
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This page was built for publication: An efficient algorithm for batch images alignment with adaptive rank-correction term
