Solving Coupled Composite Monotone Inclusions by Successive Fejér Approximations of their Kuhn--Tucker Set

DOI10.1137/130950616zbMath1315.47057arXiv1312.6696OpenAlexW2019437904MaRDI QIDQ5245378

Patrick L. Combettes, Naseer Shahzad, Abdullah M. Alotaibi

Publication date: 8 April 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

dualitymonotone operatorprimal-dual algorithmsplitting algorithmmonotone inclusionFejér monotonicity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Variational and other types of inclusions (47J22)

Related Items

Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators ⋮ Projective splitting as a warped proximal algorithm ⋮ On globally Q-linear convergence of a splitting method for group Lasso ⋮ A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions ⋮ Preconditioned three-operator splitting algorithm with applications to image restoration ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems ⋮ Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery ⋮ Warped proximal iterations for monotone inclusions ⋮ An inertial primal‐dual fixed point algorithm for composite optimization problems ⋮ Stochastic projective splitting ⋮ Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ Unnamed Item ⋮ Fixing and extending some recent results on the ADMM algorithm ⋮ A new splitting method for monotone inclusions of three operators ⋮ Proximal primal-dual best approximation algorithm with memory ⋮ A primal-dual dynamical approach to structured convex minimization problems ⋮ Weak convergence of an extended splitting method for monotone inclusions ⋮ Single-forward-step projective splitting: exploiting cocoercivity ⋮ Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions ⋮ Data-Driven Nonsmooth Optimization ⋮ Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications ⋮ Projective splitting with forward steps only requires continuity ⋮ Convergence Rates for Projective Splitting ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Dualize, split, randomize: toward fast nonsmooth optimization algorithms ⋮ Projective splitting with forward steps