1983
DOI: 10.1007/bf00934445
|View full text |Cite
|
Sign up to set email alerts
|

Controllability, extremality, and abnormality in nonsmooth optimal control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
40
0

Year Published

1996
1996
2014
2014

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 64 publications
(40 citation statements)
references
References 9 publications
0
40
0
Order By: Relevance
“…if a certain linearized inclusion is λ-locally controlable around the null solution for every λ ∈ ∂h(z(T )), where ∂h(.) denotes Clarke's generalized Jacobian of the locally Lipschitz function h. The key tools in the proof of our result is a continuous version of Filippov's theorem for mild solutions of semilinear differential inclusions obtained in [2] and a certain generalization of the classical open mapping principle in [14].…”
Section: Introductionmentioning
confidence: 99%
“…if a certain linearized inclusion is λ-locally controlable around the null solution for every λ ∈ ∂h(z(T )), where ∂h(.) denotes Clarke's generalized Jacobian of the locally Lipschitz function h. The key tools in the proof of our result is a continuous version of Filippov's theorem for mild solutions of semilinear differential inclusions obtained in [2] and a certain generalization of the classical open mapping principle in [14].…”
Section: Introductionmentioning
confidence: 99%
“…Applying this result to the collection of all selections of F (convex valued and satisfying the Lipschitz condition), Kaśkosz and Lojasiewicz obtained in [28] another necessary condition for inclusion constrained problems, and Zhu [53] extended their result to nonconvex inclusions (also bounded and Lipschitz) by elaborating on a controllability theorem of Warga [52]. An obvious drawback of these conditions is the absence of any analytic mechanism for obtaining selections (even in the case of a convex valued inclusion).…”
Section: Introductionmentioning
confidence: 98%
“…We are concerned with necessary conditions for a solution to P. If F(t, x) admits a parametrization, i.e. there exist a set U and a function f(t, x, u) such that F(t, x)=[ f(t, x, u) : u # U] and if certain regularity conditions are satisfied then the maximum principle and its various generalizations (see [26,30]) concerning the control system defined by ( f, U ) provide necessary conditions for a solution to P. However, for a nonconvex-valued multifunction F it is very difficult to determine whether such a parametrization exists. On the other hand, a variant of Lojasiewicz'es parametrization theorem [17] shows that under fairly general conditions such a parametrization exists when F is convex-valued (Section 4).…”
Section: Introductionmentioning
confidence: 99%
“…We then follow the road mapped by Warga [26,30]. Denote by S(U ) the (compact convex) set of relaxed controls corresponding to U.…”
Section: Introductionmentioning
confidence: 99%