Knowledge

Rosenbrock function

Source đź“ť

1302: 1322: 20: 1315: 435: 949: 721: 735: 1162: 1333:
and without building local approximation models (in contrast to many derivate-free optimizers). The following figure illustrates an example of 2-dimensional Rosenbrock function optimization by
242: 1507: 1635: 302: 1268: 1386: 1048: 1471: 1098: 59: 1416: 343: 1016: 395: 91: 978: 468: 421: 369: 1288: 1206: 1186: 491: 499: 1224: 1298:
Many of the stationary points of the function exhibit a regular pattern when plotted. This structure can be exploited to locate them.
1740: 944:{\displaystyle f(\mathbf {x} )=\sum _{i=1}^{N-1}\quad {\mbox{where}}\quad \mathbf {x} =(x_{1},\ldots ,x_{N})\in \mathbb {R} ^{N}.} 1658:
Kok, Schalk; Sandrock, Carl (2009). "Locating and Characterizing the Stationary Points of the Extended Rosenbrock Function".
1588: 1164:. This result is obtained by setting the gradient of the function equal to zero, noticing that the resulting equation is a 1103: 152: 1750: 1518: 1329:
The Rosenbrock function can be efficiently optimized by adapting appropriate coordinate system without using any
117: 143:-shaped flat valley. To find the valley is trivial. To converge to the global minimum, however, is difficult. 1334: 1476: 250: 98: 1230: 1340: 1021: 1428: 1053: 113: 1706: 1422: 109: 26: 1391: 1301: 307: 983: 1509:
after 185 function evaluations. The figure below visualizes the evolution of the algorithm.
1745: 1220: 471: 374: 64: 8: 957: 445: 400: 348: 1716: 1273: 1213: 1191: 1171: 476: 1713: 1685: 1584: 1561: 1165: 1675: 1667: 1617: 1551: 1330: 716:{\displaystyle f(\mathbf {x} )=f(x_{1},x_{2},\dots ,x_{N})=\sum _{i=1}^{N/2}\left.} 106: 1671: 1605: 136: 1734: 1565: 1556: 1539: 1689: 1540:"An automatic method for finding the greatest or least value of a function" 1321: 1217: 1621: 1209: 16:
Function used as a performance test problem for optimization algorithms
1680: 1473:
with a regular initial simplex a minimum is found with function value
1290:
this method breaks down due to the size of the coefficients involved.
1721: 121: 19: 140: 1581:
Computer Aided Graphing and Simulation Tools for AutoCAD users
434: 1314: 1711: 423:
the function is symmetric and the minimum is at the origin.
470:
uncoupled 2D Rosenbrock problems, and is defined only for
1606:"Effect of Rounding Errors on the Variable Metric Method" 438:
Animation of Rosenbrock's function of three variables.
23:
Plot of the Rosenbrock function of two variables. Here
873: 1479: 1431: 1394: 1343: 1325:
Nelder-Mead method applied to the Rosenbrock function
1276: 1233: 1194: 1174: 1157:{\displaystyle {\hat {\mathbf {x} }}=(-1,1,\dots ,1)} 1106: 1056: 1024: 986: 960: 738: 502: 479: 448: 403: 377: 351: 310: 253: 155: 67: 29: 426: 1501: 1465: 1410: 1380: 1282: 1262: 1200: 1180: 1156: 1092: 1042: 1010: 972: 943: 715: 485: 462: 415: 389: 363: 337: 296: 236: 85: 53: 1732: 1610:Journal of Optimization Theory and Applications 726:This variant has predictably simple solutions. 237:{\displaystyle f(x,y)=(a-x)^{2}+b(y-x^{2})^{2}} 345:. Usually, these parameters are set such that 1418:can be found after 325 function evaluations. 1657: 1583:(1st ed.). Boca Raton, FL: CRC Press. 1305:Rosenbrock roots exhibiting hump structures 1603: 1578: 1537: 1679: 1653: 1651: 1555: 928: 431:Two variants are commonly encountered. 1320: 1313: 1309: 1300: 433: 18: 1388:. The solution with the function value 1216:can be used to determine the number of 1733: 1648: 1604:Dixon, L. C. W.; Mills, D. J. (1994). 61:, and the minimum value of zero is at 1712: 1293: 1636:"Generalized Rosenbrock's function" 729:A second, more involved variant is 13: 1502:{\displaystyle 1.36\cdot 10^{-10}} 14: 1762: 1700: 397:. Only in the trivial case where 1111: 881: 746: 510: 427:Multidimensional generalizations 1741:Test functions for optimization 1519:Test functions for optimization 879: 871: 297:{\displaystyle (x,y)=(a,a^{2})} 1707:Rosenbrock function plot in 3D 1628: 1597: 1572: 1531: 1460: 1445: 1375: 1357: 1263:{\displaystyle |x_{i}|<2.4} 1250: 1235: 1212:can be determined exactly and 1151: 1124: 1115: 1087: 1057: 1005: 987: 920: 888: 868: 859: 839: 827: 789: 783: 750: 742: 696: 667: 655: 611: 568: 523: 514: 506: 326: 314: 291: 272: 266: 254: 225: 205: 190: 177: 171: 159: 80: 68: 1: 1524: 1381:{\displaystyle x_{0}=(-3,-4)} 1043:{\displaystyle 4\leq N\leq 7} 1018:) and exactly two minima for 1466:{\displaystyle x_{0}=(-1,1)} 954:has exactly one minimum for 130:Rosenbrock's banana function 116:in 1960, which is used as a 7: 1512: 1335:adaptive coordinate descent 1093:{\displaystyle (1,1,...,1)} 247:It has a global minimum at 146:The function is defined by 10: 1767: 1672:10.1162/evco.2009.17.3.437 139:is inside a long, narrow, 1579:Simionescu, P.A. (2014). 1538:Rosenbrock, H.H. (1960). 1223:, while the roots can be 1100:and a local minimum near 99:mathematical optimization 54:{\displaystyle a=1,b=100} 1660:Evolutionary Computation 1411:{\displaystyle 10^{-10}} 338:{\displaystyle f(x,y)=0} 118:performance test problem 1050:—the global minimum at 1011:{\displaystyle (1,1,1)} 1751:Functions and mappings 1557:10.1093/comjnl/3.3.175 1503: 1467: 1412: 1382: 1326: 1318: 1306: 1284: 1264: 1202: 1182: 1158: 1094: 1044: 1012: 974: 945: 782: 717: 602: 487: 464: 439: 417: 391: 365: 339: 298: 238: 124:. It is also known as 94: 87: 55: 1717:"Rosenbrock Function" 1504: 1468: 1413: 1383: 1324: 1317: 1310:Optimization examples 1304: 1285: 1265: 1203: 1183: 1159: 1095: 1045: 1013: 975: 946: 756: 718: 574: 488: 465: 437: 418: 392: 390:{\displaystyle b=100} 366: 340: 299: 239: 88: 86:{\displaystyle (1,1)} 56: 22: 1544:The Computer Journal 1477: 1429: 1425:from starting point 1392: 1341: 1337:from starting point 1331:gradient information 1274: 1231: 1192: 1172: 1104: 1054: 1022: 984: 958: 736: 500: 477: 446: 401: 375: 349: 308: 251: 153: 114:Howard H. Rosenbrock 65: 27: 973:{\displaystyle N=3} 825: 637: 463:{\displaystyle N/2} 416:{\displaystyle a=0} 364:{\displaystyle a=1} 126:Rosenbrock's valley 103:Rosenbrock function 1714:Weisstein, Eric W. 1622:10.1007/BF02196600 1499: 1463: 1423:Nelder–Mead method 1408: 1378: 1327: 1319: 1307: 1280: 1260: 1198: 1178: 1154: 1090: 1040: 1008: 970: 941: 877: 811: 713: 614: 483: 460: 442:One is the sum of 440: 413: 387: 361: 335: 294: 234: 95: 83: 51: 1590:978-1-4822-5290-3 1294:Stationary points 1283:{\displaystyle N} 1227:in the region of 1201:{\displaystyle N} 1181:{\displaystyle x} 1166:rational function 1118: 876: 486:{\displaystyle N} 120:for optimization 1758: 1727: 1726: 1694: 1693: 1683: 1655: 1646: 1645: 1643: 1642: 1632: 1626: 1625: 1601: 1595: 1594: 1576: 1570: 1569: 1559: 1535: 1508: 1506: 1505: 1500: 1498: 1497: 1472: 1470: 1469: 1464: 1441: 1440: 1417: 1415: 1414: 1409: 1407: 1406: 1387: 1385: 1384: 1379: 1353: 1352: 1289: 1287: 1286: 1281: 1269: 1267: 1266: 1261: 1253: 1248: 1247: 1238: 1207: 1205: 1204: 1199: 1187: 1185: 1184: 1179: 1163: 1161: 1160: 1155: 1120: 1119: 1114: 1109: 1099: 1097: 1096: 1091: 1049: 1047: 1046: 1041: 1017: 1015: 1014: 1009: 979: 977: 976: 971: 950: 948: 947: 942: 937: 936: 931: 919: 918: 900: 899: 884: 878: 874: 867: 866: 857: 856: 835: 834: 824: 819: 807: 806: 781: 770: 749: 722: 720: 719: 714: 709: 705: 704: 703: 688: 687: 663: 662: 653: 652: 636: 631: 601: 597: 588: 567: 566: 548: 547: 535: 534: 513: 492: 490: 489: 484: 469: 467: 466: 461: 456: 422: 420: 419: 414: 396: 394: 393: 388: 370: 368: 367: 362: 344: 342: 341: 336: 303: 301: 300: 295: 290: 289: 243: 241: 240: 235: 233: 232: 223: 222: 198: 197: 112:, introduced by 92: 90: 89: 84: 60: 58: 57: 52: 1766: 1765: 1761: 1760: 1759: 1757: 1756: 1755: 1731: 1730: 1703: 1698: 1697: 1656: 1649: 1640: 1638: 1634: 1633: 1629: 1602: 1598: 1591: 1577: 1573: 1536: 1532: 1527: 1515: 1490: 1486: 1478: 1475: 1474: 1436: 1432: 1430: 1427: 1426: 1399: 1395: 1393: 1390: 1389: 1348: 1344: 1342: 1339: 1338: 1312: 1296: 1275: 1272: 1271: 1249: 1243: 1239: 1234: 1232: 1229: 1228: 1214:Sturm's theorem 1193: 1190: 1189: 1173: 1170: 1169: 1110: 1108: 1107: 1105: 1102: 1101: 1055: 1052: 1051: 1023: 1020: 1019: 985: 982: 981: 959: 956: 955: 932: 927: 926: 914: 910: 895: 891: 880: 872: 862: 858: 852: 848: 830: 826: 820: 815: 796: 792: 771: 760: 745: 737: 734: 733: 699: 695: 674: 670: 658: 654: 645: 641: 632: 618: 607: 603: 593: 589: 578: 562: 558: 543: 539: 530: 526: 509: 501: 498: 497: 478: 475: 474: 452: 447: 444: 443: 429: 402: 399: 398: 376: 373: 372: 350: 347: 346: 309: 306: 305: 285: 281: 252: 249: 248: 228: 224: 218: 214: 193: 189: 154: 151: 150: 66: 63: 62: 28: 25: 24: 17: 12: 11: 5: 1764: 1754: 1753: 1748: 1743: 1729: 1728: 1709: 1702: 1701:External links 1699: 1696: 1695: 1647: 1627: 1596: 1589: 1571: 1550:(3): 175–184. 1529: 1528: 1526: 1523: 1522: 1521: 1514: 1511: 1496: 1493: 1489: 1485: 1482: 1462: 1459: 1456: 1453: 1450: 1447: 1444: 1439: 1435: 1405: 1402: 1398: 1377: 1374: 1371: 1368: 1365: 1362: 1359: 1356: 1351: 1347: 1311: 1308: 1295: 1292: 1279: 1270:. For larger 1259: 1256: 1252: 1246: 1242: 1237: 1197: 1177: 1153: 1150: 1147: 1144: 1141: 1138: 1135: 1132: 1129: 1126: 1123: 1117: 1113: 1089: 1086: 1083: 1080: 1077: 1074: 1071: 1068: 1065: 1062: 1059: 1039: 1036: 1033: 1030: 1027: 1007: 1004: 1001: 998: 995: 992: 989: 969: 966: 963: 952: 951: 940: 935: 930: 925: 922: 917: 913: 909: 906: 903: 898: 894: 890: 887: 883: 870: 865: 861: 855: 851: 847: 844: 841: 838: 833: 829: 823: 818: 814: 810: 805: 802: 799: 795: 791: 788: 785: 780: 777: 774: 769: 766: 763: 759: 755: 752: 748: 744: 741: 724: 723: 712: 708: 702: 698: 694: 691: 686: 683: 680: 677: 673: 669: 666: 661: 657: 651: 648: 644: 640: 635: 630: 627: 624: 621: 617: 613: 610: 606: 600: 596: 592: 587: 584: 581: 577: 573: 570: 565: 561: 557: 554: 551: 546: 542: 538: 533: 529: 525: 522: 519: 516: 512: 508: 505: 482: 459: 455: 451: 428: 425: 412: 409: 406: 386: 383: 380: 360: 357: 354: 334: 331: 328: 325: 322: 319: 316: 313: 293: 288: 284: 280: 277: 274: 271: 268: 265: 262: 259: 256: 245: 244: 231: 227: 221: 217: 213: 210: 207: 204: 201: 196: 192: 188: 185: 182: 179: 176: 173: 170: 167: 164: 161: 158: 137:global minimum 82: 79: 76: 73: 70: 50: 47: 44: 41: 38: 35: 32: 15: 9: 6: 4: 3: 2: 1763: 1752: 1749: 1747: 1744: 1742: 1739: 1738: 1736: 1724: 1723: 1718: 1715: 1710: 1708: 1705: 1704: 1691: 1687: 1682: 1677: 1673: 1669: 1666:(3): 437–53. 1665: 1661: 1654: 1652: 1637: 1631: 1623: 1619: 1615: 1611: 1607: 1600: 1592: 1586: 1582: 1575: 1567: 1563: 1558: 1553: 1549: 1545: 1541: 1534: 1530: 1520: 1517: 1516: 1510: 1494: 1491: 1487: 1483: 1480: 1457: 1454: 1451: 1448: 1442: 1437: 1433: 1424: 1419: 1403: 1400: 1396: 1372: 1369: 1366: 1363: 1360: 1354: 1349: 1345: 1336: 1332: 1323: 1316: 1303: 1299: 1291: 1277: 1257: 1254: 1244: 1240: 1226: 1222: 1219: 1215: 1211: 1195: 1188:. For small 1175: 1167: 1148: 1145: 1142: 1139: 1136: 1133: 1130: 1127: 1121: 1084: 1081: 1078: 1075: 1072: 1069: 1066: 1063: 1060: 1037: 1034: 1031: 1028: 1025: 1002: 999: 996: 993: 990: 967: 964: 961: 938: 933: 923: 915: 911: 907: 904: 901: 896: 892: 885: 863: 853: 849: 845: 842: 836: 831: 821: 816: 812: 808: 803: 800: 797: 793: 786: 778: 775: 772: 767: 764: 761: 757: 753: 739: 732: 731: 730: 727: 710: 706: 700: 692: 689: 684: 681: 678: 675: 671: 664: 659: 649: 646: 642: 638: 633: 628: 625: 622: 619: 615: 608: 604: 598: 594: 590: 585: 582: 579: 575: 571: 563: 559: 555: 552: 549: 544: 540: 536: 531: 527: 520: 517: 503: 496: 495: 494: 480: 473: 457: 453: 449: 436: 432: 424: 410: 407: 404: 384: 381: 378: 358: 355: 352: 332: 329: 323: 320: 317: 311: 286: 282: 278: 275: 269: 263: 260: 257: 229: 219: 215: 211: 208: 202: 199: 194: 186: 183: 180: 174: 168: 165: 162: 156: 149: 148: 147: 144: 142: 138: 133: 131: 127: 123: 119: 115: 111: 108: 104: 100: 77: 74: 71: 48: 45: 42: 39: 36: 33: 30: 21: 1720: 1663: 1659: 1639:. Retrieved 1630: 1613: 1609: 1599: 1580: 1574: 1547: 1543: 1533: 1420: 1328: 1297: 953: 728: 725: 441: 430: 246: 145: 134: 129: 125: 102: 96: 1746:Polynomials 1616:: 175–179. 1210:polynomials 1735:Categories 1681:2263/13845 1641:2008-09-16 1525:References 1421:Using the 122:algorithms 1722:MathWorld 1566:0010-4620 1492:− 1484:⋅ 1449:− 1401:− 1370:− 1361:− 1143:… 1128:− 1116:^ 1035:≤ 1029:≤ 924:∈ 905:… 846:− 809:− 776:− 758:∑ 690:− 682:− 639:− 626:− 576:∑ 553:… 212:− 184:− 141:parabolic 105:is a non- 1690:19708775 1513:See also 304:, where 110:function 1225:bounded 1688:  1587:  1564:  107:convex 101:, the 1221:roots 875:where 1686:PMID 1585:ISBN 1562:ISSN 1481:1.36 1255:< 1218:real 1208:the 980:(at 472:even 371:and 135:The 1676:hdl 1668:doi 1618:doi 1552:doi 1258:2.4 1168:of 787:100 609:100 493:s: 385:100 128:or 97:In 49:100 1737:: 1719:. 1684:. 1674:. 1664:17 1662:. 1650:^ 1614:80 1612:. 1608:. 1560:. 1546:. 1542:. 1495:10 1488:10 1404:10 1397:10 132:. 1725:. 1692:. 1678:: 1670:: 1644:. 1624:. 1620:: 1593:. 1568:. 1554:: 1548:3 1461:) 1458:1 1455:, 1452:1 1446:( 1443:= 1438:0 1434:x 1376:) 1373:4 1367:, 1364:3 1358:( 1355:= 1350:0 1346:x 1278:N 1251:| 1245:i 1241:x 1236:| 1196:N 1176:x 1152:) 1149:1 1146:, 1140:, 1137:1 1134:, 1131:1 1125:( 1122:= 1112:x 1088:) 1085:1 1082:, 1079:. 1076:. 1073:. 1070:, 1067:1 1064:, 1061:1 1058:( 1038:7 1032:N 1026:4 1006:) 1003:1 1000:, 997:1 994:, 991:1 988:( 968:3 965:= 962:N 939:. 934:N 929:R 921:) 916:N 912:x 908:, 902:, 897:1 893:x 889:( 886:= 882:x 869:] 864:2 860:) 854:i 850:x 843:1 840:( 837:+ 832:2 828:) 822:2 817:i 813:x 804:1 801:+ 798:i 794:x 790:( 784:[ 779:1 773:N 768:1 765:= 762:i 754:= 751:) 747:x 743:( 740:f 711:. 707:] 701:2 697:) 693:1 685:1 679:i 676:2 672:x 668:( 665:+ 660:2 656:) 650:i 647:2 643:x 634:2 629:1 623:i 620:2 616:x 612:( 605:[ 599:2 595:/ 591:N 586:1 583:= 580:i 572:= 569:) 564:N 560:x 556:, 550:, 545:2 541:x 537:, 532:1 528:x 524:( 521:f 518:= 515:) 511:x 507:( 504:f 481:N 458:2 454:/ 450:N 411:0 408:= 405:a 382:= 379:b 359:1 356:= 353:a 333:0 330:= 327:) 324:y 321:, 318:x 315:( 312:f 292:) 287:2 283:a 279:, 276:a 273:( 270:= 267:) 264:y 261:, 258:x 255:( 230:2 226:) 220:2 216:x 209:y 206:( 203:b 200:+ 195:2 191:) 187:x 181:a 178:( 175:= 172:) 169:y 166:, 163:x 160:( 157:f 93:. 81:) 78:1 75:, 72:1 69:( 46:= 43:b 40:, 37:1 34:= 31:a

Index


mathematical optimization
convex
function
Howard H. Rosenbrock
performance test problem
algorithms
global minimum
parabolic

even
rational function
polynomials
Sturm's theorem
real
roots
bounded


Rosenbrock function Nelder-Mead
gradient information
adaptive coordinate descent
Nelder–Mead method
Test functions for optimization
"An automatic method for finding the greatest or least value of a function"
doi
10.1093/comjnl/3.3.175
ISSN
0010-4620
ISBN

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑