Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization (Q2977631): Difference between revisions

Latest revision as of 16:21, 13 July 2024

scientific article

Language	Label	Description	Also known as
English	Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization	scientific article

Statements

instance of

scholarly article

0 references

title

Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization (English)

0 references

0 references

0 references

18 April 2017

0 references

full work available at URL

https://arxiv.org/abs/1510.07107

0 references

zbMATH Keywords

almost sure convergence

0 references

distributed nonsmooth convex optimization

0 references

metric projection

0 references

proximity operator

0 references

random projection algorithm

0 references

subgradient

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Parallel bucket sorting on graphics processing units based on convex optimization

0 references

On optimal management of resources in distributed networks

0 references

Incremental Subgradient Methods for Nondifferentiable Optimization

0 references

Time-varying network optimization.

0 references

Generalized network design problems. Modeling and optimization.

0 references

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings

0 references

Random algorithms for convex minimization problems

0 references

Stochastic First-Order Methods with Random Constraint Projection

0 references

Q4821981

0 references

Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems

0 references

Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping

0 references

Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings

0 references

Proximal point algorithms for nonsmooth convex optimization with fixed point constraints

0 references

Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Convex analysis and nonlinear optimization. Theory and examples.

0 references

A new class of distributed optimization algorithms: application to regression of distributed data

0 references

Fast linear iterations for distributed averaging

0 references

Combinatorial Matrix Theory

0 references

Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization

0 references

A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping

0 references

Identifiers

zbMATH Open document ID

1393.90077

0 references

DOI

10.1080/02331934.2016.1252914

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2977631

@@ Property / cites work @@
+Parallel bucket sorting on graphics processing units based on convex optimization
+Normal rank
@@ Property / cites work @@
+On optimal management of resources in distributed networks
+Normal rank
@@ Property / cites work @@
+Incremental Subgradient Methods for Nondifferentiable Optimization
+Normal rank
@@ Property / cites work @@
+Time-varying network optimization.
@@ Property / cites work: Time-varying network optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized network design problems. Modeling and optimization.
+Normal rank
@@ Property / cites work @@
+Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
+Normal rank
@@ Property / cites work @@
+Random algorithms for convex minimization problems
+Normal rank
@@ Property / cites work @@
+Stochastic First-Order Methods with Random Constraint Projection
+Normal rank
@@ Property / cites work @@
+Q4821981
@@ Property / cites work: Q4821981 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
+Normal rank
@@ Property / cites work @@
+Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
+Normal rank
@@ Property / cites work @@
+Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
+Normal rank
@@ Property / cites work @@
+Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
+Normal rank
@@ Property / cites work @@
+Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
+Normal rank
@@ Property / cites work @@
+Convex analysis and monotone operator theory in Hilbert spaces
+Normal rank
@@ Property / cites work @@
+Convex analysis and nonlinear optimization. Theory and examples.
+Normal rank
@@ Property / cites work @@
+A new class of distributed optimization algorithms: application to regression of distributed data
+Normal rank
@@ Property / cites work @@
+Fast linear iterations for distributed averaging
@@ Property / cites work: Fast linear iterations for distributed averaging / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Matrix Theory
@@ Property / cites work: Combinatorial Matrix Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
+Normal rank
@@ Property / cites work @@
+A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
+Normal rank