期刊论文详细信息
Fixexd point theory and applications
Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
Hideaki Iiduka1 
[1] Department of Computer Science, Meiji University, Kanagawa, Japan
关键词: fixed point;    Krasnosel’skiÄ­-Mann algorithm;    nonexpansive mapping;    nonsmooth convex optimization;    parallel algorithm;    subgradient;    65K05;    90C25;    90C90;   
DOI  :  10.1186/s13663-015-0319-0
学科分类:数学(综合)
来源: SpringerOpen
PDF
【 摘 要 】

Nonsmooth convex optimization problems are solved over fixed point sets of nonexpansive mappings by using a distributed optimization technique. This is done for a networked system with an operator, who manages the system, and a finite number of users, by solving the problem of minimizing the sum of the operator’s and users’ nondifferentiable, convex objective functions over the intersection of the operator’s and users’ convex constraint sets in a real Hilbert space. We assume that each of their constraint sets can be expressed as the fixed point set of an implementable nonexpansive mapping. This setting allows us to discuss nonsmooth convex optimization problems in which the metric projection onto the constraint set cannot be calculated explicitly. We propose a parallel subgradient algorithm for solving the problem by using the operator’s attribution such that it can communicate with all users. The proposed algorithm does not use any proximity operators, in contrast to conventional parallel algorithms for nonsmooth convex optimization. We first study its convergence property for a constant step-size rule. The analysis indicates that the proposed algorithm with a small constant step size approximates a solution to the problem. We next consider the case of a diminishing step-size sequence and prove that there exists a subsequence of the sequence generated by the algorithm which weakly converges to a solution to the problem. We also give numerical examples to support the convergence analyses.

【 授权许可】

CC BY   

【 预 览 】
附件列表
Files Size Format View
RO201901227959740ZK.pdf 1785KB PDF download
  文献评价指标  
  下载次数:8次 浏览次数:13次