2020
DOI: 10.1061/(asce)su.1943-5428.0000307
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic Strategies of Modified Levenberg–Marquardt Algorithm for Fitting Transition Curves

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…Therefore, many experts and scholars put forward a variety of methods to improve the algorithm performance. Currently, the commonly used optimization algorithms of BP neural network include BP neural network with additional momentum term combined with adaptive learning rate [38,39], GA-BP neural network combined BP neural network with genetic algorithm [40], PSO-BP neural network combined BP neural network with particle swarm optimization [41], BP learning algorithm improved by Levenberg-Marquardt method [42,43]. Due to the different inherent characteristics of the problems to be simulated, the improvement effect of each optimization method is limited.…”
Section: The Operating Principle Of Bp Neural Networkmentioning
confidence: 99%
“…Therefore, many experts and scholars put forward a variety of methods to improve the algorithm performance. Currently, the commonly used optimization algorithms of BP neural network include BP neural network with additional momentum term combined with adaptive learning rate [38,39], GA-BP neural network combined BP neural network with genetic algorithm [40], PSO-BP neural network combined BP neural network with particle swarm optimization [41], BP learning algorithm improved by Levenberg-Marquardt method [42,43]. Due to the different inherent characteristics of the problems to be simulated, the improvement effect of each optimization method is limited.…”
Section: The Operating Principle Of Bp Neural Networkmentioning
confidence: 99%
“…The GN search converges much faster than the SD search when Θk is close to the optimum. However, the GN search may diverge while the SD search can guarantee the decrease of f(Θ) when Θk is far from the optimum (Song et al., 2020).…”
Section: Parameter Estimationmentioning
confidence: 99%
“…Dong, Easa, and Li (2007) also presented an approximate method for extracting a compound horizontal curve consisting of a circular curve and a spiral curve. Song, Yang, Schonfeld, Li, and Pu (2020) proposed a robust algorithm for fitting transition curves. Easa (2008) proposed an efficient method for estimating vertical curves.…”
Section: Introductionmentioning
confidence: 99%
“…Easa and Wang (2010), Cellmer et al (2016), and Tong et al (2010) proposed an optimization model that can continuously estimate the parameters of each section of the curve by fitting the horizontal and vertical curve components with the least-squares method. Song et al (2020Song et al ( , 2021 selected the least-squares residual as the objective function, combined it with a heuristic strategy, and employed the Levenberg-Marquardt algorithm to fit the optimal alignment of the transition curve. Camacho-Torregrosa et al (2015) proposed using a heuristic algorithm to fit the geometric elements of different combined alignments.…”
Section: Introductionmentioning
confidence: 99%
“…Song et al. (2020, 2021) selected the least‐squares residual as the objective function, combined it with a heuristic strategy, and employed the Levenberg–Marquardt algorithm to fit the optimal alignment of the transition curve. Camacho‐Torregrosa et al.…”
Section: Introductionmentioning
confidence: 99%