Monotone operator theory in convex optimization

@article{Combettes2018MonotoneOT,
  title={Monotone operator theory in convex optimization},
  author={P. L. Combettes},
  journal={Mathematical Programming},
  year={2018},
  volume={170},
  pages={177-206}
}
  • P. L. Combettes
  • Published 2018
  • Mathematics, Computer Science
  • Mathematical Programming
Several aspects of the interplay between monotone operator theory and convex optimization are presented. The crucial role played by monotone operators in the analysis and the numerical solution of convex minimization problems is emphasized. We review the properties of subdifferentials as maximally monotone operators and, in tandem, investigate those of proximity operators as resolvents. In particular, we study new transformations which map proximity operators to proximity operators, and… Expand
Bregman Forward-Backward Operator Splitting
We propose an iterative method for finding a zero of the sum of two maximally monotone operators in reflexive Banach spaces. One of the operators is single-valued, and the method alternates anExpand
Douglas-Rachford Splitting for Pathological Convex Optimization
Despite the vast literature on DRS, there has been very little work analyzing their behavior under pathologies. Most analyses assume a primal solution exists, a dual solution exists, and strongExpand
Fast convergence of generalized forward-backward algorithms for structured monotone inclusions
In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classicalExpand
Proximal splitting algorithms: Relax them all!
Convex optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, proximal splitting algorithms are particularly adequate: they consist ofExpand
Fixing and extending some recent results on the ADMM algorithm
TLDR
A variant of the ADMM algorithm is formulated that is able to handle convex optimization problems involving an additional smooth function in its objective, and which is evaluated through its gradient. Expand
Evolution inclusions with time-dependent maximal monotone operators
This article studies the solutions of time-dependent differential inclusions which is motivated by their utility in the modeling of certain physical systems. The differential inclusion is describedExpand
Douglas-Rachford splitting and ADMM for pathological convex optimization
TLDR
It is established that DRS only requires strong duality to work, in the sense that asymptotically iterates are approximately feasible and approximately optimal. Expand
Accelerated proximal point method for maximally monotone operators
  • D. Kim
  • Mathematics, Computer Science
  • 2019
TLDR
The proximal point method includes various well-known convex optimization methods, such as the proximal method of multipliers and the alternating direction method ofmultipliers, and thus the proposed acceleration has wide applications. Expand
Accelerated Proximal Point Method and Forward Method for Monotone Inclusions
This paper proposes an accelerated proximal point method for maximally monotone operators. The proof is computer-assisted via the performance estimation problem approach. The proximal point methodExpand
A Stochastic Operator Framework for Inexact Static and Online Optimization
TLDR
A unified stochastic operator framework is provided to analyze the convergence of iterative optimization algorithms for both static problems and online optimization and learning and results in terms of convergence in mean and in high-probability are presented. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 144 REFERENCES
A survey on operator splitting and decomposition of convex programs
TLDR
This work focuses on the numerical sensitivity of these algorithms with respect to the scaling parameters that drive the regularizing terms, in order to accelerate convergence rates for different classes of models. Expand
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
This book provides a largely self-contained account of the main results of convex analysis and optimization in Hilbert space. A concise exposition of related constructive fixed point theory isExpand
On Douglas–Rachford operators that fail to be proximal mappings
TLDR
This work considers the class of symmetric linear relations that are maximally monotone and proves the striking result that the Douglas–Rachford operator is generically not a proximal mapping. Expand
Convex Functions, Monotone Operators and Differentiability
These notes start with an introduction to the differentiability of convex functions on Banach spaces, leading to the study of Asplund spaces and their intriguing relationship to monotone operatorsExpand
Solving monotone inclusions via compositions of nonexpansive averaged operators
A unified fixed point theoretic framework is proposed to investigate the asymptotic behavior of algorithms for finding solutions to monotone inclusion problems. The basic iterative scheme underExpand
Asplund Decomposition of Monotone Operators
TLDR
It is established that representations of a monotone mapping are established as the sum of a maximal subdifferential mapping and a “remainder” monot one mapping, where the remainder is “acyclic” in the sense that it contains no nontrivial sub differential component. Expand
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
The principle underlying this paper is the basic observation that the problem of simultaneously solving a large class of composite monotone inclusions and their duals can be reduced to that ofExpand
A Dykstra-like algorithm for two monotone operators
Dykstra’s algorithm employs the projectors onto two closed convex sets in a Hilbert space to construct iteratively the projector onto their intersection. In this paper, we use a duality argument toExpand
On Borwein--Wiersma Decompositions of Monotone Linear Relations
TLDR
This paper presents a detailed study of the Borwein-Wiersma decomposition of a maximal monotone linear relation, and gives sufficient conditions and characterizations for a maximalmonotonelinear relation to be BorweIn-Wiresma decomposable and shows that Borwe in-Wierscher decomposition implies Asplund decomposability. Expand
A splitting algorithm for dual monotone inclusions involving cocoercive operators
  • B. Vu
  • Mathematics, Computer Science
  • Adv. Comput. Math.
  • 2013
TLDR
This work considers the problem of solving dual monotone inclusions involving sums of composite parallel-sum type operators and exploits explicitly the properties of the cocoercive operators appearing in the model. Expand
...
1
2
3
4
5
...