IF: Iterative Fractional Optimization

Conference Paper (2021)
Author(s)

Sarthak Chatterjee (Rensselaer Polytechnic Institute)

Subhro Das (IBM Research)

Sérgio Pequito (TU Delft - Mechanical Engineering)

Research Group
Team Sergio Pequito
DOI related publication
https://doi.org/10.14428/esann/2021.ES2021-133 Final published version
More Info
expand_more
Publication Year
2021
Language
English
Research Group
Team Sergio Pequito
Pages (from-to)
641-646
Publisher
i6doc.com publication
ISBN (electronic)
9782875870827
Event
29th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2021 (2021-10-06 - 2021-10-08), Virtual, Online, Belgium
Downloads counter
76

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.