Generalized solutions for the sum of two maximally monotone operators
From MaRDI portal
Publication:5494907
Abstract: A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a possibly infeasible system of linear equations. In this paper, we introduce a "normal problem" associated with finding a zero of the sum of two maximally monotone operators. If the original problem admits solutions, then the normal problem returns this same set of solutions. The normal problem may yield solutions when the original problem does not admit any; furthermore, it has attractive variational and duality properties. Several examples illustrate our theory.
Recommendations
- Maximality of the sum of the subdifferential operator and a maximally monotone operator
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators
- A new general approach to resolvent operators and proximal algorithms
- About the maximal monotonicity of the generalized sum of two maximal monotone operators
- Finding a zero of the sum of two maximal monotone operators
Cited in
(19)- scientific article; zbMATH DE number 943344 (Why is no real title available?)
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- The forward-backward algorithm and the normal problem
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
- Infeasible and critically feasible optimal control
- On the minimal displacement vector of compositions and convex combinations of nonexpansive mappings
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
- On the Douglas-Rachford algorithm
- Partial regularization of the sum of two maximal monotone operators
- Optimal Control Duality and the Douglas–Rachford Algorithm
- The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- On the range of the Douglas-Rachford operator
- Directional asymptotics of Fejér monotone sequences
- Maximality theorems on the sum of two maximal monotone operators and application to variational inequality problems
- Strengthened splitting methods for computing resolvents
This page was built for publication: Generalized solutions for the sum of two maximally monotone operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494907)