Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
type: Item
instance of: scholarly article
title: Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
zbMATH Open document ID: 1490.90220
author: Nawarat Ekkarntrong
author: Tipsuda Arunrat
author: Nimit Nimana
published in: Journal of Inequalities and Applications
publication date: 2022-01-26T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 47H05
zbMATH DE Number: 7465176
zbMATH Keywords: convergence
zbMATH Keywords: convex
zbMATH Keywords: distributed optimization
zbMATH Keywords: fixed point
MaRDI profile type: Publication
full work available at URL: s13660-021-02734-4
OpenAlex ID: W4200275590
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: First-Order Methods in Optimization
cites work: A descent SQP alternating direction method for minimizing the sum of three convex functions
cites work: Iterative methods for fixed point problems in Hilbert spaces
cites work: An efficient iterative method for finding common fixed point and variational inequalities in Hilbert spaces
cites work: Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
cites work: Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
cites work: Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
cites work: Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
cites work: Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
cites work: Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
cites work: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
cites work: Q5633161
cites work: Hierarchical Convex Optimization With Primal-Dual Splitting
cites work: Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
cites work: Extension of Fenchel's duality theorem for convex functions
cites work: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
cites work: Iterative methods for parallel convex optimization with fixed point constraints
cites work: Convergence analysis for proximal split feasibility problems and fixed point problems
cites work: Robust Wideband Beamforming by the Hybrid Steepest Descent Method
cites work: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
cites work: Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
DOI: 10.1186/S13660-021-02734-4
description: scientific article; zbMATH DE number 7465176