2008
DOI: 10.1016/j.ecolmodel.2008.03.030
|View full text |Cite
|
Sign up to set email alerts
|

Perturbation methods in optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…To solve (14), which is an unconstrained optimization problem, we can use any optimization algorithms such as steepest descent, Newton, or Quasi Newton methods as well as the heuristic algorithms such as GA (genetic algorithm) or particle swarm optimization algorithm (PSO). After terminating the optimization step, we can replace the optimal values of the weights ψ into the Eq.…”
Section: Definition 1 ([26])mentioning
confidence: 99%
See 1 more Smart Citation
“…To solve (14), which is an unconstrained optimization problem, we can use any optimization algorithms such as steepest descent, Newton, or Quasi Newton methods as well as the heuristic algorithms such as GA (genetic algorithm) or particle swarm optimization algorithm (PSO). After terminating the optimization step, we can replace the optimal values of the weights ψ into the Eq.…”
Section: Definition 1 ([26])mentioning
confidence: 99%
“…He stated the necessary conditions in terms of a local minimum principle and use of the Fischer-Burmeister function. Buldaev [14] used perturbation methods in optimal control problems. Numerical methods based on extended one-step methods were investigated in [15] for solving optimal control problems.…”
mentioning
confidence: 99%