scholarly journals On the Lyapunov convexity theorem with appications to sign-embeddings

1992 ◽  
Vol 44 (9) ◽  
pp. 1091-1098 ◽  
Author(s):  
V. M. Kadets ◽  
M. M. Popov
2001 ◽  
Vol 26 (6) ◽  
pp. 371-383
Author(s):  
Slawomir Dorosiewicz

This paper gives the formal definition of a class of optimization problems, that is, problems of finding conditional extrema of given set-measurable functions. It also formulates the generalization of Lyapunov convexity theorem which is used in the proof of first-order optimality conditions for the mentioned class of optimization problems.


1964 ◽  
Vol 7 (1) ◽  
pp. 97-100
Author(s):  
P. S. Bullen

In a recent paper, [l], Dixmier has proved Heinz' inequality by deducing it from a lemma due to Thorin. In this note it is proved directly from a convexity theorem.Let(M(k), ℳ(k), μ(k)), k = 0, …, n, be measure spaces and Lq(k) (M(k), ℳ(k), μ(k)) be all the functions on M(k) such that


1990 ◽  
Vol 41 (2) ◽  
pp. 271-281
Author(s):  
Nikolaos S. Papageorgiou

Let F: T → 2x \ {} be a closed-valued multifunction into a separable Banach space X. We define the sets and We prove various convergence theorems for those two sets using the Hausdorff metric and the Kuratowski-Mosco convergence of sets. Then we prove a density theorem of CF and a corresponding convexity theorem for F(·). Finally we study the “differentiability” properties of K(·). Our work extends and improves earlier ones by Artstein, Bridgland, Hermes and Papageorgiou.


Sign in / Sign up

Export Citation Format

Share Document