1
I Use This!
Inactive
Analyzed about 19 hours ago. based on code collected about 19 hours ago.

Project Summary

The minfx project is a Python package for numerical optimisation, being a large collection of standard minimisation algorithms. This includes the line search methods: steepest descent, back-and-forth coordinate descent, quasi-Newton BFGS, Newton, Newton-CG; the trust-region methods: Cauchy point, dogleg, CG-Steihaug, exact trust region; the conjugate gradient methods: Fletcher-Reeves, Polak-Ribiere, Polak-Ribiere +, Hestenes-Stiefel; the miscellaneous methods: Grid search, Simplex, Levenberg-Marquardt; and the augmented function constraint algorithms: logarithmic barrier and method of multipliers (or augmented Lagrangian method).

Tags

algorithm conjugate_gradient library line_search local_optimisation minimisation minimization nonlinear numerical optimisation optimization python trust_region

In a Nutshell, minfx...

GNU General Public License v3.0 or later
Permitted

Commercial Use

Modify

Distribute

Place Warranty

Use Patent Claims

Forbidden

Sub-License

Hold Liable

Required

Distribute Original

Disclose Source

Include Copyright

State Changes

Include License

Include Install Instructions

These details are provided for information only. No information here is legal advice and should not be used as such.

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
  • ...
    learn about Open Hub updates and features on the Open Hub blog
  • ...
    65% of companies leverage OSS to speed application development in 2016
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog

30 Day Summary

Nov 9 2022 — Dec 9 2022

12 Month Summary

Dec 9 2021 — Dec 9 2022

Ratings

1 user rates this project:
5.0
 
5.0/5.0
Click to add your rating
  
Review this Project!