Is there infinite number of prime pairs $(p_k,p_n)$ that satisfy equality $p_n=2p_k-3$
This is surely open. The usual conjecture is that, given a collection of linear equations in primes, if there is no "local" obstacle to it having infinitely many solutions, then it does. Here local obstacles would mean either (1) the size of the real solutions is bounded or (2) there is some prime number $q$ such that any solution has at least one of the $p_i$ divisible by $q$. Green and Tao term this the "generalized Hardy-Littlewood conjecture".
Since neither of these obstacles applies, one would conjecture that there are infinitely many prime pairs of this form. Green and Tao have recently proved that this is true in many cases but your example is not among the cases to which their results apply; in the terminology of their paper, it has "complexity $\infty$". I am fairly certain no progress has been made on the complexity $\infty$ cases.
Note also that your conjecture is extremely close to the conjecture that there are infinitely many Sophie Germain primes, which remains notoriously open.
I highly recommend reading the introduction to Green-Tao for an overview of what can and cannot be done in this area.
maybe there is,it is not proved yet. It is a particular case of a general conjecture concerning linear equations in primes :
Conjecture : Let $a$ and $b$ two integers such that $a>0$, the product $ab$ is even and $a$ and $b$ are coprime. Then the equation $p' =ap+b$ has infinitely many solutions in pairs of prime $(p,p')$.