Provides line search methods, such as backtracking, to determine the optimal step size in optimization and root-finding algorithms.
-
Updated
Aug 4, 2022 - Julia
Provides line search methods, such as backtracking, to determine the optimal step size in optimization and root-finding algorithms.
Visualize common algorithms using python
Golden Section, Quadratic Interpolation, Nelder-Mead line search algorithms are studied.
Line Search optimization of several 2D functions demonstrating the usage of Gradient Descent and Hessian direction with Wolfe condition
Collection of line search techniques
Convex, Nonsmooth, Nonlinear Optimization Solver and Problems
Implementation of numerical optimization algorithms for logistic regression problem.
Implementation of a Neural Network with L-BFGS with Line Search and Gradient Descent with Momentum for numerical optimization purposes
Text Statistics For Node Streams
Codes for primal-dual method with linesearch
📉 JavaScript Text Statistics that counts lines, words, chars, and spaces.
Easy-to-use linear and non-linear solver
Add a description, image, and links to the linesearch topic page so that developers can more easily learn about it.
To associate your repository with the linesearch topic, visit your repo's landing page and select "manage topics."