Efficient and Convergent Preconditioned ADMM for the Potts Models
From MaRDI portal
Publication:4997355
DOI10.1137/20M1343956MaRDI QIDQ4997355
Jing Yuan, Hong Peng Sun, Xue-Cheng Tai
Publication date: 29 June 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Optimality conditions for minimax problems (49K35) Preconditioners for iterative methods (65F08)
Related Items
A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems ⋮ Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem ⋮ Image segmentation based on the hybrid bias field correction ⋮ Connections between Operator-Splitting Methods and Deep Neural Networks with Applications in Image Segmentation ⋮ Variational image motion estimation by preconditioned dual optimization ⋮ A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fast projection onto the simplex and the \(l_1\) ball
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Global minimization for continuous multiphase partitioning problems using a dual approach
- Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- An algorithm for total variation minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Fixing and extending some recent results on the ADMM algorithm
- Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces
- Discrete orthogonal decomposition and variational fluid flow estimation
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Alternating proximal gradient method for convex minimization
- A proximal point analysis of the preconditioned alternating direction method of multipliers
- A spatially continuous max-flow and min-cut framework for binary labeling problems
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Discrete Total Variation: New Definition and Minimization
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- The Split Bregman Method for L1-Regularized Problems
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Lagrange Multiplier Approach to Variational Problems and Applications
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Convex Approach to Minimal Partitions
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
