  


A primaldual splitting algorithm for finding zeros of sums of maximally monotone operators
Radu Ioan Bot(radu.botmathematik.tuchemnitz.de) Abstract: We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous operator and a corresponding dual problem formulated by means of the inverse operators. A primaldual splitting algorithm which simultaneously solves the two problems in finitedimensional spaces is presented. The scheme uses at each iteration separately the resolvents of the maximally monotone operators involved and it gives rise to a splitting algorithm for finding the zeros of the sum of compositions of maximally monotone operators with linear continuous operators. The iterative schemes are used for solving nondifferentiable convex optimization problems arising in image processing and in location theory. Keywords: maximally monotone operator, resolvent, operator splitting, subdifferential, minimization algorithm, duality Category 1: Convex and Nonsmooth Optimization (Convex Optimization ) Citation: Download: [PDF] Entry Submitted: 06/26/2012 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  