Gradient-free method for nonsmooth distributed optimization
type: Item
instance of: scholarly article
title: Gradient-free method for nonsmooth distributed optimization
zbMATH Open document ID: 1341.90135
author: Jueyou Li
author: Changzhi Wu
author: Qiang Long
author: Zhiyou Wu
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/61584
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6419082
zbMATH Keywords: distributed algorithm
zbMATH Keywords: Gaussian smoothing
zbMATH Keywords: gradient-free method
zbMATH Keywords: convex optimization
MaRDI profile type: Publication
OpenAlex ID: W2042220749
cites work: Incremental proximal methods for large scale convex optimization
cites work: Distributed asynchronous deterministic and stochastic gradient optimization algorithms
cites work: Q4001523
cites work: Distributed average consensus with least-mean-square deviation
cites work: Incremental subgradient methods for nondifferentiable optimization
cites work: A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
cites work: Constrained Consensus and Optimization in Multi-Agent Networks
cites work: Distributed Subgradient Methods for Multi-Agent Optimization
cites work: Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
cites work: Primal-dual subgradient methods for convex problems
cites work: Dual averaging methods for regularized stochastic learning and online optimization
cites work: Convergence rate for consensus with delays
cites work: Q3546603
cites work: Distributed stochastic subgradient projection algorithms for convex optimization
cites work: Introduction to Stochastic Search and Optimization
cites work: Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
cites work: New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
cites work: Random gradient-free minimization of convex functions
cites work: Global optimization for molecular clusters using a new smoothing approach
cites work: Randomized smoothing for stochastic optimization
cites work: Matrix Analysis
cites work: Robust identification
DOI: 10.1007/S10898-014-0174-2
description: scientific article; zbMATH DE number 6419082