2017
DOI: 10.1007/s11071-017-3544-8
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear model predictive control based on Nelder Mead optimization method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 29 publications
0
7
0
Order By: Relevance
“…For the particular case of the Gompertz model, three optimization algorithms were tested, notable for performing the search for parameters in the shortest possible time starting from initial conditions. The Nelder–Mead simplex algorithm was designed to solve nonlinear optimization problems without restrictions and does not require derivative computation of the function under test [ 27 ]. Nonlinear regression algorithm is a type of regression to determine parameters of a model that requires fitting real data [ 28 ].…”
Section: Methodsmentioning
confidence: 99%
“…For the particular case of the Gompertz model, three optimization algorithms were tested, notable for performing the search for parameters in the shortest possible time starting from initial conditions. The Nelder–Mead simplex algorithm was designed to solve nonlinear optimization problems without restrictions and does not require derivative computation of the function under test [ 27 ]. Nonlinear regression algorithm is a type of regression to determine parameters of a model that requires fitting real data [ 28 ].…”
Section: Methodsmentioning
confidence: 99%
“…In [36], the neural network is used to determine the solution of the minimization problem. In [37], the Nelder Mead algorithm was applied which leads to global solution by using far initialization. The simulations gave optimal results with least computation time for SISO and MIMO models.…”
Section: Model Predictive Control Design For Wiener Modelmentioning
confidence: 99%
“…Thus approaches that combine the advantages of global and local search algorithms are of interest [3]. The Nelder Mead Simplex method is a derivative free local optimization technique used to minimize or maximize an objective function in an unconstrained multidimensional space [28]. In the case of a bi-variable function, the simplex forms a triangle and the technique performs a pattern search which computes function values at every vertex.…”
Section: A Improving Accuracy With Local Searchmentioning
confidence: 99%
“…The triangle size is then progressively decreased and the coordinates of the least points are determined. The NM-Simplex method is computationally efficient and robust [28,29]. In this paper Nelder-Mead Simplex method is used to refine the solution found by the PSO for the ANN training problem.…”
Section: A Improving Accuracy With Local Searchmentioning
confidence: 99%