Sentence examples for pursuit problems from inspiring English sources

We have also developed a new class of algorithms for solving basis pursuit problems that are especially applicable to lensless imaging.

This research is principally motivated by the historical development of pursuit problems found in the mathematics and science literature, which dates as far back as 1732 and yet continues to be of current interest.

In this paper, an example of the pursuit problem is studied, in which four hunters collaborate to catch a target.

Simulations of this pursuit problem were performed on a continuous action state space, the results of which are displayed, accompanied by a discussion of their outcomes' dependence upon the initial locations of the hunters and the speeds of the hunters and a target.

Thus, the linearly constrained basis pursuit problem has a sole solution and its dual problem is smooth.

In this paper, we present an efficient method with fast global convergence rate to solve the regularized basis pursuit problem.

In this paper, we put forward the modified accelerated Bregman method (MABM) for solving the regularized basis pursuit problem.

Problem (1.7) has a 2-norm in the regularizer term, thus it is considered less sensitive to noise than the basis pursuit problem (1.1).

A practical challenge for the regularized basis pursuit problem is to offer an efficient method to solve the non-smooth optimization problems.

In this paper, a modified accelerated Bregman method (MABM) for solving the regularized basis pursuit problem is considered and analyzed in detail.

The concrete model considered in compressed sensing is the so-called basis pursuit problem [6, 7] min x ∈ ℜ n ∥ x ∥ 1 subject to  A x = b, (1.1).