Fractional Calculus Meets Interval Optimization in New Study of Constrained Systems

A new mathematical study is turning heads in the optimization community by tackling a question that sits at the intersection of fractional calculus, interval analysis, and constrained optimal control. Researchers Octavian Postavaru, Antonela Toma, and Savin Treanţă, affiliated with the National University of Science and Technology Politehnica Bucharest and the Academy of Romanian Scientists, have published an open-access paper in Neural Processing Letters that develops optimality criteria for a challenging class of fractional optimization problems in which the objective functions take interval values rather than crisp, single-number values. The work, published on 29 August 2026, carries implications for modeling complex systems whose behavior depends on their own history, with a demonstration focused on the control of artificial neural networks.

The central objects of the study are curvilinear fractional integral cost functionals that are path-independent and built on Riemann–Liouville fractional integrals. In classical calculus, integrals and derivatives describe instantaneous rates of change and accumulated quantities over well-defined intervals. Fractional calculus generalizes these notions to arbitrary, non-integer orders, which allows a mathematical model to retain a weighted memory of the entire past trajectory of a system rather than only its current state. This memory property is precisely what makes fractional operators attractive for describing viscoelastic materials, anomalous diffusion, biological processes, and learning dynamics in neural networks, where present behavior is shaped by a long tail of previous states.

What distinguishes this research is the combination of three difficult ingredients in a single framework. First, the cost functionals are fractional, meaning that the objective being minimized or maximized integrates information over the system’s history through Riemann–Liouville operators. Second, the objective functions are interval-valued, so instead of assigning an exact payoff to each decision, the model works with ranges that capture uncertainty, imprecision, or inherent variability in the data. Third, the optimization is constrained: the admissible trajectories must satisfy a system of partial differential equations and partial differential inequalities, which encode the physical or computational laws governing the system under study. Solving such problems requires optimality conditions that respect all three layers simultaneously.

To handle the interval-valued character of the objectives, the authors employ the concept of LR-optimality, a solution notion widely used in interval optimization. In interval-valued optimization, comparing two intervals is not straightforward, because one interval may be better in terms of its lower bound while worse in terms of its upper bound. The LR ordering addresses this by treating the left and right endpoints of each interval through a partial order, and a point is called locally LR-optimal when no nearby feasible alternative produces an interval objective that dominates it in this ordering. The paper’s key theoretical contribution is a condition, rooted in fractional calculus, under which local LR-optimality can be upgraded to global LR-optimality for the associated variational control problem governed by the PDE and PDI constraints.

This local-to-global result is more than a technical curiosity. In practical optimization, algorithms typically search for local optima because finding global optima directly is computationally prohibitive, especially in infinite-dimensional settings such as variational control problems. A verified condition guaranteeing that a locally optimal solution is in fact globally optimal removes the risk that a numerical method will settle for a merely adequate solution while a substantially better one exists elsewhere in the feasible set. For engineers and applied mathematicians, such a guarantee transforms the reliability of the solutions they can extract from fractional, interval-valued models with differential constraints.

The machinery behind the result draws on the structure of Riemann–Liouville fractional integrals, which accumulate a weighted history of a function with a power-law kernel. Because these operators are nonlocal, the resulting optimality conditions couple the behavior of the solution at every point of the domain with its values across an extended past, rather than producing purely local conditions as in classical variational calculus. The authors show how this nonlocal structure, combined with the path-independence of the curvilinear cost functionals, yields the pivotal condition ensuring that local and global optimality coincide. The constraints, expressed as coupled partial differential equations and inequalities, are handled within the same variational framework, keeping the analysis self-contained.

To demonstrate that the theory is not merely abstract formalism, the paper includes an illustrative example showing how fractional calculus and memory dynamics can be harnessed to model and optimize real-world dynamic processes, specifically in the control of artificial neural networks. Neural networks are natural candidates for fractional modeling: training and inference both exhibit path dependence, in which the network’s current performance reflects an accumulated history of parameter updates and activations. By formulating the network control problem with interval-valued fractional objectives and differential constraints, the framework allows uncertainty in performance measures to be treated explicitly while respecting the dynamical laws that the network must obey.

The use of interval-valued objectives deserves particular attention in an era when machine learning systems are increasingly deployed under uncertainty. A crisp objective function forces a modeler to commit to exact numerical targets, even when data are noisy, measurements are imprecise, or performance criteria are inherently ambiguous. Interval-valued objectives encode this imprecision directly into the mathematics, and the LR-optimality framework then provides a rigorous way to decide when one uncertain outcome is preferable to another. Combining this with fractional memory effects produces a modeling language that is simultaneously uncertainty-aware and history-aware, a combination that few existing optimization frameworks offer in a constrained, distributed-parameter setting.

The publication appears in Neural Processing Letters, a journal whose scope spans neural computation and the mathematical foundations of learning systems, making the venue a fitting home for work that connects fractional variational analysis with neural network control. The article is fully open access under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, and the authors report no funding and no conflicts of interest. The paper was received on 9 October 2025, accepted on 18 August 2026, and released with a permanent DOI, ensuring that the results are immediately citable and accessible to the research community.

For the broader field, the study signals a maturing of fractional optimization as a practical tool rather than a purely theoretical pursuit. By establishing when local guarantees extend globally, and by doing so in the presence of interval uncertainty and differential constraints, the Bucharest researchers have provided a template that others can follow in areas ranging from control engineering and signal processing to computational neuroscience. As complex systems with memory and uncertainty become central to technology and science, frameworks of this kind are likely to move from the pages of mathematics journals into the toolkits of practitioners designing the next generation of intelligent, adaptive systems.

Subject of Research: Constrained fractional optimization with interval-valued objective functions and Riemann–Liouville fractional integrals

Article Title: A Study of Constrained Fractional Optimization Problems Involving Interval-Valued Functions

Article References: Postavaru, O., Toma, A., & Treanţă, S. (2026). A Study of Constrained Fractional Optimization Problems Involving Interval-Valued Functions. Neural Processing Letters. https://doi.org/10.1007/s11063-026-11884-9

Image Credits: AI Generated

DOI: 10.1007/s11063-026-11884-9

Keywords: fractional optimization, interval-valued functions, Riemann–Liouville fractional integral, LR-optimality, variational control, PDE constraints, fractional calculus, memory effects, artificial neural networks, constrained optimization, Constrained, Fractional