2017
DOI: 10.1137/16m1070463
|View full text |Cite
|
Sign up to set email alerts
|

Relaxation and Purification for Nonconvex Variational Problems in Dual Banach Spaces: The Minimization Principle in Saturated Measure Spaces

Abstract: We formulate bang-bang, purification, and minimization principles in dual Banach spaces with Gelfand integrals and provide a complete characterization of the saturation property of finite measure spaces. We also present an application of the relaxation technique to large economies with infinite-dimensional commodity spaces, where the space of agents is modeled as a finite measure space. We propose a "relaxation" of large economies, which is regarded as a reasonable convexification of original economies. Under … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(15 citation statements)
references
References 38 publications
0
15
0
Order By: Relevance
“…An germinal notion of saturation already appeared in Kakutani (1944); Maharam (1942). The significance of the saturation property lies in the fact that it is necessary and sufficient for the weak compactness and the convexity of the Bochner integral of a multifunction as well as the Lyapunov convexity theorem in Banach spaces; see Khan and Sagara (2013, 2015, 2016; Podczeck (2008); Sun and Yannelis (2008).…”
Section: The Purification Principle In Saturated Measure Spacesmentioning
confidence: 99%
See 2 more Smart Citations
“…An germinal notion of saturation already appeared in Kakutani (1944); Maharam (1942). The significance of the saturation property lies in the fact that it is necessary and sufficient for the weak compactness and the convexity of the Bochner integral of a multifunction as well as the Lyapunov convexity theorem in Banach spaces; see Khan and Sagara (2013, 2015, 2016; Podczeck (2008); Sun and Yannelis (2008).…”
Section: The Purification Principle In Saturated Measure Spacesmentioning
confidence: 99%
“…In the sequel, we may assume without loss of generality that the preference map t → (t) is represented by a Carathéodory function u that is unique up to strictly increasing, continuous transformations. Following Sagara (2016), we introduce the notion of "relaxation" of preferences for large economies. Given a continuous preference (t) on X, its continuous affine extension R (t) to Π(X) is obtained by convexifying (randomizing) the individual utility function u(t, ·) in such a way…”
Section: Relaxation Of Large Economiesmentioning
confidence: 99%
See 1 more Smart Citation
“…weak compactness and convexity of the Bochner integral of a multifunction (see Podczeck (2008); Sun and Yannelis (2008)), the bang-bang principle (see Sagara (2014, 2016)), and Fatou's lemma (see ; Khan, Sagara and Suzuki (2016)). For a further generalization of Theorem 2.1 to nonseparable locally convex spaces, see Greinecker and Podczeck (2013); Sagara (2015, 2016); Sagara (2017); Urbinati (2019). Another intriguing characterization of saturation in terms of the existence of Nash equilibria in large games is found in Keisler and Sun (2009).…”
Section: Lyapunov Convexity Theorem In Banach Spacesmentioning
confidence: 99%
“…However, an infinite dimensional version of such result established by Knowles [29] can be used to establish a purification principle as in Askoura [2]. Furthermore, many works succeeded to recover this property and to establish adequate bang-bang and purification results by using Maharam types and saturated measure spaces; see Greinecker and Podczeck [10], Khan and Sagara [22,23,24,25], Sagara [32] for infinite dimensional Lyapunov convexity theorems, purification processes and applications to the integration of set-valued mappings, equilibrium theory and control systems. Refer to Keisler and Sun [19] and the literature therein for further prevalent studies on this direction.…”
Section: Introductionmentioning
confidence: 99%