2008
DOI: 10.1080/02331930601125044
|View full text |Cite
|
Sign up to set email alerts
|

Second-order optimality conditions in a discrete optimal control problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0
1

Year Published

2008
2008
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 4 publications
0
5
0
1
Order By: Relevance
“…(3). Also, it can be considered the initial problem with equality and inequality type of state constraints.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…(3). Also, it can be considered the initial problem with equality and inequality type of state constraints.…”
Section: Introductionmentioning
confidence: 99%
“…, x N ). If the conditions (2), (3) and (4) are satisfied then we say that the pair (x 0 , w) is feasible. The discrete optimization problem is to minimize the function…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is well known that the optimal control problems with continuous variables can be transferred to discrete optimal control problems by discretization. During the past decades, several papers dealing with the first‐order optimality condition and the second‐order necessary condition for discrete optimal control have appeared in the literature; see, for example, References 9‐16 and the references therein. Under the assumption that the cost functions are convex with respect to control variables, Ioffe and Tikhomirov 14 (theorem 1 of sect.…”
Section: Introductionmentioning
confidence: 99%
“…Note that some results about first-and second-order necessary optimality conditions in discrete optimal control problems without normality assumptions can be found in [2,6]. Also, we refer to [7,8] where there are first-order optimality conditions for general discrete optimal control problems and for the problems arising from discrete approximations.…”
Section: Introductionmentioning
confidence: 99%