the properties of adaptive non-parametric kernel estimators for the multivariate probability density $f(x)$ (and its derivatives) of identically distributed random vectors $\varepsilon_n,\ n\geq 1$ at a given point are studied. it is supposed that the vectors $\varepsilon_n,\ n\geq 1$ form a martingale-difference process $(\varepsilon_n)_{n\ge 1}$ and the function to be estimated belongs to a class of densities slightly narrower than the class of densities with the following condition on the highest derivatives of the order $\nu:$ $$ |f^{(\nu)}(y)-f^{(\nu)}(x)|\leq \delta(\|x-y\|),\qquad x,y\in {r^m}, $$ where $\delta(t),\ t\geq 0,$ is some positive, bounded from above, monotonously decreasing for $t,$ small enough unknown function. an asymptotic mean square criterion is proposed. the optimality, in asymptotically minimax sense of adaptive estimators of density derivatives, is proved for a class of the bartlett kernel estimators with a random data-driven bandwidth. it's well-known that the optimization of the asymptotic value of the mean squared error for the bartlett kernel density estimators leads to the optimal bandwidth depending on unknown functions. therefore it is not quite simple to apply these estimators to practice. the paper proposes an adaptive approach to this problem, which is based on the idea of changing the unknown functions in optimal bandwidth by a sequence of estimators converging to the unknown values of these functions. it is shown, that the constructed adaptive kernel estimators keep all the asymptotic properties of the sharp-optimal non-adaptive bartlett estimators. an example of the adaptive estimator, optimal in the sense of the introduced criterion is considered. this estimator has simple structure and may be easily of practical usage in real statistical problems. the proposed estimators possess the property of uniform asymptotic normality and almost sure convergence.