Discussing the article: "Implementing the Truncated Newton Conjugate-Gradient Algorithm in MQL5"
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Check out the new article: Implementing the Truncated Newton Conjugate-Gradient Algorithm in MQL5.
This article implements a box‑constrained Truncated Newton Conjugate‑Gradient (TNC) optimizer in MQL5 and details its core components: scaling, projection to bounds, line search, and Hessian‑vector products via finite differences. It provides an objective wrapper supporting analytic or numerical derivatives and validates the solver on the Rosenbrock benchmark. A logistic regression example shows how to use TNC as a drop‑in alternative to LBFGS.
The Truncated Newton Conjugate-Gradient (TNC) method is a second-order optimization algorithm that approximates the behavior of Newton’s Method. In the context of optimization, Newton's Method is a procedure used to find a function's minimum. The general method consists of an initial guess, followed by the computation of the function's gradient and Hessian matrix, before updating the objective values. This process is repeated until convergence.
The gradient of a function (the first derivative) provides information about the slope, indicating the direction of the steepest ascent. The Hessian (the second derivative) provides information about the shape, specifically the curvature of the function at a given point. If the Hessian shows positive curvature in all directions, it indicates a local minimum (a bottom). If the curvature is negative in all directions, the point is a local maximum (a summit). If the Hessian shows movement in one direction and then another, it indicates a saddle point.
Author: Francis Dube