The first algorithm is based on an objective space cut and bound method for solving convex FP problems and the second algorithm is based on the proposed bi-objective algorithm for solving nonlinear FP ...

In this study, a framework for processing gradient algorithms is proposed in accordance with nabla fractional-order system theory. Unlike most of the literature, the gradient algorithm is initially ...

The algorithm not only can achieve good accuracy, uniform error, but also fast calculation speed, which provides a feasible way for the numerical calculation of state space description of fractional ...

Dinkelbach's algorithm [2] solving the parametric equivalent of a fractional program is investigated. It is shown that the algorithm converges superlinearly and often (locally) quadratically.