1998
DOI: 10.1090/pspum/064/1654537
|View full text |Cite
|
Sign up to set email alerts
|

A Hamiltonian approach to strong minima in optimal control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
29
0

Year Published

2002
2002
2012
2012

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(29 citation statements)
references
References 0 publications
0
29
0
Order By: Relevance
“…, where π : T * M → M is the standard projection (see [2] or [3, Ch.21]). Then γ ξ is strictly shorter than any connecting q 0 with q admissible path γ such that…”
Section: Proofsmentioning
confidence: 99%
“…, where π : T * M → M is the standard projection (see [2] or [3, Ch.21]). Then γ ξ is strictly shorter than any connecting q 0 with q admissible path γ such that…”
Section: Proofsmentioning
confidence: 99%
“…For contact sub-Riemannian structures it is also known, although its proof exploits a little bit more sophisticated techniques than the proof of Theorem 1.1. There are various approaches and, in our opinion, a natural tool here is symplectic geometry (see [4] for an exposition and [6] for the detailed treatment). The following well-known fact indicates a point where the analogy with classical Riemannian geometry fails.…”
Section: Contact Sub-riemannian Geodesics Are Exactly Projections On mentioning
confidence: 99%
“…In [ASZ98b] we stated sufficient conditions for strong local optimality for an optimal control problem in R n with unbounded controls, while in [ASZ98a] we gave an intrinsic expression of the accessory problem and studied the relations between the Hamiltonian flow and the index of the second variation. The geometric properties of the field of extremals necessary for proving sufficient conditions for strong optimality were studied in [ASZ99].…”
mentioning
confidence: 99%
“…Since the optimality can be lost only at these points, then the positivity of the second variation can be checked by an algorithm (see Lemma 2.8) which is based on the properties of the discrete flow of the bang-bang Jacobi system. For analogous conditions in the case of unbounded controls, see [ASZ98b].…”
mentioning
confidence: 99%