A primal-dual method of partial inverses for composite inclusions
From MaRDI portal
(Redirected from Publication:479258)
Abstract: Spingarn's method of partial inverses has found many applications in nonlinear analysis and in optimization. We show that it can be employed to solve composite monotone inclusions in duality, thus opening a new range of applications for the partial inverse formalism. The versatility of the resulting primal-dual splitting algorithm is illustrated through applications to structured monotone inclusions and optimization.
Recommendations
- A partial complement method for approximating solutions of a primal dual fixed-point problem
- Composition duality methods for mixed variational inclusions
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting
- Applications of the method of partial inverses to convex programming: Decomposition
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- scientific article; zbMATH DE number 124640
Cites work
- scientific article; zbMATH DE number 4133840 (Why is no real title available?)
- scientific article; zbMATH DE number 4121779 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- A monotone+skew splitting model for composite monotone inclusions in duality
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- An inexact method of partial inverses and a parallel bundle method
- Applications of the method of partial inverses to convex programming: Decomposition
- Attouch-Théra duality revisited: Paramonotonicity and operator splitting
- Composition duality and maximal monotonicity
- Convex analysis and monotone operator theory in Hilbert spaces
- Duality and stability in extremum problems involving convex functions
- Dualization of Generalized Equations of Maximal Monotone Type
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Monotone Operators and the Proximal Point Algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Partial inverse of a monotone operator
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration
- Smooth methods of multipliers for complementarity problems
- Solving monotone inclusions via compositions of nonexpansive averaged operators
Cited in
(19)- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- An inertial primal‐dual fixed point algorithm for composite optimization problems
- Forward-partial inverse-forward splitting for solving monotone inclusions
- The geometry of monotone operator splitting methods
- A note on primal-dual stability in infinite linear programming
- Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- A survey on operator splitting and decomposition of convex programs
- Best approximation from the Kuhn-Tucker set of composite monotone inclusions
- scientific article; zbMATH DE number 4121779 (Why is no real title available?)
- Preconditioned three-operator splitting algorithm with applications to image restoration
- A unified splitting algorithm for composite monotone inclusions
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- Tikhonov-like methods with inexact minimization for solving linear ill-posed problems
- Monotone operator theory in convex optimization
- Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
This page was built for publication: A primal-dual method of partial inverses for composite inclusions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479258)
