Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems

From MaRDI portal
Publication:5253550

DOI10.1137/140965028zbMath1314.65084OpenAlexW1984680242WikidataQ57561958 ScholiaQ57561958MaRDI QIDQ5253550

Kristian Bredies, Hong Peng Sun

Publication date: 27 May 2015

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b1a9aa915718a4620650e3f70bb69d86f67be4fd




Related Items (23)

Multiresolution Parameter Choice Method for Total Variation Regularized TomographyA proximal point analysis of the preconditioned alternating direction method of multipliersA block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applicationsPreconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problemsProximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New TwistsFast non-overlapping domain decomposition methods for continuous multi-phase labeling problemAn accelerated primal-dual iterative scheme for the L 2 -TV regularized model of linear inverse problemsHigher-order total variation approaches and generalisationsFejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasksFast algorithm for image denoising with different boundary conditionsAn introduction to continuous optimization for imagingAnalysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spacesImplementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection OperatorAcceleration of primal-dual methods by preconditioning and simple subproblem proceduresSplitting with Near-Circulant Linear Systems: Applications to Total Variation CT and PETA preconditioned difference of convex algorithm for truncated quadratic regularization with application to imagingThe proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraintsOn Quasi-Newton Forward-Backward Splitting: Proximal Calculus and ConvergenceNon-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergenceOperator Splitting for a Homogeneous Embedding of the Linear Complementarity ProblemSplit-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMMApplication of the Alternating Direction Method of Multipliers to Control Constrained Parabolic Optimal Control Problems and BeyondDegenerate Preconditioned Proximal Point Algorithms



Cites Work


This page was built for publication: Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems