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.

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

Add LTMADS algorithm #184

Open
mateuszbaran opened this issue Dec 7, 2022 · 2 comments
Open

Add LTMADS algorithm #184

mateuszbaran opened this issue Dec 7, 2022 · 2 comments

Comments

@mateuszbaran
Copy link
Member

Here is the paper: https://optimization-online.org/2007/08/1742/ .

@kellertuer
Copy link
Member

The paper is actually the same, which the current Nelder-Mead is based on; compared to that LTMADS seems quite technical, so I am not yet sure how much effort such an implementation would be. To me at first read it seems to be a serious effort to realise that, unless we can use an existing LTMADS step in the tangent space in each iteration.

@mateuszbaran
Copy link
Member Author

There is a Julia library that implements the Euclidean variant: https://github.com/ImperialCollegeLondon/DirectSearch.jl (MIT license). It could potentially be helpful.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants