The BOBYQA algorithm for bound constrained optimization without derivatives M.J.D. Powell Abstract: BOBYQA is an iterative algorithm for finding a minimum of a function F (x), x ∈ Rn , subject to bounds a ≤ x ≤ b o

First Page		Document Content
Date: 2010-01-11 05:45:45 Conjugate gradient method Numerical linear algebra Vehicle Identification Number		The BOBYQA algorithm for bound constrained optimization without derivatives M.J.D. Powell Abstract: BOBYQA is an iterative algorithm for finding a minimum of a function F (x), x ∈ Rn , subject to bounds a ≤ x ≤ b o Add to Reading List Source URL: www6.cityu.edu.hk Download Document from Source Website File Size: 892,10 KB Share Document on Facebook