Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Optimization and Engineering
Erschienen in: Optimization and Engineering 4/2017

19.09.2017

Best practices for comparing optimization algorithms

verfasst von: Vahid Beiranvand, Warren Hare, Yves Lucet

Erschienen in: Optimization and Engineering | Ausgabe 4/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. We provide suggestions for each step of the comparison process and highlight the pitfalls to avoid when evaluating the performance of optimization algorithms. We also discuss various methods of reporting the benchmarking results. Finally, some suggestions for future research are presented to improve the current benchmarking process.
Nächster Artikel Convex optimization of measurement allocation for magnetic tracking systems

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Fußnoten
1
Note that this example is artificially constructed to emphasize the results; the recommended starting point for the Beale test problem is (1, 1).
 
2
Wall clock time refers to the amount of time the human tester has to wait to get an answer from the computer. Conversely, CPU time is the amount of time the CPU spends on the algorithm, excluding operating system tasks and other processes.
 
3
We thank “Mathematics Referee #1” for pointing out that reference.
 
4
We thank “Engineering Referee #3” for pointing out that reference.
 
5
We thank “Mathematics Referee #1” for pointing out this challenge.
 
6
We thank “Engineering Referee #3” and “Mathematics Referee #2” for pointing out this challenge.
 
7
We thank “Mathematics Referee #2” for pointing out this challenge.
 
8
We thank “Mathematics Referee #1” for pointing out this challenge.
 
Literatur
Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J Glob Optim 31(4):635–672MATHMathSciNetCrossRef
Andrei N (2008) An unconstrained optimization test functions collection. Adv Model Optim 10(1):147–161MATHMathSciNet
Audet C, Orban D (2006) Finding optimal algorithmic parameters using derivative-free optimization. SIAM J Optim 17(3):642–664MATHMathSciNetCrossRef
Audet C, Dang CK, Orban D (2010) Algorithmic parameter optimization of the DFO method with the OPAL framework. In: Ken N, Keita T, John C, Reiji S (eds) Software automatic tuning. Springer, New York, pp 255–274
Audet C, Le Digabel S, Peyrega M (2014b) Linear equalities in blackbox optimization. Technical report, Les Cahiers du GERAD
Averick BM, Carter RG, Moré JJ (1991) The MINPACK-2 test problem collection. Technical report, Argonne National Laboratory, Argonne
Balint A, Gall D, Kapler G, Retz R (2010) Experiment design and administration for computer clusters for SAT-solvers (EDACC), system description. J Satisf Boolean Model Comput 7:77–82
Bard Y (1970) Comparison of gradient methods for the solution of nonlinear parameter estimation problems. SIAM J Numer Anal 7(1):157–186MATHMathSciNetCrossRef
Barr RS, Hickman BL (1993) Reporting computational experiments with parallel algorithms: Issues, measures, and experts’ opinions. INFORMS J Comput 5(1):2–18MATHCrossRef
Barr RS, Golden BL, Kelly JP, Resende MGC, Stewart WR Jr (1995) Designing and reporting on computational experiments with heuristic methods. J Heuristics 1(1):9–32MATHCrossRef
Barton RR (1987) Testing strategies for simulation optimization. In Proceedings of the 19th conference on winter simulation, WSC’87, New York, NY, USA. ACM, pp 391–401
Bartz-Beielstein T, Preuss M (2014) Experimental analysis of optimization algorithms: tuning and beyond. In: Borenstein Y, Moraglio A (eds) Theory and principled methods for the design of metaheuristics. Natural computing series. Springer, Berlin, pp 205–245CrossRef
Bartz-Beielstein T, Lasarczyk CWG, Preuss M (2005) Sequential parameter optimization. In: The 2005 IEEE congress on evolutionary computation, vol 1, pp 773–780
Baz M, Hunsaker B, Brooks P, Gosavi A (2007) Automated tuning of optimization software parameters. Technical report, University of Pittsburgh, Department of Industrial Engineering
Beiranvand V, Hare W, Lucet Y, Hossain S (2015) Multi-haul quasi network flow model for vertical alignment optimization. Technical report, Computer Science, University of British Columbia, Kelowna, BC, Canada
Beltrami EJ (1969) A comparison of some recent iterative methods for the numerical solution of nonlinear programs. In: Beckmann M, Künzi HP (eds) Computing methods in optimization problems. Lecture notes in operations research and mathematical economics, vol 14. Springer, Berlin, pp 20–29CrossRef
Benson HY, Shanno DF, Vanderbei RJ (2003) A comparative study of large-scale nonlinear optimization algorithms. In: Di Pillo G, Murli A (eds) High performance algorithms and software for nonlinear optimization. Applied optimization, vol 82. Springer, New York, pp 95–127CrossRef
Benson HY, Shanno DF, Vanderbei RJ (2004) Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing. Math Progr 99:35–48MATHMathSciNetCrossRef
Billups SC, Dirkse SP, Ferris MC (1997) A comparison of large scale mixed complementarity problem solvers. Comput Optim Appl 7(1):3–25MATHMathSciNetCrossRef
Birattari M (2009) Tuning metaheuristics: a machine learning perspective. Springer, Berlin (1st ed. 2005. 2nd printing edition) MATHCrossRef
Bondarenko AS, Bortz DM, Moré JJ (1999) COPS: large-scale nonlinearly constrained optimization problems. Technical report, Mathematics and Computer Science Division, Argonne National Laboratory. Technical report ANL/MCS-TM-237
Bongartz I, Conn AR, Gould N, Toint PL (1995) CUTE: constrained and unconstrained testing environment. ACM Trans Math Softw 21(1):123–160MATHCrossRef
Bongartz I, Conn AR, Gould NIM, Saunders MA, Toint PL (1997) A numerical comparison between the LANCELOT and MINOS packages for large scale constrained optimization. Technical report, SCAN-9711063
Box MJ (1966) A comparison of several current optimization methods, and the use of transformations in constrained problems. Comput J 9(1):67–77MATHMathSciNetCrossRef
Buckley AG (1992) Algorithm 709: testing algorithm implementations. ACM Trans Math Softw 18(4):375–391MATHCrossRef
Bussieck MR, Drud AS, Meeraus A, Pruessner A (2003) Quality assurance and global optimization. In: Bliek C, Jermann C, Neumaier A (eds) Global optimization and constraint satisfaction. Lecture notes in computer science, vol 2861. Springer, Berlin, pp 223–238CrossRef
Bussieck MR, Dirkse SP, Vigerske S (2014) PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J Glob Optim 59(2–3):259–275MATHCrossRef
CPLEX’s automatic tuning tool. Technical report, IBM Corporation, 2014
Colville AR (1968) A comparative study of nonlinear programming codes. Technical report 320-2949, IBM Scientific Center, New York
Conn AR, Gould N, Toint PL (1996) Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization. Math Program 73(1):73–110MATHMathSciNetCrossRef
Crowder H, Dembo RS, Mulvey JM (1979) On reporting computational experiments with mathematical software. ACM Trans Math Softw 5(2):193–203CrossRef
Dannenbring DG (1977) Procedures for estimating optimal solution values for large combinatorial problems. Manag Sci 23(12):1273–1283MATHCrossRef
Dembo RS (1978) Current state of the art of algorithms and computer software for geometric programming. J Optim Theory Appl 26(2):149–183MATHMathSciNetCrossRef
Dixon LCW, Szegö GP (1978) Towards global optimisation 2. North-Holland, AmsterdamMATH
Dolan ED, Moré JJ (2000) Benchmarking optimization software with COPS. Technical report, Argonne National Laboratory research report
Dolan ED, Moré JJ (2004) Benchmarking optimization software with COPS 3.0. Argonne National Laboratory research report
Eason ED (1982) Evidence of fundamental difficulties in nonlinear optimization code comparisons. In: Mulvey JM (ed) Evaluating mathematical programming techniques. Lecture notes in economics and mathematical systems, vol 199. Springer, Berlin, pp 60–71CrossRef
Eason ED, Fenton RG (1974) A comparison of numerical optimization methods for engineering design. J Manuf Sci Eng 96(1):196–200
Elam JJ, Klingman D (1982) NETGEN-II: a system for generating structured network-based mathematical programming test problems. In: Mulvey JM (ed) Evaluating mathematical programming techniques. Lecture notes in economics and mathematical systems, vol 199. Springer, Berlin, pp 16–23CrossRef
Evtushenko YG (1985) Numerical optimization techniques. Translation series in mathematics and engineering. Optimization Software, Inc., Publications Division, New York (distributed by Springer, New York, Translated from the Russian, Translation edited and with a foreword by J. Stoer)
Famularo D, Pugliese P, Sergeyev YD (2002) Test problems for Lipschitz univariate global optimization with multiextremal constraints. In: Dzemyda G, Šaltenis V, Žilinskas A (eds) Stochastic and global optimization. Nonconvex optimization and its applications, vol 59. Kluwer Academic Publishers, Dordrecht, pp 93–109CrossRef
Floudas CA, Pardalos PM (1990) A collection of test problems for constrained global optimization algorithms, vol 455. Springer, BerlinMATH
Floudas CA, Pardalos PM, Adjiman CS, Esposito WR, Gëmës ZH, Harding ST, Klepeis JL, Meyer CA, Schweiger CA (1999) Handbook of test problems in local and global optimization. Springer, New YorkMATHCrossRef
Fourer R, Gay DM, Kernighan BW (2002) AMPL: a modeling language for mathematical programming, 2nd edn. Duxbury Press, BelmontMATH
Fowler KR, Reese JP, Kees CE, Dennis JE Jr, Kelley CT, Miller CT, Audet C, Booker AJ, Couture G, Darwin RW, Farthing MW, Finkel DE, Gablonsky JM, Gray G, Kolda TG (2008) Comparison of derivative-free optimization methods for groundwater supply and hydraulic capture community problems. Adv Water Resour 31(5):743–757CrossRef
Gaviano M, Kvasov DE, Lera D, Sergeyev YD (2003) Algorithm 829: software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans Math Softw 29(4):469–480MATHMathSciNetCrossRef
Gilbert JC, Jonsson X (2009) LIBOPT an environment for testing solvers on heterogeneous collections of problems the manual, version 2.1. Technical report, INRIA, Le Chesnay
Gillard JW, Kvasov DE (2017) Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations. Stat Interface 10:59–70MathSciNetCrossRef
Golden BL, Stewart WR (1985) Empirical analysis of heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, New York, pp 207–249
Gould N, Orban D, Toint PL (2003) CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw 29(4):373–394MATHCrossRef
Gould NM, Orban D, Toint PL (2015) CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput Optim Appl 60(3):545–557MATHMathSciNetCrossRef
Grishagin VA (1978) Operating characteristics of some global search algorithms. In: Problems of stochastic search, vol 7. Zinatne, Riga, pp 198–206 (in Russian)
Grundel D, Jeffcoat D (2009) Combinatorial test problems and problem generators. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, New York, pp 391–394CrossRef
Hansen P, Jaumard B, Lu SH (1992) Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. Math Program 55(1–3):273–292MATHMathSciNetCrossRef
Hare W, Sagastizábal C (2006) Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points. Pac J Optim 2(3):545–573MATHMathSciNet
Hare W, Sagastizábal C (2010) A redistributed proximal bundle method for nonconvex optimization. SIAM J Optim 20(5):2442–2473MATHMathSciNetCrossRef
Hare WL, Wang Y (2010) Fairer benchmarking of optimization algorithms via derivative free optimization. Technical report, optimization-online
Hare WL, Koch VR, Lucet Y (2011) Models and algorithms to improve earthwork operations in road design using mixed integer linear programming. Eur J Oper Res 215(2):470–480MATHMathSciNetCrossRef
Hillstrom KE (1977) A simulation test approach to the evaluation of nonlinear optimization algorithms. ACM Trans Math Softw 3(4):305–315CrossRef
Hiriart-Urruty J-B, Lemaréchal C (1993) Convex analysis and minimization algorithms. II. Grundlehren der Mathematischen Wissenschaften [Fundamental principles of mathematical sciences]. Advanced theory and bundle methods, vol 306. Springer, BerlinMATH
Hock W, Schittkowski K (1981) Test examples for nonlinear programming codes. Lecture notes in economics and mathematical systems. Springer, BerlinMATHCrossRef
Hock W, Schittkowski K (1983) A comparative performance evaluation of 27 nonlinear programming codes. Computing 30(4):335–358MATHMathSciNetCrossRef
Hoffman KL, Jackson RHF (1982) In pursuit of a methodology for testing mathematical programming software. In: Mulvey JM (ed) Evaluating mathematical programming techniques. Lecture notes in economics and mathematical systems, vol 199. Springer, Berlin, pp 177–199CrossRef
Hoffman A, Mannos M, Sokolowsky D, Wiegmann N (1953) Computational experience in solving linear programs. J Soc Ind Appl Math 1(1):17–33MATHMathSciNetCrossRef
Hough P, Kolda T, Torczon V (2001) Asynchronous parallel pattern search for nonlinear optimization. SIAM J Sci Comput 23(1):134–156MATHMathSciNetCrossRef
Houstis EN, Rice JR, Christara CC, Vavalis EA (1988) Performance of scientific software. In: Rice JR (ed) Mathematical aspects of scientific software. The IMA volumes in mathematics and its applications, vol 14. Springer, New York, pp 123–155CrossRef
Huang HY, Levy AV (1970) Numerical experiments on quadratically convergent algorithms for function minimization. J Optim Theory Appl 6(3):269–282MATHMathSciNetCrossRef
Hutter F, Hoos HH, Leyton-Brown K, Stützle T (2009) ParamILS: an automatic algorithm configuration framework. J Artif Intell Res 36(1):267–306MATH
Hutter F, Hoos HH, Leyton-Brown K (2010) Automated configuration of mixed integer programming solvers. In: Lodi A, Milano M, Toth P (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Lecture notes in computer science, vol 6140. Springer, Berlin, pp 186–202CrossRef
Jackson RHF, Boggs PT, Nash SG, Powell S (1990) Guidelines for reporting results of computational experiments. Report of the ad hoc committee. Math Program 49(1–3):413–425MathSciNetCrossRef
Jamil M, Yang XS (2013) A literature survey of benchmark functions for global optimisation problems. Int J Math Model Numer Optim 4(2):150–194MATH
Johnson DS, McGeoch LA, Rothberg EE (1996) Asymptotic experimental analysis for the Held–Karp traveling salesman bound. In: Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms, SODA’96, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp 341–350
Khompatraporn C, Pinter JD, Zabinsky ZB (2005) Comparative assessment of algorithms and software for global optimization. J Glob Optim 31(4):613–633MATHMathSciNetCrossRef
Knuth DE (1994) The Stanford GraphBase: a platform for combinatorial computing, vol 37. Addison-Wesley Publishing Company, BostonMATH
Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, Gamrath G, Gleixner AM, Heinz S, Lodi A, Mittelmann H, Ralphs T, Salvagnin D, Steffy DE, Wolter K (2011) MIPLIB 2010. Math Program Comput 3(2):103–163MathSciNetCrossRef
Kolda TG, Lewis RM, Torczon V (2003) Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev 45(3):385–482MATHMathSciNetCrossRef
Kortelainen M, Lesinski T, Moré J, Nazarewicz W, Sarich J, Schunck N, Stoitsov MV, Wild S (2010) Nuclear energy density optimization. Phys Rev C 82(2):024313CrossRef
Kvasov DE, Mukhametzhanov MS (2016) One-dimensional global search: nature-inspired vs. lipschitz methods. AIP Conf Proc 1738(1):400012CrossRef
Kvasov DE, Mukhametzhanov MS (2017) Metaheuristic vs. deterministic global optimization algorithms: the univariate case. Appl Math Comput
Kvasov DE, Sergeyev YD (2015) Deterministic approaches for solving practical black-box global optimization problems. Adv Eng Softw 80:58–66CrossRef
Lenard ML, Minkoff M (1984) Randomly generated test problems for positive definite quadratic programming. ACM Trans Math Softw 10(1):86–96MATHMathSciNetCrossRef
Liu D, Zhang XS (2000) Test problem generator by neural network for algorithms that try solving nonlinear programming problems globally. J Glob Optim 16(3):229–243MATHMathSciNetCrossRef
McGeoch CC (1996) Toward an experimental method for algorithm simulation. INFORMS J Comput 8(1):1–15MATHCrossRef
McGeoch CC (2002) Experimental analysis of algorithms. In: Pardalos PM, Romeijn HE (eds) Handbook of global optimization. Nonconvex optimization and its applications, vol 62. Springer, New York, pp 489–513CrossRef
Miele A, Tietze JL, Levy AV (1972) Comparison of several gradient algorithms for mathematical programming problems. Aero-astronautics report no. 94, Rice University, Houston
Mittelmann HD, Pruessner A (2006) A server for automated performance analysis of benchmarking data. Optim Methods Softw 21(1):105–120MATHCrossRef
Mulvey JM (ed) (1982) Evaluating mathematical programming techniques, vol 199. Springer, BerlinMATH
Nannen V, Eiben AE (2006) A method for parameter calibration and relevance estimation in evolutionary algorithms. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, GECCO’06, New York, NY, USA. ACM, pp 183–190
Nash S, Nocedal J (1991) A numerical study of the limited memory BFGS method and the truncated-Newton method for large scale optimization. SIAM J Optim 1(3):358–372MATHMathSciNetCrossRef
Nell C, Fawcett C, Hoos HH, Leyton-Brown K (2011) HAL: a framework for the automated analysis and design of high-performance algorithms. In: Coello CAC (ed) Learning and intelligent optimization. Lecture notes in computer science, vol 6683. Springer, Berlin, pp 600–615CrossRef
Neumaier A, Shcherbina O, Huyer W, Vinkó T (2005) A comparison of complete global optimization solvers. Math Program 103(2):335–356MATHMathSciNetCrossRef
Nocedal J, Wright S (2006) Numerical optimization. Springer series in operations research and financial engineering. Springer, New York
Opara K, Arabas J (2011) Benchmarking procedures for continuous optimization algorithms. J Telecommun Inf Technol 4:73–80
Parejo JA, Ruiz-Cortés A, Lozano S, Fernandez P (2012) Metaheuristic optimization frameworks: a survey and benchmarking. Soft Comput 16(3):527–561CrossRef
Paulavičius R, Sergeyev YD, Kvasov DE, Žilinskas J (2014) Globally-biased Disimpl algorithm for expensive global optimization. J Glob Optim 59(2–3):545–567MATHMathSciNetCrossRef
Pintér JD (2002) Global optimization: software, test problems, and applications. In: Pardalos PM, Romeijn HE (eds) Handbook of global optimization. Nonconvex optimization and its applications, vol 62. Springer, New York, pp 515–569CrossRef
Pintér JD, Kampas FJ (2013) Benchmarking nonlinear optimization software in technical computing environments. Top 21(1):133–162MATHCrossRef
Ramsin H, Wedin P (1977) A comparison of some algorithms for the nonlinear least squares problem. BIT Numer Math 17(1):72–90MATHMathSciNetCrossRef
Rardin RL, Uzsoy R (2001) Experimental evaluation of heuristic optimization algorithms: a tutorial. J Heuristics 7(3):261–304MATHCrossRef
Regis RG, Shoemaker CA (2007) A stochastic radial basis function method for the global optimization of expensive functions. INFORMS J Comput 19(4):497–509MATHMathSciNetCrossRef
Regis RG, Wild SM (2017) Conorbit: constrained optimization by radial basis function interpolation in trust regions. Optim Methods Softw 32(3):1–29MathSciNetCrossRef
Ridge E (2007) Design of experiments for the tuning of optimisation algorithms. Department of Computer Science, University of York, HeslingtonMATH
Ridge E, Kudenko D (2010) Tuning an algorithm using design of experiments. In: Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (eds) Experimental methods for the analysis of optimization algorithms. Springer, Berlin, pp 265–286CrossRef
Rijckaert MJ, Martens XM (1978) Comparison of generalized geometric programming algorithms. J Optim Theory Appl 26(2):205–242MATHCrossRef
Rios L, Sahinidis NV (2013) Derivative-free optimization: a review of algorithms and comparison of software implementations. J Glob Optim 56(3):1247–1293MATHMathSciNetCrossRef
Rosenthal RE (2014) GAMS—a user’s guide. Technical report, GAMS Development Corporation
Sandgren E, Ragsdell KM (1980a) The utility of nonlinear programming algorithms: a comparative study, part 1. J Mech Des 102(3):540–546CrossRef
Sandgren E, Ragsdell KM (1980b) The utility of nonlinear programming algorithms: a comparative study, part 2. J Mech Des 102(3):547–551CrossRef
Schichl H, Markót MC (2012) Algorithmic differentiation techniques for global optimization in the COCONUT environment. Optim Methods Softw 27(2):359–372MATHMathSciNetCrossRef
Schittkowski K (1980) Nonlinear programming codes: information, tests, performance. Lecture notes in economics and mathematical systems. Springer, BerlinMATHCrossRef
Schittkowski K (2008) An updated set of 306 test problems for nonlinear programming with validated optimal solutions—user’s guide. Technical report, Department of Computer Science, University of Bayreuth
Schittkowski K, Stoer J (1978) A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes. Numer Math 31(4):431–463MATHMathSciNetCrossRef
Sergeyev YD, Kvasov DE (2006) Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J Optim 16(3):910–937MATHMathSciNetCrossRef
Sergeyev YD, Kvasov DE (2015) A deterministic global optimization using smooth diagonal auxiliary functions. Commun Nonlinear Sci Numer Simul 21(1–3):99–111MATHMathSciNetCrossRef
Sergeyev YD, Strongin RG, Lera D (2013) Introduction to global optimization exploiting space-filling curves. Springer briefs in optimization. Springer, New YorkMATHCrossRef
Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2016) Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms. Math Comput Simul 141:96–109MathSciNetCrossRef
Shcherbina O, Neumaier A, Sam-Haroud D, Vu XH, Nguyen TV (2003) Benchmarking global optimization and constraint satisfaction codes. In: Bliek C, Jermann C, Neumaier A (eds) Global optimization and constraint satisfaction. Lecture notes in computer science, vol 6683. Springer, Berlin, pp 211–222CrossRef
Strongin RG, Sergeyev YD (2000) Global optimization with non-convex constraints: sequential and parallel algorithms. Springer, New YorkMATHCrossRef
Tabak D (1969) Comparative study of various minimization techniques used in mathematical programming. IEEE Trans Autom Control 14(5):572–572MathSciNetCrossRef
Törn A, Žilinskas A (1989) Global optimization. Lecture notes in computer science, vol 350. Springer, BerlinMATH
Törn A, Ali MM, Viitanen S (1999) Stochastic global optimization: problem classes and solution techniques. J Glob Optim 14(4):437–447MATHMathSciNetCrossRef
Tufte ER, Graves-Morris PR (1983) The visual display of quantitative information, vol 2. Graphics Press, Cheshire
Tukey JW (1977) Exploratory data analysis. Pearson, ReadingMATH
Vanden Berghen F, Bersini H (2005) CONDOR, a new parallel, constrained extension of powell’s UOBYQA algorithm: experimental results and comparison with the DFO algorithm. J Comput Appl Math 181(1):157–175MATHMathSciNetCrossRef
Vanderbei RJ, Shanno DF (1999) An interior-point algorithm for nonconvex nonlinear programming. Comput Optim Appl 13(1–3):231–252MATHMathSciNetCrossRef
Vaz AIF, Vicente LN (2007) A particle swarm pattern search method for bound constrained global optimization. J Glob Optim 39(2):197–219MATHMathSciNetCrossRef
Yeniay O (2005) A comparative study on optimization methods for the constrained nonlinear programming problems. Math Probl Eng 2005(2):165–173MATHMathSciNetCrossRef
Zhang Z (2014) Sobolev seminorm of quadratic functions with applications to derivative-free optimization. Math Program 146(1–2):77–96MATHMathSciNetCrossRef
Zhigljavsky A, Žilinskas A (2008) Stochastic global optimization. Springer optimization and its applications, vol 9. Springer, New YorkMATH
Metadaten
Titel
Best practices for comparing optimization algorithms
verfasst von
Vahid Beiranvand
Warren Hare
Yves Lucet
Publikationsdatum
19.09.2017
Verlag
Springer US
Erschienen in
Optimization and Engineering / Ausgabe 4/2017
Print ISSN: 1389-4420
Elektronische ISSN: 1573-2924
DOI
https://doi.org/10.1007/s11081-017-9366-1

Weitere Artikel der Ausgabe 4/2017

Optimization and Engineering 4/2017 Zur Ausgabe

OriginalPaper

Convex optimization of measurement allocation for magnetic tracking systems

OriginalPaper

Optimization methods for petroleum fields development and production systems: a review

OriginalPaper

Petroleum refinery optimization

OriginalPaper

Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model

OriginalPaper

Cargo scheduling decision support for offshore oil and gas production: a case study

Premium Partner

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen. 

    Zur Marktübersicht
    Bildnachweise