Searcharxiv⌕ Search

arXiv subjects

Mehdi Salimi

Publications and source records attributed to Mehdi Salimi.

At least 19 recordsLinked to original sources
arXiv2026

New strategies for some pursuit-evasion differential games with Gronwall-type constraints

This paper studies a class of non-cooperative pursuit-evasion differential games in the sequence space $l_{2}.$ The motions of the pursuer and the evader are described by certain first-order differential equations while their control functions are subject to Gronwall-type constraints which impose history-dependent bounds on their control resources. Two fundamental problems are investigated. For the pursuit problem, new strategy for the pursuer is constructed and sufficient conditions guaranteeing the completion of pursuit are established. For evasion problem, an admissible strategy of the evader ensuring avoidance of capture is obtained, and corresponding sufficient conditions for successful evasion are derived. The proposed approached extends existing results on differential games with classical geometric and integral constraints to a broader class of systems governed by Gronwall-type restrictions.

math.OC↗
arXiv2026

Interception Conditions in Multi-Agent Pursuit Games Governed by Linear Dynamics with Gronwall-type Constraints

This paper investigates a multi-agent pursuit problem in which a group of pursuers seeks to intercept one or more evaders within a fixed operational time horizon. The motion of both pursuers and evaders is described by first-order linear differential equations, and the control inputs available to the agents are subject to Gronwall-type constraints. Pursuit is considered successful when at least one pursuer reaches the position of each evader at a finite time within the prescribed duration. Within this framework, we construct permissible strategies for the pursuers and derive sufficient conditions under which interception is guaranteed despite the evaders' counteractions. To support the theoretical results, we present numerical examples that demonstrate the effectiveness of the proposed strategies and confirm the analytical conditions for successful pursuit.

math.OC↗
arXiv2026

Analysis of First-Order Linear Pursuit and Evasion Differential Games with Gronwall-Type Constraints

We examine pursuit and evasion problems in the space $ \mathbb{R}^{n} $ involving a lone pursuer and evader. Motion of each player is governed by a first-order linear differential equation. The players' control functions are subject to the Gronwall-type inequality. The game's duration is fixed and represented by a positive number $\vartheta $. When the state of a pursuer coincides with that of the evader, we then say the pursuit is completed. On the contrary, evasion is possible when throughout the game there is no agreement between the states of pursuer and evader. The result obtained related to the pursuit problem depends on the attainability domains of the two players. On the other hand, one sufficient condition is given for evasion to be possible.

math.OC↗
arXiv2026

Solution and Optimal Strategies for a Differential Game of Pursuit-Evasion with Point-Wise Constraints

This work study a differential game of pursuit-evasion involving countably many pursuers $p_{1},p_{2},\cdots,p_{m}$ and a single evader $e$ under point-wise (geometric) constraints in the sequence space $l_{2}.$ The pursuers evolve according to specified differential equations of $1^{st}$ order while the evader follows a $2^{nd}$ order differential equation. The game period is a fixed time interval of length $\theta$ unit of time. The minimum distance between evader and the pursuer at the terminal time denotes the game payoff. The pursuers aim is to minimize the payoff, whereas the evader seeks to maximize it. We obtain the solution of the game, including optimal strategies of the players construction, as well as game value estimation.

math.OC↗
arXiv2020

Pursuit-Evasion Game with Hybrid System of Dynamics

We consider a pursuit-evasion differential game with a Hybrid system of dynamics in Hilbert space with integral constraints on the control functions of players. We show that the pursuer has a winning strategy.

math.OC↗
arXiv2020

Pursuit Game for an Infinite System of First-Order Differential Equations with Negative Coefficients

In this paper we study a linear pursuit differential game described by an infinite system of first-order differential equations in Hilbert space. The control functions of players are subject to geometric constraints. The pursuer attempts to bring the system from a given initial state to the origin for a finite time and the evader's purpose is opposite. We obtain a guaranteed pursuit time and construct a strategy for pursuer.

math.OC↗
arXiv2016

An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics

We present a three-point iterative method without memory for solving nonlinear equations in one variable. The proposed method provides convergence order eight with four function evaluations per iteration. Hence, it possesses a very high computational efficiency and supports Kung and Traub's conjecture. The construction, the convergence analysis, and the numerical implementation of the method will be presented. Using several test problems, the proposed method will be compared with existing methods of convergence order eight concerning accuracy and basin of attraction. Furthermore, some measures are used to judge methods with respect to their performance in finding the basin of attraction.

math.NA↗
arXiv2015

An optimal class of eighth-order iterative methods based on Kung and Traub's method with its dynamics

In this paper, we present a three-point without memory iterative method based on Kung and Traub's method for solving non-linear equations in one variable. The proposed method has eighth-order convergence and costs only four function evaluations each iteration which supports the Kung-Traub conjecture on the optimal order of convergence. Consequently, this method possesses very high computational efficiency. We present the construction, the convergence analysis, and the numerical implementation of the method. Furthermore, comparisons with some other existing optimal eighth-order methods concerning accuracy and basins of attraction for several test problems will be given.

math.NA↗
arXiv2015

Computing multiple zeros by using a parameter in Newton-Secant method

In this paper, we modify the Newton-Secant method with third order of convergence for finding multiple roots of nonlinear equations. Per iteration this method requires two evaluations of the function and one evaluation of its first derivative. This method has the efficiency index equal to $3^{\frac{1}{3}}\approx 1.44225$. We describe the analysis of the proposed method along with numerical experiments including comparison with existing methods. Moreover, the dynamics of the proposed method are shown with some comparisons to the other existing methods.

math.NA↗
arXiv2015

A dynamic Stackelberg game for green supply chain management

In this paper, we establish a dynamic game to allocate CSR (Corporate Social Responsibility) to the members of a supply chain. We propose a model of a three-tier supply chain in a decentralized state which includes a supplier, a manufacturer and a retailer. For analyzing supply chain performance in decentralized state and the relationships between the members of the supply chain, we use a Stackelberg game and consider in this paper a hierarchical equilibrium solution for a two-level game. In particular, we formulate a model that crosses through multi-periods with the help of a dynamic discrete Stackelberg game. We obtain an equilibrium point at which both the profits of members and the level of CSR taken up by supply chains is maximized.

math.OC↗
arXiv2015

Differential game of many pursuers with integral constraints on a convex set in the plane

We study a simple motion differential game of many pursuers and one evader in the plane. We give a nonempty closed convex set in the plane, and the pursuers and evader move on this set. They cannot leave this set during the game. Control functions of players are subject to coordinate-wise integral constraints. If the state of the evader $y$, coincides with that of a pursuer $x_i$, $i=\{1,...,m\}$, at some time $t_i$ (unspecified), i.e. $x_i(t_i)=y(t_i)$, then we say that pursuit is completed. We obtain some conditions under which pursuit can be completed from any position of the players in the given set. Moreover, we construct strategies for the pursuers.

math.OC↗
arXiv2015

A dynamic game on Green Supply Chain Management

In this paper, we establish a dynamic game to allocate CSR (Corporate Social Responsibility) to the members of a supply chain. We propose a model of three-tier supply chain in decentralized state that is including supplier, manufacturer and retailer. For analyzing supply chain performance in decentralized state and the relationships between the members of supply chain, we use Stackelberg game and we consider in this paper a hierarchical equilibrium solution for a two-level game. Specially, we formulate a model that crosses through multi-periods by a dynamic discreet Stackelberg game. We try to obtain an equilibrium point at where both the profits of members and the level of CSR taken by supply chains are maximized.

math.OC↗
arXiv2014

New modification of Maheshwari method with optimal eighth order of convergence for solving nonlinear equations

In this paper, we present a family of three-point with eight-order convergence methods for finding the simple roots of nonlinear equations by suitable approximations and weight function based on Maheshwari method. Per iteration this method requires three evaluations of the function and one evaluation of its first derivative. This class of methods has the efficiency index equal to $8^{\frac{1}{4}}\approx 1.682$. We describe the analysis of the proposed methods along with numerical experiments including comparison with existing methods.

math.NA↗
arXiv2014

Solving nonlinear equations by a derivative-free form of the King's family with memory

In this paper, we present an iterative three-point method with memory based on the family of King's methods to solve nonlinear equations. This proposed method has eighth order convergence and costs only four function evaluations per iteration which supports the Kung-Traub conjecture on the optimal order of convergence. An acceleration of the convergence speed is achieved by an appropriate variation of a free parameter in each step. This self accelerator parameter is estimated using Newton's interpolation polynomial of fourth degree. The order of convergence is increased from 8 to 12 without any extra function evaluation. Consequently, this method, possesses a high computational efficiency. Finally, a numerical comparison of the proposed method with related methods shows its effectiveness and performance in high precision computations.

math.NA↗
arXiv2014

Optimal Newton-Secant like methods without memory for solving nonlinear equations with its dynamics

We construct two optimal Newton-Secant like iterative methods for solving non-linear equations. The proposed classes have convergence order four and eight and cost only three and four function evaluations per iteration, respectively. These methods support the Kung and Traub conjecture and possess a high computational efficiency. The new methods are illustrated by numerical experiments and a comparison with some existing optimal methods. We conclude with an investigation of the basins of attraction of the solutions in the complex plane.

math.NA↗
arXiv2014

A new class of optimal four-point methods with convergence order 16 for solving nonlinear equations

We introduce a new class of optimal iterative methods without memory for approximating a simple root of a given nonlinear equation. The proposed class uses four function evaluations and one first derivative evaluation per iteration and it is therefore optimal in the sense of Kung and Traub's conjecture. We present the construction, convergence analysis and numerical implementations, as well as comparisons of accuracy and basins of attraction between our method and existing optimal methods for several test problems.

math.NA↗