The following pages link to (Q3079674):
Displayed 21 items.
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
- Distributed stochastic subgradient projection algorithms for convex optimization (Q620442) (← links)
- Decentralized algorithm for centralized variational inequalities in network resource allocation (Q662849) (← links)
- Distributed dual averaging method for multi-agent optimization with quantized communication (Q694789) (← links)
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation (Q725796) (← links)
- Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes (Q781032) (← links)
- Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients (Q1717855) (← links)
- A decentralized multi-objective optimization algorithm (Q2032002) (← links)
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems (Q2159429) (← links)
- Cooperative concurrent asynchronous computation of the solution of symmetric linear systems (Q2407864) (← links)
- Zeroth-order feedback optimization for cooperative multi-agent systems (Q2682294) (← links)
- Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods (Q2834559) (← links)
- Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method (Q3389450) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- Distributed Robust Subspace Recovery (Q4685332) (← links)
- The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem (Q5043038) (← links)
- A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks (Q5206938) (← links)
- Strong consistency of random gradient‐free algorithms for distributed optimization (Q5346596) (← links)
- Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)