Your English writing platform
Discover LudwigExact(59)
Finally, a class of special line search methods is investigated.
Optimization is performed using the BFGS line search method.
This significantly enhances the efficiency associated with the line search.
In this paper we analyze the general results on convergence of line search methods with seven line search rules.
Since it is a line search method, which needs a line search procedure after determining a search direction at each iteration, we must decide a line search rule to choose a step size along a search direction.
This reveals that the damped L-BFGS method in combination with a cubic line search performs best, closely followed by classical L-BFGS with cubic line search.
Line search methods are traditional and successful methods for solving unconstrained optimization problems.
Moreover, we analyze the convergence rate of quasi-Newton method with the new line search rule.
A combination of steepest descent and line search techniques is used to solve the optimization problem.
The solutions are recursively updated by line search until the Karush-Kuhn-Tucker conditions are satisfied.
Similar(1)
On-line search in a simple polygon.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com