Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Review

2018

Review

2018

In decentralized optimization, nodes cooperate to minimize an overall objective function that is the sum (or average) of per-node… Expand

Is this relevant?

Review

2017

Review

2017

ABSTRACT This tutorial provides a gentle introduction to kernel density estimation (KDE) and recent advances regarding confidence… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

We propose a new stochastic gradient method for optimizing the sum of a finite set of smooth functions, where the sum is strongly… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

The particle swarm optimization algorithm is analyzed using standard results from the dynamic system theory. Graphical parameter… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

It is well known that the analysis of the large-time asymptotics of Fokker-Planck type equations by the entropy method is closely… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

There are two sources of inconsistency in existing cross-country empirical work on growth: correlated individual effects and… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain… Expand

Is this relevant?

Highly Cited

1983

Highly Cited

1983

Is this relevant?

Highly Cited

1983

Highly Cited

1983

Is this relevant?