Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
From MaRDI portal
Publication:5300515
DOI10.1137/120866877zbMath1266.49067OpenAlexW2030618034MaRDI QIDQ5300515
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c4ca292b66699b48f79e6c74296da1d98b4e52f0
nonexpansive mappingconjugate gradient methoddistributed optimizationincremental subgradient methodfixed-point optimization algorithmbroadcast optimization algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Numerical methods based on nonlinear programming (49M37)
Related Items (41)
New strong convergence theorems for split variational inclusion problems in Hilbert spaces ⋮ An inertial Mann algorithm for nonexpansive mappings ⋮ Iterative algorithms for split equilibrium problems of monotone operators and fixed point problems of pseudo-contractions ⋮ Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping ⋮ Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping ⋮ Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping ⋮ Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings ⋮ A new explicit iteration method for a class of variational inequalities ⋮ A modified iterative method for a finite collection of non-self mappings and a family of variational inequality problems ⋮ 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 ⋮ A steepest-descent Krasnosel'skii-Mann algorithm for a class of variational inequalities in Banach spaces ⋮ Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing ⋮ Steepest-descent Ishikawa iterative methods for a class of variational inequalities in Banach spaces ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ Variational Inequalities Over the Intersection of Fixed Point Sets of Generalized Demimetric Mappings and Zero Point Sets of Maximal Monotone Mappings ⋮ Explicit iteration methods for solving variational inequalities in Banach spaces ⋮ An asynchronous subgradient-proximal method for solving additive convex optimization problems ⋮ Inertial accelerated steepest descent algorithm for generalized split common fixed point problems ⋮ MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications ⋮ Two new algorithms to solve the system of generalized mixed equilibrium and fixed point problems in Banach spaces ⋮ New algorithms for a class of accretive variational inequalities in Banach spaces ⋮ A hybrid method for solving variational inequalities over the common fixed point sets of infinite families of nonexpansive mappings in Banach spaces ⋮ Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Algorithms and Convergence Theorems for Mixed Equilibrium Problems in Hilbert Spaces ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets ⋮ Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings ⋮ Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints ⋮ Fixed point quasiconvex subgradient method ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ Decentralized hierarchical constrained convex optimization ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Inertial Krasnosel'skiǐ-Mann type hybrid algorithms for solving hierarchical fixed point problems ⋮ Incremental subgradient method for nonsmooth convex optimization with fixed point constraints ⋮ An iterative method and its application to stable inversion ⋮ Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints ⋮ Iterative methods for parallel convex optimization with fixed point constraints ⋮ Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications
This page was built for publication: Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
