Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

DOI10.1007/S11228-011-0191-YzbMATH Open1284.47043arXiv1107.0081OpenAlexW2007437458MaRDI QIDQ452270FDOQ452270

Authors: Patrick L. Combettes, Jean-Christophe Pesquet 

Publication date: 20 September 2012

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Abstract: We propose a primal-dual splitting algorithm for solving monotone inclusions involving a mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian operators. An important feature of the algorithm is that the Lipschitzian operators present in the formulation can be processed individually via explicit steps, while the set-valued operators are processed individually via their resolvents. In addition, the algorithm is highly parallel in that most of its steps can be executed simultaneously. This work brings together and notably extends various types of structured monotone inclusion problems and their solution methods. The application to convex minimization problems is given special attention.

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

Recommendations

• A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
• A monotone+skew splitting model for composite monotone inclusions in duality
• Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms

zbMATH Keywords

splitting algorithmmaximal monotone operatormonotone inclusionnonsmooth convex optimizationparallel sumset-valued duality

Mathematics Subject Classification ID

Convex programming (90C25) Set-valued operators (47H04) Monotone operators and generalizations (47H05) Variational and other types of inclusions (47J22) Iterative procedures involving nonlinear operators (47J25) Decomposition methods (49M27) Numerical methods involving duality (49M29) Duality theory (optimization) (49N15)

Cites Work

• Convex analysis and monotone operator theory in Hilbert spaces
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Signal Recovery by Proximal Forward-Backward Splitting
• Image recovery via total variation minimization and related problems
• Dual norms and image decomposition models
• Title not available (Why is that?)
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
• Dual variational inequalities
• A parallel splitting method for coupled monotone inclusions
• A monotone+skew splitting model for composite monotone inclusions in duality
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Title not available (Why is that?)
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Minimax Theorems and Conjugate Saddle-Functions.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dualization of Generalized Equations of Maximal Monotone Type
• Monotone Operator Methods for Nash Equilibria in Non-potential Games
• A new proximal point iteration that converges weakly but not in norm
• The asymptotic behavior of the composition of two resolvents
• Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
• Duality and stability in extremum problems involving convex functions
• Title not available (Why is that?)
• Composition duality and maximal monotonicity
• Proximity for sums of composite functions
• On the stability of the parallel sum of maximal monotone operators
• The parallel sum of nonlinear monotone operators
• Smooth methods of multipliers for complementarity problems
• Convergence d'un schéma de minimisation alternée
• Title not available (Why is that?)
• Title not available (Why is that?)
• Direct and inverse addition in convex analysis and applications
• Composition duality principles for mixed variational inequalities

Cited In (only showing first 100 items - show all)

• A preconditioning technique for first-order primal-dual splitting method in convex optimization
• New convergence analysis of a primal-dual algorithm with large stepsizes
• Optimization for Inconsistent Split Feasibility Problems
• Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
• A selective linearization method for multiblock convex optimization
• A smooth primal-dual optimization framework for nonsmooth composite convex minimization
• On starting and stopping criteria for nested primal-dual iterations
• Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
• An inertial semi-forward-reflected-backward splitting and its application
• Proximal operator of quotient functions with application to a feasibility problem in query optimization
• Algorithmic versatility of SPF-regularization methods
• On the range of the Douglas-Rachford operator
• Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications
• Local linear convergence analysis of primal-dual splitting methods
• A strongly convergent Krasnosel'skiǐ-Mann-type algorithm for finding a common fixed point of a countably infinite family of nonexpansive operators in Hilbert spaces
• A splitting primal-dual proximity algorithm for solving composite optimization problems
• Regularization with multilevel non-stationary tight framelets for image restoration
• Proximal primal-dual best approximation algorithm with memory
• Bayesian computation: a summary of the current state, and samples backwards and forwards
• A hybrid proximal algorithm for the sum of monotone operators with multivalued mappings
• Single-forward-step projective splitting: exploiting cocoercivity
• Reflected three-operator splitting method for monotone inclusion problem
• Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
• Combined first and second order variational approaches for image processing
• A stochastic variance reduced primal dual fixed point method for linearly constrained separable optimization
• A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
• Solving composite monotone inclusions in reflexive Banach spaces by constructing best Bregman approximations from their Kuhn-Tucker set
• A product space reformulation with reduced dimension for splitting algorithms
• A proximal point method for the sum of maximal monotone operators
• A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
• An efficient primal dual prox method for non-smooth optimization
• Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
• A unified splitting algorithm for composite monotone inclusions
• Convergence analysis of the stochastic reflected forward-backward splitting algorithm
• Recent developments on primal-dual splitting methods with applications to convex minimization
• Random activations in primal-dual splittings for monotone inclusions with a priori information
• Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
• Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
• Alternating forward-backward splitting for linearly constrained optimization problems
• Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
• Dualize, split, randomize: toward fast nonsmooth optimization algorithms
• Four-operator splitting via a forward-backward-half-forward algorithm with line search
• Projective splitting with forward steps
• Iterative regularization via dual diagonal descent
• Convergence analysis of a variable metric forward-backward splitting algorithm with applications
• Convex risk minimization via proximal splitting methods
• Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
• Generalized greedy alternatives
• Convergence analysis of two-step inertial Douglas-Rachford algorithm and application
• Robust regression with compositional covariates
• Multi-step inertial forward-backward-half forward algorithm for solving monotone inclusion
• A convex approach for image restoration with exact Poisson-Gaussian likelihood
• Warped proximal iterations for monotone inclusions
• Alternated inertial forward-backward-forward splitting algorithm
• New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
• An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
• Fast convergence of generalized forward-backward algorithms for structured monotone inclusions
• Stochastic projective splitting
• A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions
• Tseng’s Algorithm with Extrapolation from the past Endowed with Variable Metrics and Error Terms
• The geometry of monotone operator splitting methods
• Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis
• Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
• Equivalent resolvents of Douglas-Rachford splitting and other operator splitting algorithms: a unified degenerate proximal point analysis
• Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
• Two new splitting methods for three-operator monotone inclusions in Hilbert spaces
• The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis
• Alternated inertial fixed point algorithms
• Solution of mismatched monotone+Lipschitz inclusion problems
• A perturbation framework for convex minimization and monotone inclusion problems with nonlinear compositions
• Nonlinear forward-backward splitting with momentum correction
• Preconditioned three-operator splitting algorithm with applications to image restoration
• Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods
• Nonsmooth convex optimization for structured illumination microscopy image reconstruction
• Inertial splitting methods without prior constants for solving variational inclusions of two operators
• Federated primal dual fixed point algorithm
• Tikhonov regularized iterative methods for nonlinear problems
• Accelerated forward–backward algorithms for structured monotone inclusions
• A generalized forward-backward splitting operator: degenerate analysis and applications
• Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
• Forward-primal-dual-half-forward algorithm for splitting four operators
• A stochastic variance reduction algorithm with Bregman distances for structured composite problems
• Primal-dual splittings as fixed point iterations in the range of linear operators
• Practical acceleration of the Condat-Vũ algorithm
• A Variable Metric Forward-Reflected-Douglas-Rachford Method for Solving Monotone Inclusions
• A Nonlinearly Preconditioned Forward-Backward Splitting Method and Applications
• Inertial-relaxed splitting for composite monotone inclusions
• Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
• Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• Projective splitting with forward steps only requires continuity
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Continuous dynamics related to monotone inclusions and non-smooth optimization problems
• A reflected forward-backward splitting method for monotone inclusions involving Lipschitzian operators
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
• A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
• Almost sure convergence of the forward-backward-forward splitting algorithm
• Local behavior of sparse analysis regularization: applications to risk estimation

This page was built for publication: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

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