Basic unconstrained optimization algorithms

A Matlab implementation for basic unconstrained optimization algorithms

You are now following this Submission

A Matlab implementation for basic unconstrained optimization algorithms as defined in 'Linear and nonlinear programming by Luenberger and Ye'. The package includes Steepest Descent, Newtons, Fletcher-Reeves and Davidon–Fletcher–Powell algorithms with Fibonacci, Dichotomous, Interval Halving, Newtons and Quadratic line search methods.
To test the methods: Run 'scr_optim.m'

Cite As

Ethem H. Orhan (2026). Basic unconstrained optimization algorithms (https://se.mathworks.com/matlabcentral/fileexchange/87839-basic-unconstrained-optimization-algorithms), MATLAB Central File Exchange. Retrieved .

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Version Published Release Notes Action
1.0.0