Skip to content

Latest commit

 

History

History
17 lines (15 loc) · 1.1 KB

README.md

File metadata and controls

17 lines (15 loc) · 1.1 KB
Raw

UnconstrainedOptimization

Unconstrained optimization algorithms in python, line search and trust region methods. There were two questions whose answers are available in:

The questions required two different kinds of unconstrained optimization algorithms:

  • Line search algorithms
    • Steepest descent
      • Backtrack and cubic interpolation step length finder using wolfe and goldstein conditions
    • Quasi-Newton
      • Backtrack and cubic interpolation step length finder using wolfe and goldstein conditions
  • Trust region algorithms
    • Dogleg step finder
    • Cauchy point step finder

There were also some needs for implementation of some linear algebric algorithms such as repairing positive semi definite matrices and ... which can be found in the liang_utils.py file.