On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming

DOI10.1007/978-981-16-2701-9_8OpenAlexW3203984361MaRDI QIDQ2073353FDOQ2073353

Authors: Bingsheng He, Xiaoming Yuan 

Publication date: 1 February 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-2701-9_8

zbMATH Keywords

convergence analysisconvex programmingsplitting methodpositive indefinite proximal regularization

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Cites Work

• Title not available (Why is that?)
• Sparsity and Smoothness Via the Fused Lasso
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• Title not available (Why is that?)
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• Multiplier and gradient methods
• Title not available (Why is that?)
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Monotone Operators and the Proximal Point Algorithm
• A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
• Title not available (Why is that?)
• PPA-like contraction methods for convex optimization: a framework using variational inequality approach
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• A strictly contractive Peaceman-Rachford splitting method for convex programming
• On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
• A splitting method for separable convex programming
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
• Proximal Decomposition Via Alternating Linearization
• Optimally linearizing the alternating direction method of multipliers for convex programming
• Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems

Cited In (3)

• Splitting proximal with penalization schemes for additive convex hierarchical minimization problems
• A relaxed proximal ADMM method for block separable convex programming
• Approximate ADMM algorithms derived from Lagrangian splitting

This page was built for publication: On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2073353)