Phase analysis of titanium in steel has been carried out on thirty samples with different Ticontent from 0. 036 %-0. 204% . The various heat treatments for the samples are to anneal at 1050-1200 ℃ for a while ,follo...Phase analysis of titanium in steel has been carried out on thirty samples with different Ticontent from 0. 036 %-0. 204% . The various heat treatments for the samples are to anneal at 1050-1200 ℃ for a while ,followed by cooling at a rate of 1 . 10, 20 ℃/s ,respectively.It is achieved to separate and determine fine particle TiC ,coarse particle Ti_2CS and TiN ex-tracted from steel by controlling the oxidation potential and acidity of solutions.The results of quantrtative analysis of the individual phase show that 0. 09 %- 0. 13 % Ti-contentis enough to eliminate free nitrogen and transform MnS into Yi_2CS in steel effectively. In the case of0. 06 %- 0. 10 % Ti-content combined with annealing at 1050℃. and quick cooling at 20 ℃/s ,a prop-er amount of fine particle TiC can be precipitated and the rate of TiC (fine )/TiC (total )is high ,which arebeneficial to increase strength and toughness of steel. More Ti-content or cooling slowly will preciprtatemore coarse particle TiC which decreaces toughness severely. The proposed methods for quantitativephase analysis of titanium in steel are given in detail.展开更多
This paper presents a new algorithm for optimization problems with nonlinear inequality constricts. At each iteration, the algorithm generates the search direction by solving only one quadratic programming (QP), and ...This paper presents a new algorithm for optimization problems with nonlinear inequality constricts. At each iteration, the algorithm generates the search direction by solving only one quadratic programming (QP), and then making a simple correction for the solution of the QP, moreover this new algorithm needn’t to do searching. The other advantage is that it may not only choose any point in En as a starting point, but also escape from the complex penalty function and diameter. moreover the iteration point will be a feasible descent sequence whenever some iteration point gets into the feasible region. So we call it subfeasible method.Under mild assumptions,the new algorithm is shown to possess global and two step superlinear convergence.展开更多
文摘Phase analysis of titanium in steel has been carried out on thirty samples with different Ticontent from 0. 036 %-0. 204% . The various heat treatments for the samples are to anneal at 1050-1200 ℃ for a while ,followed by cooling at a rate of 1 . 10, 20 ℃/s ,respectively.It is achieved to separate and determine fine particle TiC ,coarse particle Ti_2CS and TiN ex-tracted from steel by controlling the oxidation potential and acidity of solutions.The results of quantrtative analysis of the individual phase show that 0. 09 %- 0. 13 % Ti-contentis enough to eliminate free nitrogen and transform MnS into Yi_2CS in steel effectively. In the case of0. 06 %- 0. 10 % Ti-content combined with annealing at 1050℃. and quick cooling at 20 ℃/s ,a prop-er amount of fine particle TiC can be precipitated and the rate of TiC (fine )/TiC (total )is high ,which arebeneficial to increase strength and toughness of steel. More Ti-content or cooling slowly will preciprtatemore coarse particle TiC which decreaces toughness severely. The proposed methods for quantitativephase analysis of titanium in steel are given in detail.
文摘This paper presents a new algorithm for optimization problems with nonlinear inequality constricts. At each iteration, the algorithm generates the search direction by solving only one quadratic programming (QP), and then making a simple correction for the solution of the QP, moreover this new algorithm needn’t to do searching. The other advantage is that it may not only choose any point in En as a starting point, but also escape from the complex penalty function and diameter. moreover the iteration point will be a feasible descent sequence whenever some iteration point gets into the feasible region. So we call it subfeasible method.Under mild assumptions,the new algorithm is shown to possess global and two step superlinear convergence.
