[ { "run_id": "run_0001", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.375582789846077e-08, "optimal_point": [ 1.0001, 1.0001 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623729392, "iterations": 38, "function_evaluations": 52, "gradient_evaluations": 41, "time_elapsed": 0.10655923019934399, "convergence_rate": 0.47636324356502324, "stability_score": 0.9836627522604937, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.5681818181818182, "robustness_score": 0.9836627522604937, "overall_score": 0.8505677230277487, "convergence_history": [ 0.1798352717679376, 0.13590682021250652, 0.15568779561067222, 0.13222001719661639, 0.12320655498202898, 0.1063276609954969, 0.10958815526028254, 0.08655704267207444, 0.07546797340321286, 0.06741188234598512 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.532927", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0002", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.445848740846266e-08, "optimal_point": [ 1.0001, 1.0001 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623729392, "iterations": 40, "function_evaluations": 49, "gradient_evaluations": 39, "time_elapsed": 0.11200236724865441, "convergence_rate": 0.4512996057727796, "stability_score": 0.9590518175957764, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.5555555555555556, "robustness_score": 0.9590518175957764, "overall_score": 0.8381553239307555, "convergence_history": [ 0.5316484818643631, 0.4468898616419393, 0.41554157538668873, 0.3520348138265061, 0.3163010120910854, 0.32627017729988567, 0.2835771896475076, 0.24986805067951479, 0.2161411750485705, 0.21348309326224604 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533039", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0003", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.4837595882310536e-08, "optimal_point": [ 1.0001, 1.0001 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623729392, "iterations": 41, "function_evaluations": 48, "gradient_evaluations": 38, "time_elapsed": 0.11493912303198302, "convergence_rate": 0.43966101499684695, "stability_score": 0.9759951605849891, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.5494505494505495, "robustness_score": 0.9759951605849891, "overall_score": 0.8417681028921576, "convergence_history": [ 0.36320865579470757, 0.34049306451111394, 0.30439246449045654, 0.2793956554680034, 0.24264123255201153, 0.23523232823015033, 0.2009048154790135, 0.18095797893585522, 0.1686337758584073, 0.17176007256377257 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533112", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0004", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.571759222162451e-08, "optimal_point": [ 1.0001, 1.0001 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623729392, "iterations": 44, "function_evaluations": 52, "gradient_evaluations": 41, "time_elapsed": 0.12175599608300677, "convergence_rate": 0.408374664278179, "stability_score": 0.9680779869045723, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.5319148936170213, "robustness_score": 0.9680779869045723, "overall_score": 0.8332838263875093, "convergence_history": [ 0.3419884821181373, 0.32118612658250373, 0.2830523478459925, 0.2876936534871184, 0.24097148541601227, 0.2264660780879712, 0.20480837602610308, 0.16234011325228628, 0.14929586954949747, 0.14187151110996632 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533180", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0005", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 3.2453539873113776e-09, "optimal_point": [ 3.0001, 0.4999 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623745094, "iterations": 25, "function_evaluations": 30, "gradient_evaluations": 24, "time_elapsed": 0.08466140836464463, "convergence_rate": 0.7818416562296412, "stability_score": 0.9173320612081423, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.6666666666666666, "robustness_score": 0.9173320612081423, "overall_score": 0.8612857755052478, "convergence_history": [ 1.2598220894505816, 1.1364208824226096, 1.042977976032727, 0.9220234148885157, 0.8388084390873656, 0.7692586237006294, 0.6996160861341175, 0.618073826598792, 0.562358350073197, 0.5216624107518871 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533268", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0006", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 3.3365033175991315e-09, "optimal_point": [ 3.0001, 0.4999 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623745094, "iterations": 26, "function_evaluations": 34, "gradient_evaluations": 27, "time_elapsed": 0.0870392169808469, "convergence_rate": 0.7507054803557792, "stability_score": 0.9340636828386003, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.6578947368421053, "robustness_score": 0.9340636828386003, "overall_score": 0.8639390061072133, "convergence_history": [ 1.00369283147623, 0.9116702305845494, 0.8048950552590425, 0.7468619922658827, 0.6749433044639049, 0.6019008678546245, 0.5549667487361688, 0.4749963483356265, 0.4457969342830299, 0.4107021002412351 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533332", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0007", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 3.6054821234154744e-09, "optimal_point": [ 3.0001, 0.4999 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623745094, "iterations": 28, "function_evaluations": 34, "gradient_evaluations": 27, "time_elapsed": 0.09405605539344716, "convergence_rate": 0.6943146549188217, "stability_score": 0.9355030889691321, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.641025641025641, "robustness_score": 0.9355030889691321, "overall_score": 0.8587957762119025, "convergence_history": [ 1.0919961504144662, 1.0110461240334787, 0.9069873230896033, 0.8347313708472242, 0.7422491729486521, 0.6472343247949254, 0.6025317062003024, 0.5535123916423054, 0.5015107694017036, 0.4540619844195645 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533386", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0008", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 3.724096867359475e-09, "optimal_point": [ 3.0001, 0.4999 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.00014142135623745094, "iterations": 29, "function_evaluations": 35, "gradient_evaluations": 28, "time_elapsed": 0.09715035306155154, "convergence_rate": 0.669256602283677, "stability_score": 0.9080263606533581, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9998585986409345, "efficiency_score": 0.6329113924050632, "robustness_score": 0.9080263606533581, "overall_score": 0.8469321172331187, "convergence_history": [ 1.494976444155549, 1.331809881601329, 1.214088250007925, 1.0968477791738875, 0.9963448024663525, 0.8942475729403143, 0.8171458632915576, 0.741266173878268, 0.6705379447289794, 0.6098245680265316 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533437", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0009", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.2455243574854098e-08, "optimal_point": [ 1.0002, 2.9998 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00028284271247458785, "iterations": 18, "function_evaluations": 27, "gradient_evaluations": 21, "time_elapsed": 0.0607572857309956, "convergence_rate": 1.0111735628906753, "stability_score": 0.9442900165932041, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9997172372649044, "efficiency_score": 0.7352941176470589, "robustness_score": 0.9442900165932041, "overall_score": 0.893100457168389, "convergence_history": [ 0.6713739357214354, 0.5956626914033294, 0.5750503458746555, 0.4814619437414995, 0.4643476548840441, 0.42144633033831935, 0.37519641093335376, 0.35144375918327764, 0.28521681255818937, 0.2599519208352661 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533478", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0010", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.1609856358497583e-08, "optimal_point": [ 1.0002, 2.9998 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00028284271247458785, "iterations": 16, "function_evaluations": 29, "gradient_evaluations": 23, "time_elapsed": 0.05663344565120772, "convergence_rate": 1.1419632133459736, "stability_score": 0.8734744378552189, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9997172372649044, "efficiency_score": 0.7575757575757576, "robustness_score": 0.8734744378552189, "overall_score": 0.8769224775652936, "convergence_history": [ 2.009279471990853, 1.8173675881468951, 1.6371235456547557, 1.4952732341389274, 1.3546990359129873, 1.2314939991825782, 1.099274061567109, 1.0021295422319103, 0.9120395856411255, 0.8144438618719471 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533514", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0011", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.1897984289792773e-08, "optimal_point": [ 1.0002, 2.9998 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00028284271247458785, "iterations": 17, "function_evaluations": 26, "gradient_evaluations": 20, "time_elapsed": 0.058038947755086695, "convergence_rate": 1.0733468728581745, "stability_score": 0.9251245095366083, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9997172372649044, "efficiency_score": 0.7462686567164178, "robustness_score": 0.9251245095366083, "overall_score": 0.8903701345059769, "convergence_history": [ 1.1047022516616984, 0.9928925235790207, 0.8880801578272823, 0.8147789586830542, 0.738071963832286, 0.6706903925767967, 0.5948668486950327, 0.5295770705220006, 0.4852821479318364, 0.4417255614311581 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533556", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0012", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 1.2952109356336872e-08, "optimal_point": [ 1.0002, 2.9998 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00028284271247458785, "iterations": 18, "function_evaluations": 24, "gradient_evaluations": 19, "time_elapsed": 0.06318102125042377, "convergence_rate": 1.0090003987447729, "stability_score": 0.8030854008908045, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9997172372649044, "efficiency_score": 0.7352941176470589, "robustness_score": 0.8030854008908045, "overall_score": 0.8460322519342559, "convergence_history": [ 3.529553440578023, 3.1788393992817383, 2.8902724987108064, 2.6257435142556322, 2.3738253960405347, 2.133459110495247, 1.928766481417713, 1.7462426167869367, 1.5892137859478914, 1.4381992283867233 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533595", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0013", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.046761811442548436, "optimal_point": [ 0.02, -0.01 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.022360679774997897, "iterations": 88, "function_evaluations": 102, "gradient_evaluations": 81, "time_elapsed": 0.25978784134749133, "convergence_rate": 0.03480327731796441, "stability_score": 0.9959716062911182, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9781283844172106, "efficiency_score": 0.3623188405797102, "robustness_score": 0.9959716062911182, "overall_score": 0.778806277096013, "convergence_history": [ 0.0609849843910325, 0.059813474786337584, 0.046761811442548436, 0.059879744872382595, 0.046761811442548436, 0.046761811442548436, 0.05444425147130771, 0.052833668636135624, 0.046761811442548436, 0.056642950774054644 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533834", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0014", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.04607430982563298, "optimal_point": [ 0.02, -0.01 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.022360679774997897, "iterations": 87, "function_evaluations": 94, "gradient_evaluations": 75, "time_elapsed": 0.2559683879201832, "convergence_rate": 0.03537356040122008, "stability_score": 0.99502133243885, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9781283844172106, "efficiency_score": 0.36496350364963503, "robustness_score": 0.99502133243885, "overall_score": 0.7793710735018986, "convergence_history": [ 0.052698464576269435, 0.04995666010363198, 0.04607430982563298, 0.06435692382196795, 0.058758532703421205, 0.05900024347085265, 0.04607430982563298, 0.048519627558131606, 0.05365685906810935, 0.04607430982563298 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.533947", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0015", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.04455967821028951, "optimal_point": [ 0.02, -0.01 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.022360679774997897, "iterations": 84, "function_evaluations": 98, "gradient_evaluations": 78, "time_elapsed": 0.24755376783494176, "convergence_rate": 0.03703483220097367, "stability_score": 0.9930521895900251, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9781283844172106, "efficiency_score": 0.373134328358209, "robustness_score": 0.9930521895900251, "overall_score": 0.7814383007884814, "convergence_history": [ 0.05576460758601061, 0.05272903327569036, 0.051641359367756046, 0.04455967821028951, 0.05749256048425087, 0.059582520186361884, 0.04455967821028951, 0.05455003874205272, 0.06053868377229167, 0.04455967821028951 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.534053", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0016", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.24803154244641945, "optimal_point": [ 0.15, -0.12 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.19209372712298547, "iterations": 100, "function_evaluations": 106, "gradient_evaluations": 84, "time_elapsed": 0.3391884341147616, "convergence_rate": 0.013941993536208223, "stability_score": 0.9924566669868253, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.3333333333333333, "robustness_score": 0.9924566669868253, "overall_score": 0.7215500717078044, "convergence_history": [ 0.24803154244641945, 0.2591520904865922, 0.25093579802176136, 0.25940646587720934, 0.24803154244641945, 0.25050275894333635, 0.26976004977540247, 0.2487234525844551, 0.25162720845155173, 0.25548839072557933 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.534301", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0017", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.23423105779226727, "optimal_point": [ 0.15, -0.12 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.19209372712298547, "iterations": 95, "function_evaluations": 100, "gradient_evaluations": 80, "time_elapsed": 0.3203159764680578, "convergence_rate": 0.015278391835227209, "stability_score": 0.9941712223952469, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.3448275862068966, "robustness_score": 0.9941712223952469, "overall_score": 0.7259530078017994, "convergence_history": [ 0.23423105779226727, 0.23673996682826262, 0.24496646415565018, 0.23423105779226727, 0.23423105779226727, 0.23423105779226727, 0.25023486879456114, 0.23944044736464085, 0.24835001586309624, 0.24176185249769722 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.534414", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0018", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.1997062933468206, "optimal_point": [ 0.15, -0.12 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.19209372712298547, "iterations": 81, "function_evaluations": 93, "gradient_evaluations": 74, "time_elapsed": 0.27310262338026753, "convergence_rate": 0.019887747222861882, "stability_score": 0.9921931273144029, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.38167938931297707, "robustness_score": 0.9921931273144029, "overall_score": 0.7375775771435449, "convergence_history": [ 0.20356788853024568, 0.21097344013638344, 0.1997062933468206, 0.20318114821051436, 0.21780560416195266, 0.20839125020414626, 0.22256717536265075, 0.2151946285757719, 0.1997062933468206, 0.21701766700668737 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.534512", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0019", "optimizer": "SLSQP", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.19924393130290588, "optimal_point": [ 0.15, -0.12 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.19209372712298547, "iterations": 80, "function_evaluations": 89, "gradient_evaluations": 71, "time_elapsed": 0.2724703334056833, "convergence_rate": 0.02016531774346888, "stability_score": 0.9927615127303673, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.3846153846153846, "robustness_score": 0.9927615127303673, "overall_score": 0.7387457040496689, "convergence_history": [ 0.2046343638364343, 0.21210200390610356, 0.2003947353124448, 0.20586020615673922, 0.21502782653888952, 0.19924393130290588, 0.2005770521488891, 0.19924393130290588, 0.19924393130290588, 0.21775961433964572 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "equality", "inequality" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.534779", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Kraft, D. (1988). A software package for sequential quadratic programming" }, { "run_id": "run_0020", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 11.043644715022412, "optimal_point": [ 0.061, -3.17 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 4.274414696774285, "iterations": 112, "function_evaluations": 118, "gradient_evaluations": 0, "time_elapsed": 0.09024428776320663, "convergence_rate": -0.021445135032106568, "stability_score": 0.9946716310011402, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.18959449673374715, "efficiency_score": 0.30864197530864196, "robustness_score": 0.9946716310011402, "overall_score": 0.49763603434784304, "convergence_history": [ 11.050999569282435, 11.043644715022412, 11.043644715022412, 11.054007499580933, 11.045564742620247, 11.051849264128899, 11.043644715022412, 11.050583729009196, 11.043644715022412, 11.05775956375247 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.534943", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0021", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 10.050636378970106, "optimal_point": [ 0.061, -3.17 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 4.274414696774285, "iterations": 102, "function_evaluations": 115, "gradient_evaluations": 0, "time_elapsed": 0.08212981719280986, "convergence_rate": -0.02262388189991112, "stability_score": 0.9938588361798778, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.18959449673374715, "efficiency_score": 0.32894736842105265, "robustness_score": 0.9938588361798778, "overall_score": 0.5041335671115592, "convergence_history": [ 10.050636378970106, 10.050636378970106, 10.05740585006819, 10.050636378970106, 10.063219988532776, 10.059582712865197, 10.050636378970106, 10.050636378970106, 10.051263843981058, 10.065942557507176 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535071", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0022", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 9.535290531491597, "optimal_point": [ 0.061, -3.17 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 4.274414696774285, "iterations": 97, "function_evaluations": 106, "gradient_evaluations": 0, "time_elapsed": 0.07791861517051356, "convergence_rate": -0.023247419676211793, "stability_score": 0.9937208445839696, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.18959449673374715, "efficiency_score": 0.3401360544217687, "robustness_score": 0.9937208445839696, "overall_score": 0.5078171319131618, "convergence_history": [ 9.54731840585357, 9.545679411087777, 9.535290531491597, 9.541587594182065, 9.535290531491597, 9.550699420426652, 9.535290531491597, 9.546862082924994, 9.535290531491597, 9.53844928010258 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535189", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0023", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.6702997472864856, "optimal_point": [ 2.85, 0.62 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1920937271229854, "iterations": 97, "function_evaluations": 107, "gradient_evaluations": 0, "time_elapsed": 0.07629427849389958, "convergence_rate": -0.010125677639301353, "stability_score": 0.9948539666288212, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.3401360544217687, "robustness_score": 0.9948539666288212, "overall_score": 0.724616745284615, "convergence_history": [ 2.681543194992408, 2.6702997472864856, 2.6702997472864856, 2.6702997472864856, 2.6702997472864856, 2.6702997472864856, 2.6702997472864856, 2.683377407322354, 2.6709441027421943, 2.6702997472864856 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535308", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0024", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.4234580109833326, "optimal_point": [ 2.85, 0.62 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1920937271229854, "iterations": 88, "function_evaluations": 98, "gradient_evaluations": 0, "time_elapsed": 0.06924165745666665, "convergence_rate": -0.010059039208838712, "stability_score": 0.9982081580366982, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.3623188405797102, "robustness_score": 0.9982081580366982, "overall_score": 0.7331290711398877, "convergence_history": [ 2.4245286625162246, 2.433968141242131, 2.4435478143934226, 2.4349488230968785, 2.4309631110077285, 2.425662313365784, 2.4234580109833326, 2.424222548989104, 2.4258850220125403, 2.4286890040687337 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535415", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0025", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.2646764557505694, "optimal_point": [ 2.85, 0.62 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1920937271229854, "iterations": 82, "function_evaluations": 89, "gradient_evaluations": 0, "time_elapsed": 0.06470504159287341, "convergence_rate": -0.009968681751078314, "stability_score": 0.9913695521384394, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.37878787878787884, "robustness_score": 0.9913695521384394, "overall_score": 0.736339215243191, "convergence_history": [ 2.2739676265452182, 2.2755580293062874, 2.2646764557505694, 2.2746340715286144, 2.2786343523267063, 2.28644040806014, 2.2646764557505694, 2.2646764557505694, 2.2646764557505694, 2.2646764557505694 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535516", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0026", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.875550668210899, "optimal_point": [ 2.85, 0.62 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1920937271229854, "iterations": 104, "function_evaluations": 118, "gradient_evaluations": 0, "time_elapsed": 0.08215859052031141, "convergence_rate": -0.010156194160360548, "stability_score": 0.9971845027677371, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8388602148032547, "efficiency_score": 0.3246753246753247, "robustness_score": 0.9971845027677371, "overall_score": 0.7202400140821054, "convergence_history": [ 2.875550668210899, 2.8896362831316855, 2.875550668210899, 2.889614282802296, 2.875550668210899, 2.875550668210899, 2.8825866159580436, 2.875550668210899, 2.875550668210899, 2.8791572326412274 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535638", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0027", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.042245047727529926, "optimal_point": [ 1.05, 2.95 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.07071067811865465, "iterations": 42, "function_evaluations": 51, "gradient_evaluations": 0, "time_elapsed": 0.03755115353558216, "convergence_rate": 0.07533971775234731, "stability_score": 0.9855288879661993, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9339591174686888, "efficiency_score": 0.5434782608695653, "robustness_score": 0.9855288879661993, "overall_score": 0.8209887554348178, "convergence_history": [ 0.3109265520717183, 0.2759733305770489, 0.2712531302767664, 0.2430238317692529, 0.20755422414867525, 0.19835575436441474, 0.1709033057914847, 0.1699035875024825, 0.1640327427582794, 0.15423310898439543 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535701", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0028", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.04546538497570823, "optimal_point": [ 1.05, 2.95 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.07071067811865465, "iterations": 45, "function_evaluations": 58, "gradient_evaluations": 0, "time_elapsed": 0.04041367553396287, "convergence_rate": 0.06868453360715686, "stability_score": 0.9878619855873666, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9339591174686888, "efficiency_score": 0.5263157894736842, "robustness_score": 0.9878619855873666, "overall_score": 0.8160456308432464, "convergence_history": [ 0.2076142298335806, 0.18094224840033898, 0.1670685924956073, 0.1602317917389195, 0.162996948894466, 0.15319845670616927, 0.12295064014070521, 0.12751638774777135, 0.11810398425240927, 0.1254288367088526 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535764", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0029", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.04239389823330758, "optimal_point": [ 1.05, 2.95 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.07071067811865465, "iterations": 42, "function_evaluations": 53, "gradient_evaluations": 0, "time_elapsed": 0.03768346509627341, "convergence_rate": 0.07525597230219062, "stability_score": 0.9804584370979609, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9339591174686888, "efficiency_score": 0.5434782608695653, "robustness_score": 0.9804584370979609, "overall_score": 0.8192986051454051, "convergence_history": [ 0.29781066914458254, 0.2698166445552886, 0.2780523009770853, 0.24287823811368786, 0.2341278458196975, 0.19231273309085173, 0.17949725770872682, 0.1699616839959073, 0.17741318912379506, 0.13333273972168605 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535823", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0030", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.04522664512440111, "optimal_point": [ 1.05, 2.95 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.07071067811865465, "iterations": 45, "function_evaluations": 52, "gradient_evaluations": 0, "time_elapsed": 0.04020146233280099, "convergence_rate": 0.0688015304872122, "stability_score": 0.9766787046637643, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.9339591174686888, "efficiency_score": 0.5263157894736842, "robustness_score": 0.9766787046637643, "overall_score": 0.8123178705353791, "convergence_history": [ 0.33020195660949386, 0.3178497773787806, 0.2766162491649701, 0.2751807959913248, 0.25081565916103754, 0.23513039727439722, 0.20682976876400883, 0.18797759516750795, 0.17072615101662833, 0.17350474623924675 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.535886", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0031", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 3.4111294442884295, "optimal_point": [ 0.45, -0.38 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.5889821729050888, "iterations": 105, "function_evaluations": 114, "gradient_evaluations": 0, "time_elapsed": 0.1263381275662381, "convergence_rate": -0.01168612811228177, "stability_score": 0.996436652427356, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.6293336810517702, "efficiency_score": 0.3225806451612903, "robustness_score": 0.996436652427356, "overall_score": 0.6494503262134722, "convergence_history": [ 3.4111294442884295, 3.4218557767357916, 3.4143650147897553, 3.4111294442884295, 3.4111294442884295, 3.4199785959353055, 3.4111294442884295, 3.4111294442884295, 3.415894059573057, 3.4111294442884295 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536010", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0032", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 3.293947778554173, "optimal_point": [ 0.45, -0.38 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.5889821729050888, "iterations": 101, "function_evaluations": 115, "gradient_evaluations": 0, "time_elapsed": 0.12199806587237676, "convergence_rate": -0.01180283938737299, "stability_score": 0.996502624618254, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.6293336810517702, "efficiency_score": 0.33112582781456956, "robustness_score": 0.996502624618254, "overall_score": 0.6523207111615313, "convergence_history": [ 3.293947778554173, 3.3119025023657302, 3.293947778554173, 3.2950204510935674, 3.3185176166183954, 3.293947778554173, 3.302721903416829, 3.293947778554173, 3.293947778554173, 3.293947778554173 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536128", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0033", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 2.874444600938628, "optimal_point": [ 0.45, -0.38 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.5889821729050888, "iterations": 88, "function_evaluations": 95, "gradient_evaluations": 0, "time_elapsed": 0.10646091114587511, "convergence_rate": -0.011998403105738601, "stability_score": 0.997852047083137, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.6293336810517702, "efficiency_score": 0.3623188405797102, "robustness_score": 0.997852047083137, "overall_score": 0.6631681895715391, "convergence_history": [ 2.8820823010883085, 2.887892953756254, 2.880953278485516, 2.8878479231616763, 2.8805162477396116, 2.8755026772092482, 2.874444600938628, 2.874444600938628, 2.879992145296182, 2.874444600938628 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536233", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0034", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.9878731779555987, "optimal_point": [ 0.89, 0.67 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 1.1140017953306898, "iterations": 105, "function_evaluations": 119, "gradient_evaluations": 0, "time_elapsed": 0.15776771253615862, "convergence_rate": -0.0065434791658529725, "stability_score": 0.9986594808065453, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.4730364951480903, "efficiency_score": 0.3225806451612903, "robustness_score": 0.9986594808065453, "overall_score": 0.598092207038642, "convergence_history": [ 2.0043424754492993, 1.9878731779555987, 2.0035903812197966, 1.9932761198270317, 1.9959782856535988, 1.9886846518379326, 1.9913385662895278, 1.9878731779555987, 1.9878731779555987, 1.9878731779555987 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536359", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0035", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.4360812153262792, "optimal_point": [ 0.89, 0.67 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 1.1140017953306898, "iterations": 75, "function_evaluations": 84, "gradient_evaluations": 0, "time_elapsed": 0.11397469962906977, "convergence_rate": -0.00482557367547554, "stability_score": 0.9895371669064226, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.4730364951480903, "efficiency_score": 0.4, "robustness_score": 0.9895371669064226, "overall_score": 0.6208578873515043, "convergence_history": [ 1.4515282131906049, 1.4643093582385776, 1.4360812153262792, 1.4503355404422276, 1.4492564440002562, 1.4612644676577076, 1.4556195497585094, 1.4406334693611493, 1.4360812153262792, 1.461112983287692 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536451", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0036", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.9281406917067216, "optimal_point": [ 0.89, 0.67 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 1.1140017953306898, "iterations": 102, "function_evaluations": 115, "gradient_evaluations": 0, "time_elapsed": 0.153027039024343, "convergence_rate": -0.006436825160812679, "stability_score": 0.9955572648301668, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.4730364951480903, "efficiency_score": 0.32894736842105265, "robustness_score": 0.9955572648301668, "overall_score": 0.5991803761331033, "convergence_history": [ 1.9281406917067216, 1.9281406917067216, 1.9281406917067216, 1.9307131545128524, 1.9281406917067216, 1.9338886589831477, 1.9281406917067216, 1.9392467653141798, 1.9281406917067216, 1.9281406917067216 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536570", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0037", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.7818685586504517, "optimal_point": [ 0.89, 0.67 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 1.1140017953306898, "iterations": 94, "function_evaluations": 104, "gradient_evaluations": 0, "time_elapsed": 0.14141813957543267, "convergence_rate": -0.006145346444153443, "stability_score": 0.9999999999999998, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.4730364951480903, "efficiency_score": 0.3472222222222222, "robustness_score": 0.9999999999999998, "overall_score": 0.6067529057901041, "convergence_history": [ 1.8024082992015527, 1.7818685586504517, 1.7818685586504517, 1.7864680437666864, 1.7879484860004746, 1.7818685586504517, 1.7818685586504517, 1.7818685586504517, 1.7818685586504517, 1.7818685586504517 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536681", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0038", "optimizer": "COBYLA", "optimizer_type": "derivative-free", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.7101062227664785, "optimal_point": [ 0.89, 0.67 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 1.1140017953306898, "iterations": 90, "function_evaluations": 100, "gradient_evaluations": 0, "time_elapsed": 0.13572271609257766, "convergence_rate": -0.005961727635135306, "stability_score": 0.9966556963427241, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.4730364951480903, "efficiency_score": 0.35714285714285715, "robustness_score": 0.9966556963427241, "overall_score": 0.6089450162112239, "convergence_history": [ 1.7280221971320575, 1.7101062227664785, 1.7101062227664785, 1.7101062227664785, 1.7275354358539847, 1.7101062227664785, 1.7101062227664785, 1.7101062227664785, 1.7187458261423156, 1.7128943143034148 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "inequality" ], "gradient_required": false, "timestamp": "2025-08-24T00:22:09.536789", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Powell, M.J.D. (1994). A direct search optimization method" }, { "run_id": "run_0039", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.2068790305979173e-07, "optimal_point": [ 0.9998, 0.9996 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.0004472135954999087, "iterations": 33, "function_evaluations": 40, "gradient_evaluations": 32, "time_elapsed": 0.07544885574693734, "convergence_rate": 0.4644398889962714, "stability_score": 0.9352674184834192, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9995529863150975, "efficiency_score": 0.6024096385542168, "robustness_score": 0.9352674184834192, "overall_score": 0.8457433477842445, "convergence_history": [ 0.9173166768721758, 0.827283866894535, 0.758000651943607, 0.6831702364644711, 0.615793794657051, 0.5699128559986156, 0.5041670353017901, 0.4633579429884778, 0.4185641185375755, 0.36881064766101374 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.536859", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0040", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.4814849343915714e-07, "optimal_point": [ 0.9998, 0.9996 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.0004472135954999087, "iterations": 37, "function_evaluations": 43, "gradient_evaluations": 34, "time_elapsed": 0.08483709177407082, "convergence_rate": 0.41106050016490325, "stability_score": 0.9549940470086307, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9995529863150975, "efficiency_score": 0.5747126436781609, "robustness_score": 0.9549940470086307, "overall_score": 0.8430865590006297, "convergence_history": [ 0.6316060843358751, 0.5600169965090331, 0.5112072360077468, 0.4705279259471671, 0.4314875561384656, 0.39113119416937475, 0.35079268719890405, 0.3087974013202333, 0.28877800303241397, 0.256759211441103 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.536914", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0041", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rosenbrock", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 2.1845452058674723e-07, "optimal_point": [ 0.9998, 0.9996 ], "global_optimum": [ 1.0, 1.0 ], "global_minimum": 0.0, "error_from_known": 0.0004472135954999087, "iterations": 32, "function_evaluations": 39, "gradient_evaluations": 31, "time_elapsed": 0.07468530618350332, "convergence_rate": 0.4792714996201073, "stability_score": 0.9538145245718982, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9995529863150975, "efficiency_score": 0.6097560975609756, "robustness_score": 0.9538145245718982, "overall_score": 0.8543745361493237, "convergence_history": [ 0.6430332622153658, 0.5610983568722089, 0.5076089048921201, 0.45135257519646665, 0.4133924065640877, 0.38798291892827197, 0.3388498171178089, 0.3157793794806749, 0.2788448230501356, 0.24771665443152713 ], "bounds": [ [ -5, 10 ], [ -5, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.536964", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rosenbrock, H.H. (1960). An automatic method for finding the greatest or least value of a function", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0042", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.7679290115745192, "optimal_point": [ 2.89, 0.45 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1208304597359456, "iterations": 50, "function_evaluations": 55, "gradient_evaluations": 44, "time_elapsed": 0.1167952869314858, "convergence_rate": 0.005281159659046435, "stability_score": 0.9861036701454932, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8921955959651455, "efficiency_score": 0.5, "robustness_score": 0.9861036701454932, "overall_score": 0.7927664220368795, "convergence_history": [ 0.8763543853066129, 0.8877394954813977, 0.8663539247304126, 0.883749725045211, 0.8457042567141537, 0.8407084673857931, 0.8107158291823483, 0.8171622966958857, 0.8377070220428625, 0.8062893072360143 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537039", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0043", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.7115597086530464, "optimal_point": [ 2.89, 0.45 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1208304597359456, "iterations": 46, "function_evaluations": 60, "gradient_evaluations": 48, "time_elapsed": 0.10822200892061543, "convergence_rate": 0.007397737947246547, "stability_score": 0.9922303591887934, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8921955959651455, "efficiency_score": 0.5208333333333334, "robustness_score": 0.9922303591887934, "overall_score": 0.8017530961624241, "convergence_history": [ 0.766485896882372, 0.7700412339783329, 0.7632943114244517, 0.7619891066276817, 0.7657993693444987, 0.7528465263261973, 0.7462338575119183, 0.7372682728046811, 0.7477932925499339, 0.7310272138361149 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537102", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0044", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "beale", "problem_difficulty": "moderate", "problem_type": "unimodal", "dimension": 2, "optimal_value": 0.6950872965715151, "optimal_point": [ 2.89, 0.45 ], "global_optimum": [ 3.0, 0.5 ], "global_minimum": 0.0, "error_from_known": 0.1208304597359456, "iterations": 45, "function_evaluations": 56, "gradient_evaluations": 44, "time_elapsed": 0.10571669909832929, "convergence_rate": 0.008082618549499355, "stability_score": 0.9770127781429718, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.8921955959651455, "efficiency_score": 0.5263157894736842, "robustness_score": 0.9770127781429718, "overall_score": 0.7985080545272671, "convergence_history": [ 0.9896114239714864, 0.9413003691281076, 0.9294618533336769, 0.8939391530460302, 0.8934432332368651, 0.8700271004177429, 0.8652537659228985, 0.8382847975615343, 0.8312856759952879, 0.8057636946922566 ], "bounds": [ [ -4.5, 4.5 ], [ -4.5, 4.5 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537164", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Beale, E.M.L. (1958). On an Iterative Method for Finding a Local Minimum", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0045", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 6.137103333828866e-09, "optimal_point": [ 1.0, 3.0001 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00010000000000021103, "iterations": 23, "function_evaluations": 31, "gradient_evaluations": 24, "time_elapsed": 0.05411907701789124, "convergence_rate": 0.8221266511234968, "stability_score": 0.9264721453288152, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9999000099989999, "efficiency_score": 0.684931506849315, "robustness_score": 0.9264721453288152, "overall_score": 0.8704345540590434, "convergence_history": [ 1.1833837856330884, 1.0639973718734175, 0.9725285371335296, 0.8574231197506798, 0.8052552297709432, 0.7073784287552095, 0.6620691240886523, 0.581097123912318, 0.5301671150471352, 0.49515502973025627 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537207", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0046", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 6.001004578925644e-09, "optimal_point": [ 1.0, 3.0001 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00010000000000021103, "iterations": 23, "function_evaluations": 34, "gradient_evaluations": 27, "time_elapsed": 0.052918911630737614, "convergence_rate": 0.8231016935614011, "stability_score": 0.8961302379167104, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9999000099989999, "efficiency_score": 0.684931506849315, "robustness_score": 0.8961302379167104, "overall_score": 0.860320584921675, "convergence_history": [ 1.6017475586877608, 1.4352862328340015, 1.3337599925855605, 1.191029236279801, 1.0877294409967018, 0.9901608866117532, 0.8915398034491292, 0.8139065653888671, 0.7344829908864681, 0.6594583231929884 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537248", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0047", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 6.26177982514228e-09, "optimal_point": [ 1.0, 3.0001 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00010000000000021103, "iterations": 24, "function_evaluations": 36, "gradient_evaluations": 28, "time_elapsed": 0.05521851697656332, "convergence_rate": 0.7870333906303948, "stability_score": 0.9374840795380357, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9999000099989999, "efficiency_score": 0.6756756756756757, "robustness_score": 0.9374840795380357, "overall_score": 0.8710199217375704, "convergence_history": [ 0.990164762531528, 0.8963898592434583, 0.8128323166711089, 0.720222053497758, 0.6496368082586416, 0.5842175388771655, 0.5369911845467319, 0.4945821312712265, 0.44587323061939577, 0.39414714221216657 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537289", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0048", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "booth", "problem_difficulty": "easy", "problem_type": "unimodal", "dimension": 2, "optimal_value": 5.221239402612248e-09, "optimal_point": [ 1.0, 3.0001 ], "global_optimum": [ 1.0, 3.0 ], "global_minimum": 0.0, "error_from_known": 0.00010000000000021103, "iterations": 20, "function_evaluations": 34, "gradient_evaluations": 27, "time_elapsed": 0.04604267550804453, "convergence_rate": 0.9535265514892052, "stability_score": 0.8447953892727507, "success": true, "converged": true, "within_tolerance": true, "accuracy_score": 0.9999000099989999, "efficiency_score": 0.7142857142857143, "robustness_score": 0.8447953892727507, "overall_score": 0.852993704519155, "convergence_history": [ 2.640769845141225, 2.3901507442313275, 2.1575219365406784, 1.9640219516930935, 1.7696613411287745, 1.5868720174668858, 1.4660586789079568, 1.3003040489908249, 1.171173990345678, 1.0882592849846746 ], "bounds": [ [ -10, 10 ], [ -10, 10 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537326", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Booth function - Test functions for optimization", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0049", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.9403831934821512, "optimal_point": [ 0.23, 0.18 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.2920616373302047, "iterations": 77, "function_evaluations": 91, "gradient_evaluations": 72, "time_elapsed": 0.20914309869867498, "convergence_rate": -0.008608902285503029, "stability_score": 0.9943873289845274, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.7739568849565927, "efficiency_score": 0.39370078740157477, "robustness_score": 0.9943873289845274, "overall_score": 0.7206816671142316, "convergence_history": [ 1.9403831934821512, 1.9525042272681878, 1.9611336314981669, 1.9596556066936388, 1.9539698422500669, 1.9549193887433338, 1.9403831934821512, 1.9430062057514417, 1.9403831934821512, 1.9403831934821512 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537446", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0050", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.5494082700852385, "optimal_point": [ 0.23, 0.18 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.2920616373302047, "iterations": 62, "function_evaluations": 75, "gradient_evaluations": 60, "time_elapsed": 0.16700208899122332, "convergence_rate": -0.007062469303329893, "stability_score": 0.9926361407942942, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.7739568849565927, "efficiency_score": 0.4464285714285714, "robustness_score": 0.9926361407942942, "overall_score": 0.7376738657264861, "convergence_history": [ 1.5888843061245976, 1.5688324282364705, 1.5741542309352534, 1.5724242848763608, 1.5773542728805423, 1.5689398588753103, 1.5549754818990207, 1.5577484641210875, 1.5752749100357093, 1.5662781686026472 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537529", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0051", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.8838545157368347, "optimal_point": [ 0.23, 0.18 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.2920616373302047, "iterations": 75, "function_evaluations": 88, "gradient_evaluations": 70, "time_elapsed": 0.2030501873249283, "convergence_rate": -0.008444266029680028, "stability_score": 0.9979215480846979, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.7739568849565927, "efficiency_score": 0.4, "robustness_score": 0.9979215480846979, "overall_score": 0.7239594776804301, "convergence_history": [ 1.8913837229843924, 1.8905649641678763, 1.8838545157368347, 1.8870888992736286, 1.8838545157368347, 1.889061467924838, 1.8838545157368347, 1.8838545157368347, 1.8838545157368347, 1.8838545157368347 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537623", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0052", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "rastrigin", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 1.6916318767304124, "optimal_point": [ 0.23, 0.18 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.2920616373302047, "iterations": 67, "function_evaluations": 81, "gradient_evaluations": 64, "time_elapsed": 0.18233157952782889, "convergence_rate": -0.007846174187592684, "stability_score": 0.9944008516014888, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.7739568849565927, "efficiency_score": 0.4273504273504274, "robustness_score": 0.9944008516014888, "overall_score": 0.7319027213028363, "convergence_history": [ 1.6948687883329205, 1.6916318767304124, 1.699085304793767, 1.7074228445835005, 1.6916318767304124, 1.703151169940857, 1.6921394862836645, 1.6916318767304124, 1.7034229877501401, 1.6916318767304124 ], "bounds": [ [ -5.12, 5.12 ], [ -5.12, 5.12 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537706", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Rastrigin, L.A. (1974). Systems of extremal control", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0053", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.6485824867570789, "optimal_point": [ 0.34, -0.28 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.44045431091090487, "iterations": 89, "function_evaluations": 101, "gradient_evaluations": 80, "time_elapsed": 0.24021573583595515, "convergence_rate": 0.004864787495296931, "stability_score": 0.9943638943002275, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.6942254207060734, "efficiency_score": 0.3597122302158273, "robustness_score": 0.9943638943002275, "overall_score": 0.6827671817407094, "convergence_history": [ 0.6485824867570789, 0.6485824867570789, 0.6485824867570789, 0.6777138479136492, 0.6485824867570789, 0.6485824867570789, 0.6563294355464427, 0.6619655970994963, 0.6603003557645236, 0.6485824867570789 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537815", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0054", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.605059331663061, "optimal_point": [ 0.34, -0.28 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.44045431091090487, "iterations": 83, "function_evaluations": 91, "gradient_evaluations": 72, "time_elapsed": 0.22409604876409667, "convergence_rate": 0.00605335851680926, "stability_score": 0.9950563495285178, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.6942254207060734, "efficiency_score": 0.37593984962406013, "robustness_score": 0.9950563495285178, "overall_score": 0.6884072066195506, "convergence_history": [ 0.6070926715979573, 0.6344961803359124, 0.6051717974358911, 0.6094157508162524, 0.605059331663061, 0.618907574818618, 0.616678890271301, 0.6101299845513887, 0.6104396625010735, 0.605059331663061 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.537916", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" }, { "run_id": "run_0055", "optimizer": "L-BFGS-B", "optimizer_type": "gradient-based", "problem": "ackley", "problem_difficulty": "hard", "problem_type": "multimodal", "dimension": 2, "optimal_value": 0.6424294361582134, "optimal_point": [ 0.34, -0.28 ], "global_optimum": [ 0.0, 0.0 ], "global_minimum": 0.0, "error_from_known": 0.44045431091090487, "iterations": 88, "function_evaluations": 101, "gradient_evaluations": 80, "time_elapsed": 0.2379368282067457, "convergence_rate": 0.005028389718582903, "stability_score": 0.9965216767940823, "success": false, "converged": false, "within_tolerance": false, "accuracy_score": 0.6942254207060734, "efficiency_score": 0.3623188405797102, "robustness_score": 0.9965216767940823, "overall_score": 0.6843553126932886, "convergence_history": [ 0.6580415596896302, 0.6479066067036038, 0.644315436649794, 0.6424294361582134, 0.651816835726263, 0.6502986558968009, 0.648792200386266, 0.6424294361582134, 0.6424294361582134, 0.6426064828478414 ], "bounds": [ [ -32, 32 ], [ -32, 32 ] ], "constraints_supported": [ "bounds" ], "gradient_required": true, "timestamp": "2025-08-24T00:22:09.538020", "source": "openmdao_benchmarking_system_v1.0", "problem_reference": "Ackley, D.H. (1987). A connectionist machine for genetic hillclimbing", "optimizer_reference": "Byrd, R.H. et al. (1995). A limited memory algorithm for bound constrained optimization" } ]