The Wayback Machine - https://web.archive.org/web/20200902004933/https://github.com/topics/optimization-methods
Skip to content
#

optimization-methods

Here are 99 public repositories matching this topic...

Sceki
Sceki commented Jun 9, 2019

Some problems/algorithms seem to have an inconsistent python exposition in terms of types.

For instance, in ../src/problems/dtlz.cpp we have:

dtlz::dtlz(unsigned prob_id, vector_double::size_type dim, vector_double::size_type fdim, unsigned alpha)

But in the ../pygmo/expose_problems_0.cpp it is exposed as:

dtlz_p.def(bp::init<unsigned, unsigned, unsigned, unsigned>

I

Duelist-Algorithm-Python

Bayesian optimization is a method of finding the maximum of expensive cost functions. Bayesian optimization employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function. This permits a utility-based selection of the next observation to make on the objective function, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation (sampling areas likely to offer improvement over the current best observation).
  • Updated Jul 18, 2020
  • Julia

This python code is developed by Sreemannarayana Ikkurthi, as a part of course notes for the course 15AES477: Multidisciplinary Design Optimization (MDO). In support of Dr. Rajesh Senthil Kumar T., Assistant Professor, Department of Aerospace Engneering, Amrita Vishwa Vidyapeetham.
  • Updated Jun 24, 2020
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the optimization-methods topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the optimization-methods topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.