IF: Iterative Fractional Optimization

Sarthak Chatterjee, Subhro Das, Sérgio Pequito

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

Abstract

Most optimization problems lack closed-form solutions of the argument that minimizes a given function, and even if these were available it might be prohibitive to compute it. As such, we rely on iterative numerical algorithms to find an approximate solution. In this paper, we propose to leverage fractional calculus in the context of time series analysis methods to devise a new iterative algorithm. Specifically, we propose to leverage autoregressive fractional-order integrative moving average time series, whose coefficients encode a proxy for local spatial information. We provide evidence that our algorithm is efficient and particularly suitable for cases where the Hessian is ill-conditioned.

Original languageEnglish
Title of host publicationESANN 2021 Proceedings - 29th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning
Publisheri6doc.com publication
Pages641-646
Number of pages6
ISBN (Electronic)9782875870827
DOIs
Publication statusPublished - 2021
Event29th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2021 - Virtual, Online, Belgium
Duration: 6 Oct 20218 Oct 2021

Publication series

NameESANN 2021 Proceedings - 29th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning

Conference

Conference29th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2021
Country/TerritoryBelgium
CityVirtual, Online
Period6/10/218/10/21

Fingerprint

Dive into the research topics of 'IF: Iterative Fractional Optimization'. Together they form a unique fingerprint.

Cite this