Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
From MaRDI portal
(Redirected from Publication:5300515)
Recommendations
- Distributed Optimization in Networked Systems
- scientific article; zbMATH DE number 4081262
- Distributed optimization over networks
- A distributed algorithm for convex network optimization problems
- Distributed stochastic algorithm for global optimization in networked system
- A dual approach for optimal algorithms in distributed optimization over networks
- Distributed fixed-time optimization for multi-agent systems over a directed network
- A study on distributed optimization over large-scale networked systems
- Distributed optimization: advances in theories, methods, and applications
- A distributed optimization algorithm in connection-less networks
Cited in
(74)- An inertial Mann algorithm for nonexpansive mappings
- Distributed stochastic algorithm for global optimization in networked system
- A modified iterative method for a finite collection of non-self mappings and a family of variational inequality problems
- A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- New algorithms for a class of accretive variational inequalities in Banach spaces
- Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- 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
- Decentralized hierarchical constrained convex optimization
- Inertial Krasnosel'skiǐ-Mann type hybrid algorithms for solving hierarchical fixed point problems
- An iterative method and its application to stable inversion
- Explicit iteration methods for solving variational inequalities in Banach spaces
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- New strong convergence theorems for split variational inclusion problems in Hilbert spaces
- EFIX: exact fixed point methods for distributed optimization
- Optimization for Inconsistent Split Feasibility Problems
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- 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
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
- Distributed Optimization With Local Domains: Applications in MPC and Network Flows
- Multiuser optimization: distributed algorithms and error analysis
- 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 sequential constraint method for solving variational inequality over the intersection of fixed point sets
- A steepest-descent Krasnosel'skii-Mann algorithm for a class of variational inequalities in Banach spaces
- scientific article; zbMATH DE number 5283386 (Why is no real title available?)
- scientific article; zbMATH DE number 4081262 (Why is no real title available?)
- Algorithms and Convergence Theorems for Mixed Equilibrium Problems in Hilbert Spaces
- A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
- A distributed optimization algorithm in connection-less networks
- Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems
- Iterative algorithms for split equilibrium problems of monotone operators and fixed point problems of pseudo-contractions
- Two proximal-type algorithms for nonsmooth convex optimization over fixed point sets of nonexpansive mappings
- Steepest-descent Ishikawa iterative methods for a class of 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
- Path-based incremental target level algorithm on Riemannian manifolds
- Iterative methods for parallel convex optimization with fixed point constraints
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
- Variational Inequalities Over the Intersection of Fixed Point Sets of Generalized Demimetric Mappings and Zero Point Sets of Maximal Monotone Mappings
- An asynchronous subgradient-proximal method for solving additive convex optimization problems
- Inertial accelerated steepest descent algorithm for generalized split common fixed point problems
- Two new algorithms to solve the system of generalized mixed equilibrium and fixed point problems in Banach spaces
- Distributed Optimization in Networked Systems
- An efficient self-adaptive algorithm for finding common solutions to pseudomonotone variational inequalities and split fixed point problems in Hilbert spaces
- A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
- Inertial methods for split common fixed point problems: application to binary classification in machine learning
- An inertial iterative regularization method for a class of variational inequalities
- Relaxed projection methods for solving variational inequality problems
- A first order dynamical system and its discretization for a class of variational inequalities
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- A relaxed projection method for solving bilevel variational inequality problems
- Strong convergence results of two-step inertial projection algorithms for solving variational inequality problem
- Viscosity-type algorithms with acceleration techniques for variational inequalities and demicontractive mappings with applications in cybersecurity investments and classification problems
- Alternated and multi-step inertial algorithm with three-term conjugate gradient-like direction for split feasibilities with applications in classification problems and elastic net
- Two novel two-step inertial algorithms for a class of bilevel variational inequalities
- Halpern-type relaxed algorithms with alternated and multi-step inertia for split feasibility problems with applications in classification problems
- Modified general inertial Mann and general inertial viscosity algorithms for fixed point and common fixed point problems with applications
- Convergence theorems for common solutions of nonlinear problems and applications
- A self adaptive inertial algorithm for solving variational inequalities over the solution set of the split variational inequality problem
- An inertial-type algorithm for a class of bilevel variational inequalities with the split variational inequality problem constraints
- Strongly convergent two-step inertial algorithm for a class of bilevel variational inequalities
- Relaxed two-step inertial method for solving a class of split variational inequality problems with application to traffic analysis
- Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
- A three-intermixed algorithm for common fixed point problems with applications to convex optimization and network allocation
This page was built for publication: Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300515)
