Luis M. Briceño-Arias
University of Paris
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Luis M. Briceño-Arias.
Siam Journal on Optimization | 2011
Luis M. Briceño-Arias; Patrick L. Combettes
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 of finding a zero of the sum of a maximally monotone operator and a linear skew-adjoint operator. An algorithmic framework is developed for solving this generic problem in a Hilbert space setting. New primal-dual splitting algorithms are derived from this framework for inclusions involving composite monotone operators, and convergence results are established. These algorithms draw their simplicity and efficacy from the fact that they operate in a fully decomposed fashion in the sense that the monotone operators and the linear transformations involved are activated separately at each iteration. Comparisons with existing methods are made and applications to composite variational problems are demonstrated.
Siam Journal on Control and Optimization | 2009
Hedy Attouch; Luis M. Briceño-Arias; Patrick L. Combettes
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions exist. Unlike existing alternating algorithms, which are limited to two variables and linear coupling, our parallel method can handle an arbitrary number of variables as well as nonlinear coupling schemes. The breadth and flexibility of the proposed framework is illustrated through applications in the areas of evolution inclusions, variational problems, best approximation, and network flows.
Journal of Mathematical Imaging and Vision | 2011
Luis M. Briceño-Arias; Patrick L. Combettes; Jean-Christophe Pesquet; Nelly Pustelnik
In recent years, proximal splitting algorithms have been applied to various monocomponent signal and image recovery problems. In this paper, we address the case of multicomponent problems. We first provide closed form expressions for several important multicomponent proximity operators and then derive extensions of existing proximal algorithms to the multicomponent setting. These results are applied to stereoscopic image recovery, multispectral image denoising, and image decomposition into texture and geometry components.
Optimization | 2015
Luis M. Briceño-Arias
We provide two weakly convergent algorithms for finding a zero of the sum of a maximally monotone operator, a cocoercive operator, and the normal cone to a closed vector subspace of a real Hilbert space. The methods exploit the intrinsic structure of the problem by activating explicitly the cocoercive operator in the first step, and taking advantage of a vector space decomposition in the second step. The second step of the first method is a Douglas–Rachford iteration involving the maximally monotone operator and the normal cone. In the second method, it is a proximal step involving the partial inverse of the maximally monotone operator with respect to the vector subspace. Connections between the proposed methods and other methods in the literature are provided. Applications to monotone inclusions with finitely many maximally monotone operators and optimization problems are examined.
arXiv: Optimization and Control | 2013
Luis M. Briceño-Arias; Patrick L. Combettes
We observe that a significant class of Nash equilibrium problems in non-potential games can be associated with monotone inclusion problems. We propose splitting techniques to solve such problems and establish their convergence. Applications to generalized Nash equilibria, zero-sum games, and cyclic proximation problems are demonstrated.
Nonlinear Analysis-theory Methods & Applications | 2012
Luis M. Briceño-Arias
Abstract We propose a splitting method for solving equilibrium problems involving the sum of two bifunctions satisfying standard conditions. We prove that this problem is equivalent to find a zero of the sum of two appropriate maximally monotone operators under a suitable qualification condition. Our algorithm is a consequence of the Douglas–Rachford splitting applied to this auxiliary monotone inclusion. Connections between monotone inclusions and equilibrium problems are studied.
Numerische Mathematik | 2016
Hedy Attouch; Luis M. Briceño-Arias; Patrick L. Combettes
We propose a primal–dual parallel proximal splitting method for solving domain decomposition problems for partial differential equations. The problem is formulated via minimization of energy functions on the subdomains with coupling constraints which model various properties of the solution at the interfaces. The proposed method can handle a wide range of linear and nonlinear problems, with flexible, possibly nonlinear, transmission conditions across the interfaces. Strong convergence in the energy spaces is established in this general setting, and without any additional assumption on the energy functions or the geometry of the problem. Several examples are presented.
Journal of Optimization Theory and Applications | 2015
Luis M. Briceño-Arias
In this paper, we provide a splitting method for finding a zero of the sum of a maximally monotone operator, a Lipschitzian monotone operator, and a normal cone to a closed vector subspace of a real Hilbert space. The problem is characterised by a simpler monotone inclusion involving only two operators: the partial inverse of the maximally monotone operator with respect to the vector subspace and a suitable Lipschitzian monotone operator. By applying the Tseng’s method in this context, we obtain a fully split algorithm that exploits the whole structure of the original problem and generalises partial inverse and Tseng’s methods. Connections with other methods available in the literature are provided, and the flexibility of our setting is illustrated via applications to some inclusions involving
Numerical Functional Analysis and Optimization | 2011
Luis M. Briceño-Arias
international conference on image processing | 2010
Luis M. Briceño-Arias; Patrick L. Combettes; Jean-Christophe Pesquet; Nelly Pustelnik
m