Iterative methods for parallel convex optimization with fixed point constraints

DOI10.23952/JNVA.3.2019.2.01zbMath1433.90116OpenAlexW4250090602MaRDI QIDQ5244136

Takayuki Jimba, Kaito Sakurai, Hideaki Iiduka

Publication date: 20 November 2019

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.3.2019.2.01

zbMATH Keywords

fixed pointparallel algorithmproximal point algorithmHalpern algorithmKrasnoselskiĭ-Mann algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (3)

Iterative algorithms for system of variational inclusions in Hadamard manifolds ⋮ A fixed point result for mean nonexpansive mappings ⋮ Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
• Iterative approximation of fixed points
• The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
• Approximation of fixed points of nonexpansive mappings
• A theorem on maximal monotonic sets in Hilbert space
• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
• Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
• Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
• Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
• Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
• Fixed points of nonexpanding maps
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Mean Value Methods in Iteration
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Iterative methods for parallel convex optimization with fixed point constraints