You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello. I have an implementation of one Bayesian-like global optimization method https://github.com/sovrasov/glob_search_nlp_solver. It can handle nonlinear objective functions and functional constraints which satisfy the Lipschitz condition. My implementation supports dimension < 6. According to the NLOpt documentation most of the other methods (like DIRECTl) doesn't handle non-linear constraints (supports only boundary ones). On unconstrained problems this method performs not worse than DIRECT (see paper)
I can prepare PR to NLOpt. Will it be useful?
The text was updated successfully, but these errors were encountered:
Hello. I have an implementation of one Bayesian-like global optimization method https://github.com/sovrasov/glob_search_nlp_solver. It can handle nonlinear objective functions and functional constraints which satisfy the Lipschitz condition. My implementation supports dimension < 6. According to the NLOpt documentation most of the other methods (like DIRECTl) doesn't handle non-linear constraints (supports only boundary ones). On unconstrained problems this method performs not worse than DIRECT (see paper)
I can prepare PR to NLOpt. Will it be useful?
The text was updated successfully, but these errors were encountered: