Discretization and Optimization using Graphs: One-Dimensional Algorithm
Numerical Analysis
2023-06-01 v1 Numerical Analysis
Abstract
We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown values is interpolation on a discrete graph structure. From the discrete graph structure, we build a refined approximation to the function over its domain. This fine approximation can then be used for problems such as optimization, which we illustrate by identifying local minima.
Cite
@article{arxiv.2305.19360,
title = {Discretization and Optimization using Graphs: One-Dimensional Algorithm},
author = {John Paul Ward},
journal= {arXiv preprint arXiv:2305.19360},
year = {2023}
}