A recombinant inbred line （RIL） population of F8 and F9 generations derived from a cross between a typical indica rice （Qishanzhan） and a typical japonica rice （Akihikari） was used to study the difference betwee...A recombinant inbred line （RIL） population of F8 and F9 generations derived from a cross between a typical indica rice （Qishanzhan） and a typical japonica rice （Akihikari） was used to study the difference between morphological differentiation based on phenotype characters and genetic differentiation using indica and japonica specific SSR markers, and to evaluate the relationship between vascular bundle characters and morphological and genetic differentiations. The results showed that the frequency distributions of morphological and genetic differentiations were all inclined to japonica type in the filial generation. The population was more inclined to japonica type based on genetic differentiation than on morphological differentiation. The consistent degrees of classification based on the Cheng’s index, the ratio of large vascular bundle number to small vascular bundle number in panicle neck （RLSVB） and the ratio of large vascular bundle number in the second internode from the top to that in the panicle neck （RLVB） were all about 50% compared with the genetic differentiation, and the consistent degree of the total scores of the Cheng’s index combined with the vascular bundle number ratios was significantly increased to about 80% compared with the genetic differentiation. Therefore, the vascular bundle characters could be used as a helpful supplement for subspecies classification.展开更多
By utilizing the improvement function,we change the nonsmooth convex constrained optimization into an unconstrained optimization,and construct an infeasible quasi-Newton bundle method with proximal form.It should be n...By utilizing the improvement function,we change the nonsmooth convex constrained optimization into an unconstrained optimization,and construct an infeasible quasi-Newton bundle method with proximal form.It should be noted that the objective function being minimized in unconstrained optimization subproblem may vary along the iterations(it does not change if the null step is made,otherwise it is updated to a new function).It is necessary to make some adjustment in order to obtain the convergence result.We employ the main idea of infeasible bundle method of Sagastizabal and Solodov,and under the circumstances that each iteration point may be infeasible for primal problem,we prove that each cluster point of the sequence generated by the proposed algorithm is the optimal solution to the original problem.Furthermore,for BFGS quasi-Newton algorithm with strong convex objective function,we obtain the condition which guarantees the boundedness of quasi-Newton matrices and the R-linear convergence of the iteration points.展开更多
In this paper, we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure. We prove that these methods are globally and linearly convergent and ...In this paper, we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure. We prove that these methods are globally and linearly convergent and discuss the application of the bundle variant in parallel computations.展开更多
基金supported by the National Basic Research Program of China (Grant No.2009CB126007)the ‘948’ Project of China
文摘A recombinant inbred line （RIL） population of F8 and F9 generations derived from a cross between a typical indica rice （Qishanzhan） and a typical japonica rice （Akihikari） was used to study the difference between morphological differentiation based on phenotype characters and genetic differentiation using indica and japonica specific SSR markers, and to evaluate the relationship between vascular bundle characters and morphological and genetic differentiations. The results showed that the frequency distributions of morphological and genetic differentiations were all inclined to japonica type in the filial generation. The population was more inclined to japonica type based on genetic differentiation than on morphological differentiation. The consistent degrees of classification based on the Cheng’s index, the ratio of large vascular bundle number to small vascular bundle number in panicle neck （RLSVB） and the ratio of large vascular bundle number in the second internode from the top to that in the panicle neck （RLVB） were all about 50% compared with the genetic differentiation, and the consistent degree of the total scores of the Cheng’s index combined with the vascular bundle number ratios was significantly increased to about 80% compared with the genetic differentiation. Therefore, the vascular bundle characters could be used as a helpful supplement for subspecies classification.
文摘By utilizing the improvement function,we change the nonsmooth convex constrained optimization into an unconstrained optimization,and construct an infeasible quasi-Newton bundle method with proximal form.It should be noted that the objective function being minimized in unconstrained optimization subproblem may vary along the iterations(it does not change if the null step is made,otherwise it is updated to a new function).It is necessary to make some adjustment in order to obtain the convergence result.We employ the main idea of infeasible bundle method of Sagastizabal and Solodov,and under the circumstances that each iteration point may be infeasible for primal problem,we prove that each cluster point of the sequence generated by the proposed algorithm is the optimal solution to the original problem.Furthermore,for BFGS quasi-Newton algorithm with strong convex objective function,we obtain the condition which guarantees the boundedness of quasi-Newton matrices and the R-linear convergence of the iteration points.
文摘In this paper, we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure. We prove that these methods are globally and linearly convergent and discuss the application of the bundle variant in parallel computations.
