This paper is concerned with the analysis of problems connected with the convergence of optimum seeking procedures, and particularly with the method of planning the rate of convergence and thus influencing the quality of procedures. Local linearization of the relevant dynamic process is performed and quite general results are thus obtained. A solution of multistep algorithms is also presented.