Compare different unconstrained optimization methods (GradientDescent, Modified Newton, BFGS, DFP, Trust Region) with different line search methods(Armijo-Wolfe) on the problem sets.

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
__pycache__		__pycache__
figures		figures
results		results
BFGS.py		BFGS.py
DFP.py		DFP.py
GradientDescent.py		GradientDescent.py
Linesearch.py		Linesearch.py
Newton.py		Newton.py
README.md		README.md
Trustregion.py		Trustregion.py
optSolver.py		optSolver.py
project_problem.py		project_problem.py
quad_1000_1000_Q.mat		quad_1000_1000_Q.mat
quad_1000_10_Q.mat		quad_1000_10_Q.mat
quad_10_1000_Q.mat		quad_10_1000_Q.mat
quad_10_10_Q.mat		quad_10_10_Q.mat
script_bestalg.ipynb		script_bestalg.ipynb
script_table.ipynb		script_table.ipynb

Navigation Menu