Benchmarking the BFGS algorithm on the BBOB-2009 function testbed

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn 2009-January, Issue , 2009, Pages 2409-2413

  Ros, Raymond ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

benchmarking; BFGS; black box optimization; quasi newton

Indexed keywords

EVOLUTIONARY ALGORITHMS; NEWTON-RAPHSON METHOD; OPTIMIZATION; TESTBEDS;

BFGS; BFGS ALGORITHM; BLACK-BOX OPTIMIZATION; MULTISTART; QUASI-NEWTON; QUASI-NEWTON METHODS; SEARCH SPACE DIMENSION;

BENCHMARKING;

EID: 85131959486     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1570256.1570336     Document Type: Conference Paper

References (7)

1. C. G. Broyden. The convergence of a class of double-rank minimization algorithms. Journal of the Institute of Mathematics and Its Applications, 6:76-90, 1970.
2. S. Finck, N. Hansen, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Presentation of the noiseless functions. Technical Report 2009/20, Research Center PPE, 2009.
3. R. Fletcher. A new approach to variable metric algorithms. Computer journal, 13:317-322, 1970.
4. D. Goldfarb. A family of variable metric updates derived by variational means. Mathematics of Computation, 24:23-26, 1970.
5. N. Hansen, A. Auger, S. Finck, and R. Ros. Real-parameter black-box optimization benchmarking 2009: Experimental setup. Technical Report RR-6828, INRIA, 2009.
6. N. Hansen, S. Finck, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions. Technical Report RR-6829, INRIA, 2009.
7. D. F. Shanno. Conditioning of quasi-newton methods for function minimization. Mathematics of Computation, 24:647-656, 1970.