Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement an integer golden section search for the second BisectionZD search #73

Open
j-c-cook opened this issue Jan 15, 2022 · 0 comments
Open

Implement an integer golden section search for the second BisectionZD search #73

j-c-cook opened this issue Jan 15, 2022 · 0 comments

Comments

@j-c-cook
Copy link
Owner

The nested zoned rectangular search currently requires an exhaustive search once the domain of interest is selected. Depending on the size of the domain, this exhaustive search for a minimum could take longer than what was presented in Cook 2021. A way to overcome the exhaustive search for the minimum is to implement an integer golden section search for the minima.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@j-c-cook