A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing

DOI10.1007/s11075-020-00985-8zbMath1465.65026arXiv1902.09135OpenAlexW3048684693MaRDI QIDQ2028037

Peipei Tang, Zheng Ma, Longfei Ren, Cheng-Jing Wang

Publication date: 31 May 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.09135

zbMATH Keywords

total variationhyperspectral imagingsymmetric Gauss-Seidelsemi-proximal alternating direction method of multiplierssparse unmixing

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)

Uses Software

• condat_tv

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• Total variation reconstruction from quadratic measurements
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• Implicit Functions and Solution Mappings
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Matrix Analysis
• Some continuity properties of polyhedral multifunctions
• Variational Analysis
• Joint Bayesian Endmember Extraction and Linear Unmixing for Hyperspectral Imagery
• A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
• A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal Admms for Convex Composite Programming
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• A Generalized Accelerated Proximal Gradient Approach for Total-Variation-Based Image Restoration
• Total Variation Structured Total Least Squares Method for Image Restoration
• Convex Analysis
• 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: A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing