Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1805.00720

The Variable-Order Fractional Calculus of Variations

Ricardo Almeida·Dina Tavares·Delfim F. M. Torres
View original source ↗Read source document ↗Export metadata ↓

Abstract

This book intends to deepen the study of the fractional calculus, giving special emphasis to variable-order operators. It is organized in two parts, as follows. In the first part, we review the basic concepts of fractional calculus (Chapter 1) and of the fractional calculus of variations (Chapter 2). In Chapter 1, we start with a brief overview about fractional calculus and an introduction to the theory of some special functions in fractional calculus. Then, we recall several fractional operators (integrals and derivatives) definitions and some properties of the considered fractional derivatives and integrals are introduced. In the end of this chapter, we review integration by parts formulas for different operators. Chapter 2 presents a short introduction to the classical calculus of variations and review different variational problems, like the isoperimetric problems or problems with variable endpoints. In the end of this chapter, we introduce the theory of the fractional calculus of variations and some fractional variational problems with variable-order. In the second part, we systematize some new recent results on variable-order fractional calculus of (Tavares, Almeida and Torres, 2015, 2016, 2017, 2018). In Chapter 3, considering three types of fractional Caputo derivatives of variable-order, we present new approximation formulas for those fractional derivatives and prove upper bound formulas for the errors. In Chapter 4, we introduce the combined Caputo fractional derivative of variable-order and corresponding higher-order operators. Some properties are also given. Then, we prove fractional Euler-Lagrange equations for several types of fractional problems of the calculus of variations, with or without constraints.

Explore related subjects

math.OCmath.CA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ricardo Almeida, Dina Tavares, Delfim F. M. Torres. 2018-06-17. The Variable-Order Fractional Calculus of Variations. https://doi.org/10.1007/978-3-319-94006-9

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗