п/2 f (x) = [«(xz – x-1)? + (1 – x2i-1)°], i=1 re a is a parameter that you can vary (for example, 1 or 100). The solution ,..., 1)", f* = 0. Choose the starting point as (-1, –1, ..., –1)". Obs avior of your program for various values of the memory parameter m.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Help me with the Python code . 

7.1 Code Algorithm 7.5, and test it on the extended Rosenbrock function
п/2
f (x) = [«(x2; – x-1)² + (1 – x2i-1)²],
i=1
where a is a parameter that you can vary (for example, 1 or 100). The solution is x*
(1, 1, ..., 1)", f*
behavior of your program for various values of the memory parameter m.
= 0. Choose the starting point as (-1, –1, ..., –1)". Observe the
Transcribed Image Text:7.1 Code Algorithm 7.5, and test it on the extended Rosenbrock function п/2 f (x) = [«(x2; – x-1)² + (1 – x2i-1)²], i=1 where a is a parameter that you can vary (for example, 1 or 100). The solution is x* (1, 1, ..., 1)", f* behavior of your program for various values of the memory parameter m. = 0. Choose the starting point as (-1, –1, ..., –1)". Observe the
Algorithm 7.5 (L-BFGS).
Choose starting point xo, integer m > 0;
k + 0;
repeat
Choose H (for example, by using (7.20));
Compute pr +
– H¿V fr from Algorithm 7.4;
Compute xk+1 + Xk + ak Pk, where ar is chosen to
satisfy the Wolfe conditions;
if k > m
Discard the vector pair {sk-m, Yk-m} from storage;
Compute and save sk – Xk+1 – Xk, Yk = V fk+1 – V fk;
k + k+ 1;
-1-
until convergence.
Transcribed Image Text:Algorithm 7.5 (L-BFGS). Choose starting point xo, integer m > 0; k + 0; repeat Choose H (for example, by using (7.20)); Compute pr + – H¿V fr from Algorithm 7.4; Compute xk+1 + Xk + ak Pk, where ar is chosen to satisfy the Wolfe conditions; if k > m Discard the vector pair {sk-m, Yk-m} from storage; Compute and save sk – Xk+1 – Xk, Yk = V fk+1 – V fk; k + k+ 1; -1- until convergence.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Hiring Problem
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education