1951
DOI: 10.24033/bsmf.1418
|View full text |Cite
|
Sign up to set email alerts
|

Quelques classes de problèmes extrémaux

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

1955
1955
2005
2005

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(22 citation statements)
references
References 0 publications
0
22
0
Order By: Relevance
“…Then one can show (with arguments similar to, e.g., [21], Chapitre VI; [22], p. 405) that x* is well-defined and is linear. This is clear in v, but the linearity in / needs some computation.…”
Section: mentioning
confidence: 96%
“…Then one can show (with arguments similar to, e.g., [21], Chapitre VI; [22], p. 405) that x* is well-defined and is linear. This is clear in v, but the linearity in / needs some computation.…”
Section: mentioning
confidence: 96%
“…From the Theorem A.5 of [20], we can characterize a measure, say µ * , in the set Q(M 1 , M 2 ) at which the function µ → µ(f • ) attains its minimum. It follows from a result of Rosenbloom (see [19]), that: …”
Section: Approximation Of Optimal Control By Optimal Measurementioning
confidence: 99%
“…Results of Sections 2, 3 and 4 developed the new modified minimization problem (19) with conditions (20). An interesting consequence of this development has been the straightforward of the method, we estimate the optimal control, and so the optimal shape, without any iteration, and we do not need any initial solution for the technique, as well.…”
Section: The Advantages Of the New Formulationmentioning
confidence: 99%
“…Clearly, T+ is closed under multiplication but not factorization. An analogous but wider class of functions has been considered by Rosenbloom [4]. Let Tt be that subset of T+ which is irreducible over T+ (i.e., Pm(x)eTi, Pm(x)=Pk(x)-Pm_k(x), 0<k<m, implies Pk£T+ or Pm-k(x)(£T+).…”
Section: Introductionmentioning
confidence: 99%