5 citations · 16 across the 22 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.OC2015
Almost Sure Convergence of Random Projected Proximal and Subgradient Algorithms for Distributed Nonsmooth Convex Optimization
Hideaki Iiduka
Two distributed algorithms are described that enable all users connected over a network to cooperatively solve the problem of minimizing the sum of all users' objective functions o…
math.OC2015
Convergence Analysis of Iterative Methods for Nonsmooth Convex Optimization over Fixed Point Sets of Quasi-Nonexpansive Mappings
Hideaki Iiduka
This paper considers a networked system with a finite number of users and supposes that each user tries to minimize its own private objective function over its own private constrai…
math.OC2015
Line Search Fixed Point Algorithms Based on Nonlinear Conjugate Gradient Directions: Application to Constrained Smooth Convex Optimization
Hideaki Iiduka
This paper considers the fixed point problem for a nonexpansive mapping on a real Hilbert space and proposes novel line search fixed point algorithms to accelerate the search. The…