Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1995-1999  (2)
  • Convex programming  (1)
  • Cytoplasmic effects  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Theoretical and applied genetics 92 (1996), S. 1099-1102 
    ISSN: 1432-2242
    Keywords: Cytoplasmic effects ; Seed and maternal effects ; Rice nutrient quality ; Heritability ; Indica rice
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract Nine cytoplasmic male-sterile lines and five restorer lines were used in an incomplete diallel cross to analyze seed effects, cytoplasmic effects, and maternal gene effects on nutrient quality traits of indica rice (Oryza sauva L.). The results indicated that nutrient quality traits were controlled by cytoplasmic and maternal effects as well as by seed direct effects. Maternal effects for lysine content (LC), lysine index (LI), and the ratio of lysine content to protein content (RLP) were more important than seed direct effects, while protein content (PC) and protein index (PI) were mainly affected by seed direct effects. Cytoplasmic effects accounted for 2.41–20.80% of the total genetic variation and were significant for all nutrient quality traits. Additive genetic effects were much more important than dominance effects for all of the traits studied, so that selection could be applied for these traits in early generations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 117-143 
    ISSN: 1573-2878
    Keywords: Convex programming ; geometric programming ; barrier methods ; interior-point methods ; linear constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a log-barrier based algorithm for linearly constrained convex differentiable programming problems in nonnegative variables, but where the objective function may not be differentiable at points having a zero coordinate. We use an approximate centering condition as a basis for decreasing the positive parameter of the log-barrier term and show that the total number of iterations to achieve an ε-tolerance optimal solution isO(|log(ε)|)×(number of inner-loop iterations). When applied to then-variable dual geometric programming problem, this bound becomesO(n 2 U/ε), whereU is an upper bound on the maximum magnitude of the iterates generated during the computation.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...