Graph-Based Ascent Algorithms for Function Maximization.

Muni Sreenivas Pydi
Muni Sreenivas Pydi

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (2018): 1-8

Cited by: 1|Views5
EI WOS

Abstract:

We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of the graph along a path, and the next iterate is chosen from the neighbors of the current iterate wit...More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments