GitHub - vkinoshita/ParTan: Finds the minimum of a n dimensional unimodal function with Parallel Tangents and Linear Search. Also, implements a basic Penalty method for non linear restrictions.

vkinoshita / ParTan Public

Finds the minimum of a n dimensional unimodal function with Parallel Tangents and Linear Search. Also, implements a basic Penalty method for non linear restrictions.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
input_examples		input_examples
lib		lib
report		report
.gitignore		.gitignore
README.txt		README.txt
input.py		input.py
output.txt		output.txt
partan_report.pdf		partan_report.pdf
partan_with_restriction.py		partan_with_restriction.py
partan_without_restriction.py		partan_without_restriction.py

Repository files navigation

Authors: Victor S. K. and Arthur V.

- This is a basic implementation of Bazaraa's ParTan that finds the minimum of almost all n dimensional functions.

- Both implementations, Partan and Linear Search, works pretty well. 

- The Penalty method is a little bit rudimentary. It means that sometimes you will not get the real optimal value. So, don't trust the partan_with_restriction.py.

- The partan's report is written in portuguese.

About

Finds the minimum of a n dimensional unimodal function with Parallel Tangents and Linear Search. Also, implements a basic Penalty method for non linear restrictions.

Readme

Activity

0 stars

2 watching

0 forks

Report repository