# Optimization on fractal sets

**Authors:** Nizar Riane, Claire David

arXiv: 1812.02743 · 2018-12-10

## TL;DR

This paper investigates the conditions for the existence of extrema of functions on self-similar fractal sets and introduces a discrete gradient algorithm to locate these extrema.

## Contribution

It provides necessary and sufficient conditions for extrema on fractals and proposes a novel discrete gradient method for their computation.

## Key findings

- Established criteria for extrema existence on fractals
- Developed a discrete gradient algorithm for extremum search
- Demonstrated the algorithm's effectiveness on self-similar sets

## Abstract

We outline necessary and sufficient condition to the existence of extrmas of a function on a self-similar set, and we describe discrete gradient algorithm to find the extrema.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1812.02743/full.md

## Figures

8 figures with captions in the complete paper: https://tomesphere.com/paper/1812.02743/full.md

## References

20 references — full list in the complete paper: https://tomesphere.com/paper/1812.02743/full.md

---
Source: https://tomesphere.com/paper/1812.02743