Generalized solutions for the sum of two maximally monotone operators
From MaRDI portal
(Redirected from 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
(21)- Maximality theorems on the sum of two maximal monotone operators and application to variational inequality problems
- The forward-backward algorithm and the normal problem
- The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings
- Strengthened splitting methods for computing resolvents
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- On the Douglas-Rachford algorithm
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
- Directional asymptotics of Fejér monotone sequences
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
- On the range of the Douglas-Rachford operator
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Partial regularization of the sum of two maximal monotone operators
- scientific article; zbMATH DE number 943344 (Why is no real title available?)
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Optimal Control Duality and the Douglas–Rachford Algorithm
- Infeasible and critically feasible optimal control
- Coordinate-update algorithms can efficiently detect infeasible optimization problems
- The range of the Douglas-Rachford operator in infinite-dimensional Hilbert spaces
- On the minimal displacement vector of compositions and convex combinations of nonexpansive mappings
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)