Abstract
The present review paper provides recent results on convexity and its applications to the constrained extension of linear operators, motivated by the existence of subgradients of continuous convex operators, the Markov moment problem and related Markov operators, approximation using the Krein–Milman theorem, related optimization, and polynomial approximation on unbounded subsets. In many cases, the Mazur–Orlicz theorem also leads to Markov operators as solutions. The common point of all these results is the Hahn–Banach theorem and its consequences, supplied by specific results in polynomial approximation. All these theorems or their proofs essentially involve the notion of convexity.
Keywords:
convex operator; Hahn–Banach theorem; Markov moment problem; norm of the solution; Markov operator; Krein–Milman theorem; optimization; polynomial approximation; unbounded subsets; quadratic forms MSC:
46A22; 46B42; 46N10; 41A10
1. Introduction
This review paper provides information on recent applications of convexity to constrained extension of linear operators, Markov moment problems, Markov operators, approximation, and elements of convex optimization. These topics have further applications in analysis, functional analysis, and other research domains.
For notions, results, and further references related to this paper, see the monographs or books [1,2,3,4,5,6,7,8,9,10,11]. A very powerful tool in solving the existence problem for solutions of many classical moment problems is pointed out in [12]. Results on Hahn–Banach theorem and its applications, some of them in the operator setting, have been published [13,14,15,16,17,18,19,20,21,22,23,24,25,26]. On the other hand, knowing the explicit form of non-negative polynomials on multidimensional closed unbounded subsets is a very difficult task. It was solved in [27] for non-negative polynomials on a strip. Old results on characterizations of the existence of a linear extension with two constraints [16,17,18] found recent applications and completions in [19], where they appear among other interesting results.
In [28], new checkable sufficient conditions for the moment determinacy of measures on and on are proven. References [29,30,31] emphasize various aspects of the moment problem, some of them being related to optimization theory. Other results on optimization and related subjects are discussed in articles [32,33,34], while approximation on weighted spaces or on unbounded subsets can be found in articles/papers [35,36].
In the sequel, we review the classical moment problem and Markov moment problem, and their relationship or applications to other areas of research. The classical full moment problem is formulated as follows: given a sequence of real numbers, and a non-empty closed subset find a positive regular Borel measure on such that the interpolation moment conditions hold:
Here we use the notations
The moment problem is an inverse problem: we are looking for an unknown positive measure on starting from its moments Finding the measure means studying its existence and uniqueness and eventually constructing it. If the corresponding moment problem is called one-dimensional. If we have a multidimensional moment problem. In a Markov moment problem, an upper constraint on the solution is required. This constraint might be:
where is an ordered Banach space (see below) of functions defined on containing the polynomials and all real-valued continuous compactly supported functions on With we denote the positive cone of which is the convex cone of functions which take non-negative values at any point of or for almost all with respect to the measure The vector-valued Markov moment problem variant is: being given an order-complete Banach lattice and a sequence of elements in find a positive linear operator such that the interpolation moment conditions
are satisfied and on , where is a given continuous convex operator. If is sublinear (and continuous), then this last upper bondedness condition on controls the continuity and sometimes the norm of the solution A variant of the full Markov moment problem is the following one: find with the interpolation moment conditions, such that
where are given bounded linear operators applying into In the case of a truncated (reduced) moment problem, the interpolation moment conditions should hold only for where is a positive integer, . If is a compact subset, then any bounded linear solution of the full moment problem is unique due to the Weierstrass approximation theorem; any continuous real function is the limit of a sequence of polynomials, the convergence being uniform on Unlike the this case, the solution of a truncated classical moment problem cannot be unique (its values on the entire space cannot be decided by its values on a finite dimensional subspace of ). An interesting problem is that of solving moment problems on closed unbounded subsets of in terms of quadratic forms. This problem is not easy since, unlike the one-dimensional case [1,4], the non-negative polynomials on unbounded subsets (such as are not expressible in terms of sums of squares [4]. In case of the Markov moment problem, the problem was discussed and solved by means of approximation of any continuous nonnegative compactly supported real-valued function defined on or on , by a sequence of special nonnegative polynomials, which are expressible in terms of sums of squares ([21,36] and the references therein). The approximation holds in spaces or respectively, in where , being a positive regular Borel moment determinate measure on or respectively, with finite moments of all orders. We recall that a measure on the closed subset is called moment-determinate (-determinate) if it is uniquely determined by its moments (all the involved measures appearing in this work are assumed to be regular Borel measures, with finite moments of all orders. Although the approximations on unbounded subsets were motivated first by solving Markov moment problems in terms of quadratic forms, such results found an application to characterizing the positivity of some bounded linear operators defined on only in terms of quadratic forms, where is as above. A similar result works for bounded linear operators defined on each being -determinate on , Another application of the solution of an abstract moment problem was recently reviewed in [37], where the existence of at least one feasible solution for an optimization problem with infinitely many constraints is characterized ([37], Theorem 4). The existence of at least one optimal feasible solution is proven as well. The idea of solving such problems comes from the PhD thesis [38], in which a similar problem involving a finite number of moments, in an space, is solved. Unlike the case of infinitely many moments interpolation conditions, if only a finite number of moments are involved, construction of the solutions comes under attention. This is also the case for references [39,40], in which construction of a solution for a truncated Markov moment problem is studied, and related algorithms are provided using deep results in matrix theory, measure theory, and other areas of analysis and algebra. Other optimization problems related to reduced moment problems are discussed in [30,31]. In [21], among other theorems, the positivity of some bounded linear operators on spaces of functions of several real variables is characterized only in terms of quadratic forms. In [41], an unusual sandwich-type result on finite simplicial sets is proven for the first time. The point is the fact that a finite simplicial set may be unbounded in any locally convex topology on the domain space. Finally, the article [42] provides a characterization of the finite dimensional bounded convex subsets in an arbitrary vector space in terms of the lower boundedness of convex operators defined on them. The codomain is assumed to be order-complete to make the Hahn–Banach theorem and its application to the existence of subgradients of convex operators effective. Other old results from [16,17] on constrained extension and decomposition as a difference of two positive linear operators found recent applications in [19]. Namely, in [19], among other results, the isotonicity (the property of being monotone increasing) for a continuous convex operator defined on the positive cone of the domain space is characterized in terms of its subgradients. Notably, we recall that Krein–Milman theorem plays an important role in the representation theory [2,8,21]. Almost all the abovementioned results have interesting geometric meaning, which is supported by clear rigorous proofs. For example, the sandwich-type result proven in reference [41] is relevant since it proves the existence of an affine function on , in which the two functions and are given convex functions on a finite simplicial convex set This is an unusual sandwich result since it is a converse variant of sandwich results based on the separation of convex sets. Moreover, generally, a finite simplicial convex set may be unbounded. The proof of the first such result is essentially based on the solution of an abstract Markov moment problem.
The notion of a Markov operator is emphasized in [19,20]. These special bounded linear operators have interesting properties and appear naturally as subgradients of continuous sublinear operators, or as solutions of Markov moment problems or Mazur–Orlicz type problems. We hope this work will be useful for readers interested in analysis and its applications because it joins various directions of applications under the general thematic of convexity. In the sequel, we recall some basic definitions. If are ordered vector spaces with positive cones and respectively, then a linear operator is called positive if
In other words, in in From the linearity of we infer that is positive if and only if which means that is isotone (increasingly monotone) on . An ordered vector space which is also a Banach space is called an ordered Banach space if the positive cone is topologically closed and the norm is increasingly monotone on
Thus, in an ordered Banach space, the norm is compatible with the (linear) order relation. Banach lattice is a Banach space which is also a vector lattice such that
We recall that in a vector lattice for any , one defines
Thus, is the least upper bound of the set it exists according to the definition of a vector lattice (see [6] or [7]). From these definitions, it follows that any Banach lattice is an ordered Banach space, but the converse is not true. Most of the function spaces (and sequence spaces) are Banach lattices. An example of an ordered Banach space which is not a lattice is the space of all symmetric matrixes with real entries. The order relation on this space is defined by: for all The norm of a matrix is defined by where is the Euclidean norm on As is well known, the symmetric matrix naturally defines a symmetric linear operator (denoted also by , acting on The symmetry condition for this linear operator is written as follows: for all Conversely, being given a linear operator which maps into itself for which the above symmetry condition is verified, the associated matrix , where , is symmetric. Here, is an orthonormal base of . Referencing the infinite dimensional Hilbert space case, let be a real or complex infinite dimensional Hilbert space. A self-adjoint operator acting on is a bounded linear symmetric operator applying into The symmetry condition is written as follows, from the matrix setting mentioned above:
The order relation and the norm on the real vector space of all self-adjoint operators acting on can be written as above for symmetric matrixes. With these structures, is an ordered real Banach space, which is not a lattice. Finally, we recall that any positive linear operator acting on ordered Banach spaces is continuous [9,19]. This result is relevant because it avoids the effort of the reader in proving the continuity of such operators. For example, if are Banach lattices and are two linear operators mapping into such that on then, according to the invoked result, the two operators are continuous. Moreover, it is easy to prove that our conditions imply .
2. Methods
The basic methods applied in the sequel are:
- General notions and results on positive linear operators, convex operators and their subdifferentials, ordered Banach spaces, Banach lattices.
- General Hahn–Banach-type theorems and some of their applications.
- The classical full and/or truncated moment problem. Markov operators as solutions of moment problems in concrete spaces or as solutions of Mazur–Orlicz theorems.
- Extending inequalities from a small set to an entire convex cone via approximation provided by the Krein–Milman theorem. Elements of convex optimization theory are also applied.
- Results on polynomial approximation on unbounded subsets are applied in Section 3.3. The role played by regular moment determinate positive Borel measures on closed unbounded finite dimensional sets is a key point in this topic [21,36].
3. Results
3.1. Hahn–Banach Theorem, Markov Moment Problem, and Markov Operators
First variants of Hahn–Banach theorem on extension of linear operators dominated by convex continuous operators have been applied to the subject of subdifferentiability of convex continuous operators [13,14,15]. Another domain of applications of Hahn–Banach-type results—and, conversely, a motivation for stating and proving such results—was that of solving moment problems. The full classical moment problem in the operator setting is an interpolation problem, with the positivity constraint on the linear solution on the positive cone of the domain function Banach space which must contain the polynomials and the space of real-valued continuous compactly supported functions defined on an arbitrary closed subset of . The values of the solution on the basic polynomials
are prescribed: we must have
and the positivity condition
Here, the elements are contained in the order-complete Banach lattice The order completeness requirement on allows applying Hahn–Banach-type results to the extension of linear operators having as their codomain. The existence, the uniqueness, and the construction of the linear solution are studied. The Markov moment problem requires one more condition on the solution . This requirement can be written as
where is a continuous sublinear operator (or, more generally, is a continuous convex operator). Sometimes, is defined only on , with range contained in The above stated moment problem is the full moment problem since it involves the moments of all orders. If condition (1) is required only for , for some fixed positive integer then we have a truncated (reduced) moment problem.
Notably, the existence problem is an extension problem of the linear operator defined on the space of all polynomial functions to the entire Banach space such that the moment conditions (1) and the constraints (2) (and, for a Markov moment problem also (3)) are satisfied. Hence, we can apply a Hahn–Banach-type theorem. We start by recalling a general result and its variant related to the Mazur–Orlicz theorem. Then, we apply these theoretical results to concrete spaces, pointing out the notion of a Markov operator.
Theorem 1
([18]). Let be a preordered vector space, an order complete vector lattice, a convex operator, given families. The following statements are equivalent:
- (a)
- there exists a linear positive operatorsuch that
- (b)
- for any finite subsetwe have
If we additionally we assume thatis isotone, the assertions (a) and (b) are equivalent to (c), where:
- (c)
- for any finite subsetand any , the following inequality holds:
Theorem 1 is the reformulation of the following extension result, in which the interpolation moment conditions do not appear explicitly. Theorem 2 below was initially stated in [16] and proven in [17], where it was deduced from a more general result (Theorem 1 of [16]).
Theorem 2.
Letbe an ordered vector space,an order complete vector space,a vector subspace,a linear operator,a convex operator. The following statements are equivalent:
- (a)
- there exists a positive linear extension of such that on
- (b)
- we have for allsuch that
One observes that in the very particular case when the order relation on is the equality, from Theorem 2, one obtains the Hahn–Banach extension theorem for linear operators dominated by convex operators.
Another version of the same result is found in [21].
Theorem 3.
Letbe an ordered vector space,an order complete vector space,a vector subspace,a linear operator,a convex operator. The following statements are equivalent:
- (a)
- there exists a positive linear extension ofsuch that
- (b)
- we have for allsuch that
Theorem 4
(Mazur-Orlicz [18]). Let be a preordered vector space, an order complete vector space,,families of elements in respectively in a sublinear operator. The following statements are equivalent:
- (a)
- there exists a linear positive operatorsuch that
- (b)
- for any finite subset and any , the following implication holds true
If we additionally assume that is isotone, the assertions (a) and (b) are equivalent to the following condition (c):
- (c)
- for any finite subsetand any the following inequality holds
The next results refer to the Markov moment problem on the space as the domain space of the solution, where is an arbitrary compact Hausdorff topological space.
A version of the abstract Markov moment problem has been already stated in Theorem 1 above. The classical moment problem and Markov moment problem have been reviewed in the Introduction. In the next theorem, denotes the constant function which equals the number at any point of and the class of the same function, regarded as an element of
Theorem 5.
Letbe a compact Hausdorff topological space,a positive regular Borel measure onthe Banach lattice of all real valued continuous functions ona family of linearly independent elements ina given family of elements in. The following two statements are equivalent
- (a)
- there exists a linear (positive) bounded operator such that
In particular, the following equalities hold
- (b)
- for any finite subset and any the following relation holds true
Proof.
The implication ⇒ (b) is obvious, thanks to the properties of To prove one applies Theorem 1, implying for
Observe that defined by (5) is a scalar-valued sublinear nondecreasing functional multiplied by the class of the constant function in and therefore is an isotone sublinear operator. The inequality (4) is equivalent to the fact that the condition written at point (c) of Theorem 1 is accomplished. Since is an order-complete vector lattice, according to Theorem 1, there exists a positive linear operator with the properties mentioned at point (a) of the latter theorem. It results . Moreover, the following implications hold:
For it results in we say that is unital. Since any with is situated in the order interval , the positivity of leads to However, we have already seen that Hence, and the proof is complete. □
In the next theorem, will be a compact subset of ( is a natural number), , and is an order-complete Banach lattice with a strong order unit such that the order interval is equal to the closed unit ball of As usual, we denote:
Theorem 6.
Let, for some fixed The following statements are equivalent:
- (a)
- there exists a positive linear operator such that
- (b)
- for any the following relation holds
Proof.
One repeats the proof of Theorem 5, in which we replace with to obtain
Some of the notations have been defined before the statement. Clearly, from (6) with positive and unital relation (7) follows. For the converse, repeating the arguments from the proof of Theorem 5, the existence of a positive linear operator verifying (6) follows (via Theorem 1, (c)⇒(a)). Here, the subspace is the linear subspace of all polynomial functions on of degree From (6), in particular, follows as well, and the proof is complete.□
When applying the Mazur–Orlicz theorem (Theorem 4), one can work with the subspace of all polynomial functions on , without any restriction on the degree (one proves a full Mazur–Orlicz theorem). Such a result is not a direct consequence of the density of polynomials in unlike the case of the full moment problem for In Theorem 6, a solution for a truncated moment problem was proposed. A linear operator mapping into is called a Markov operator if is positive and (the definition is valid for any Hausdorff compact topological space ). It is easy to observe that a linear operator is a Markov operator if and only if In particular, solutions from Theorems 5, 6, and 7 (the last one being proven below) are Markov operators. Let be and order complete Banach lattice with a strong order unit a sequence in We prove the following theorem.
Theorem 7.
Letbe such that:is compact and denoteThe following statements are equivalent:
- (a)
- there exists a (positive) linear operatorsuch that
- (b)
Proof.
The implication (a)(b) is obvious thanks to the properties of Namely, the following relations hold true:
To prove (b)⇒(a), we use the implication (c)⇒(a) of Theorem 4. The conditions mentioned at (c) of Theorem 4 are satisfied, since for any finite subset , the following inequalities hold:
According to Theorem 4, (c)⇒(a), there exists a positive linear operator with the properties mentioned at point (a) of the present theorem. This ends the proof. □
We next recall an example of an order complete Banach lattice of self-adjoint operators acting on an arbitrary Hilbert space, which is also a commutative real algebra [7]. This example works for symmetric matrices with real entries.
Example 1.
Letbe a Hilbert space andbe a self-adjoint operator acting onWe define:
Then, is an order complete Banach lattice with strong order unit for identity operator . By its definition, it is also a commutative real algebra.
3.2. On Some Applications of the Krein–Milman Theorem
The next results follow via Krein–Milman Theorem. If is a compact convex subset of a locally convex space, we denote with the set of all extreme points of
Theorem 8.
Let be a reflexive Banach space endowed with a linear order relation defined by a closed positive cone, anda convex bounded closed subset such that anycan be represented uniquely asfor someand(is a base forAssume thatis a topological vector space endowed with an order relation defined by a closed positive cone is a bounded sublinear operator, andis a bounded linear operator such that
Then
Proof.
Clearly, is weakly compact and convex, so The topological closure of the convex set in the weak topology equals its topological closure in the topology defined by the norm of Let
Then, from the assumptions of the statement, we derive
For . For all the continuity of , as well as the hypothesis that the positive cone of is closed, leads to
Now let Then,
This ends the proof. □
Corollary 1.
Under the hypothesis of Theorem 8, additionally assume that are normed vector lattices (their norms are solid), and is isotone. Then
Proof.
According to Theorem 8, we have already seen that for all . Using this and the monotonicity of we derive
This concludes the proof. □
The next results extend an inequality occurring on a small set to a much larger subset.
Theorem 9.
Let be a reflexive Banach lattice an order complete Banach lattice in which every topological bounded subset is order-bounded andimplies,a quasiconvex continuous positively homogeneous operator, anda positive linear operator such thatfor all extreme pointsof the setThen
Proof.
Recall that operator from a convex subset of vector space to vector lattice is called quasiconvex if
Following the proof (by induction) of Jensen’s inequality for real convex functions, for any convex combination , quasiconvex operator verifies
See [8] for details, examples, and exercises related to this important notion. The set is convex, weakly compact, and
holds due to the Krein–Milman theorem. Let
From the above remarks, and using the hypothesis, we infer that
On the other side, any positive linear operator from to is continuous, so that the image of the bounded set through the positive (bounded) linear operator is topologically bounded. Therefore, it is bounded in Thus it results
From this and using (9), we find that
If where for all , thanks to the continuity of we are leaded to
Since is positively homogeneous, application of this evaluation to for all yields
This ends the proof. □
Theorem 10.
Let be an order complete normed vector lattice,a finite dimensional compact subset, anda sequence of continuous sublinear operators fromintosuch that for eachthere exists Assume that for eachthere exists an affine operatorfromtosuch that and there exists
Then,
where
is the convex cone generated by
Proof.
It is known that for any finite dimensional compact its convex hull is compact as well (the proof of this assertion is based on Carathéodory’s theorem, which leads to a way of expressing as the image of a compact (finite dimensional) subset through a continuous mapping). Let be the dimension of the linear variety generated by (and by ) and Assume that Due to Carathéodory’s theorem, there exist at most extreme points in the compact (convex) subset —for example, and such that Additionally, it is known that any extreme point of is an extreme point of From this hypothesis, we derive
Thus, there exists On the other side, the positive cone of the space is closed, and we have assumed that for all and all . Passing to the limit, one obtains
Since is the pointwise limit of affine operators, it is affine on ; a Hahn–Banach argument shows that it has an affine extension defined on the whole space into We denote this extension with as well. Recall that if is not an element of then we denote
It is easy to see that in this case, Now (10) and (11) yield
If then could satisfy the condition or might be a nonzero vector subspace (here is the relative interior of We denote with the convex hull of the set When is an -dimensional vector subspace of In both of these last two cases, the conclusion of the theorem still holds true, following the same proof as in the first case. This concludes the proof. □
In the sequel, we recall a consequence of the Carathodory’s theorem [8,21] and give a possible formulation for the infinite dimensional convex compact subsets. Namely, the following useful maximum principle for convex continuous real functions on finite dimensional convex compact subsets holds. If is a continuous convex real function on a convex compact subset, then attains a global maximum at an extreme point of For infinite dimensional convex compact subsets we derive from the Krein-Milman theorem the next result.
Theorem 11.
Let be a compact convex subset in the locally convex space and a convex continuous function. Then
Proof.
Let The continuity of implies the compactness of so
On the other hand, from Krein–Milman theorem, we know there exists a net with terms in the convex hull of the set of all extreme points of such that
If then the convexity and the continuity of the function yields
for all This results in The inequality in the reversed sense is obvious. This ends the proof. □
Here follows a vector valued version of Theorem 11.
Corollary. 2
Letbe a compact convex subset in the locally convex space and let be an order complete Banach lattice endowed with a strong order unit such that the closed unit ball in equals the order interval . Let be a continuous convex operator. Then,
Proof.
The subset is compact in thanks to the continuity of the operator In particular, is bounded, so there exists great enough such that the closed ball centered in of radius contains We infer that:
A first conclusion is that there exists because of the order completeness of . The rest of the proof follows the method and the inequalities from the proof of Theorem 11. This ends the proof. □
In what follows, we add related remarks. To do this, we require the following lemma [11].
Lemma 1.
Let be a real normed linear space,a continuous linear functional onanda closed hyperplane defined byThen, the distancefromtois provided by the formula:
Remark 1.
Assume now thatis not an element of Then, there exists a strictly positive linear continuous form on endowed with the order relation defined by such that and that there is a constant with
Indeed, denote by . Then, is a convex open neighborhood of the origin which does not intersect Using the geometric form of the Hahn–Banach theorem (namely a separation theorem), there exists a closed hyperplane separating and and not intersecting , i.e., there exists a linear continuous functional on such that In particular,
Hence is strictly positive and for any the set is a compact base for Now, scaling by a positive scalar, we obtain a new strictly continuous positive form (which we also denote by with the special property
This results in
Let be such that Then, and Thus, Consider the hyperplane and the base Then, the distance
as expected, ( and are separating and , but they are “tangent” to both these closed convex subsets). If is a real Hilbert space and possesses the properties from above, then is the orthogonal (or metric) projection of to Consequently,
Having in mind the idea of the proof of the Riesz representation theorem for linear continuous forms on a Hilbert space, this results in being represented by a vector which is collinear to Since we must normalize This gives
3.3. Applying Polynomial Approximation on Unbounded Subsets
Applying polynomial approximation [21,36] on of any nonnegative continuous compactly supported function by dominating polynomials on the entire semiaxes as well as the explicit form of such a polynomial, namely
for some one can prove the following result. As is well known, any nonnegative polynomial on the entire real axes is the sum of two squares [1]:
Theorem 12.
Let where is a moment-determinate measure on
Assume that
is an arbitrary order complete Banach lattice and that
is a given sequence with its terms in
Let
be two linear operators from
to
, such that
on
As usual, we denote
The following statements are equivalent:
- (a)
- There exists a unique bounded linear operator from into on , such that for all
- (b)
- Ifis a finite subset, andthen
Corollary 3.
Let
be a moment-determinate measure on
Assume that
are two functions in
such that
almost everywhere. Let
be a given sequence of real numbers. The following statements are equivalent:
- (a)
- there exists such that almost everywhere; for all
- (b)
- if is a finite subset and then:
4. Discussion
First, results reviewed in this paper refer to the Hahn–Banach- and Mazur–Orlicz-type theorems involving linear operators as extensions, and convex or sublinear operators as dominating constraint on the extension. The positivity of the solutions is also a result of these general theorems. Next, applications to concrete spaces are discussed. Here, Markov operators appear as linear solutions. Second, approximation via the Krein–Milman theorem is applied to extending properties from a small set to the entire positive cone of the domain space. Elements of optimization are deduced as well. Third, polynomial approximation on closed unbounded subsets is applied to the characterization of existence and uniqueness of the solution for a Markov moment problem in terms of quadratic forms. Here, the Hahn–Banach theorem does not appear explicitly, but it is essentially used in proving previous results on which Section 3.3 is based. The common point of these three subjects is the notion of convexity (especially related to the Hahn–Banach theorem) completed by polynomial approximation in spaces, where is a closed unbounded subset and is a moment determinate positive regular Borel measure on The reader could find other aspects of the subjects discussed here in the references below. As a direction for continuing this work, one can study more deeply the multidimensional case for results as those of Section 3.3. In the Introduction, a few applications of Hahn–Banach theorem are briefly discussed by means of the reference citations. Connections or applications of the moment problem and of the Hahn–Banach theorem to optimization theory, polynomial approximation on unbounded subsets, characterizing positivity of some bounded linear operators, nonstandard sandwich type results, and elements of representation theory, are pointed out. A common point of all subsections of Section 3 is the fact that all these results are directly or indirectly related to Hahn–Banach-type theorems and/or the moment problem.
Funding
This research received no external funding.
Data Availability Statement
Not applicable.
Conflicts of Interest
The author declares no conflict of interest.
References
- Akhiezer, N.I. The Classical Moment Problem and Some Related Questions in Analysis; Oliver and Boyd: Edinburgh, UK, 1965. [Google Scholar]
- Berg, C.; Christensen, J.P.R.; Ressel, P. Harmonic Analysis on Semigroups; Theory of Positive Definite and Related Functions; Springer: New York, NY, USA, 1984. [Google Scholar]
- Krein, M.G.; Nudelman, A.A. Markov Moment Problem and Extremal Problems; American Mathematical Society: Providence, RI, USA, 1977. [Google Scholar]
- Schmüdgen, K. The Moment Problem. In Graduate Texts in Mathematics; Springer International Publishing AG: Cham, Switzerland, 2017. [Google Scholar]
- Rudin, W. Real and Complex Analysis, 3rd ed.; McGraw-Hill Book Company: Singapore, 1987. [Google Scholar]
- Schaefer, H.H.; Wolff, M.P. Topological Vector Spaces, 2nd ed.; Springer: New York, NY, USA, 1999. [Google Scholar]
- Cristescu, R. Ordered Vector Spaces and Linear Operators; Academiei: Bucharest, Romania; Abacus Press: Tunbridge Wells, UK, 1976. [Google Scholar]
- Niculescu, C.P.; Persson, L.-E. Convex Functions and Their Applications. A Contemporary Approach, 2nd ed.; CMS Books in Mathematics; Springer: New York, NY, USA, 2018; Volume 23. [Google Scholar]
- Niculescu, C.; Popa, N. Elements of Theory of Banach Spaces; Academiei: Bucharest, Romania, 1981. (In Romanian) [Google Scholar]
- Holmes, R.B. Geometric Functional Analysis and its Applications; Springer: New York, NY, USA, 1975. [Google Scholar]
- Singer, I. Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces; Springer: Berlin, Germany; New York, NY, USA, 1970. [Google Scholar]
- Haviland, E.K. On the momentum problem for distributions in more than one dimension. Am. J. Math. 1936, 58, 164–168. [Google Scholar] [CrossRef] [Scilit]
- Valadier, M. Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné (Subdifferentiability of convex functions having as codomain an ordered vector space). Math. Scand. 1972, 30, 65–74. [Google Scholar] [CrossRef] [Scilit]
- Zowe, J. Sandwich Theorems for Convex Operators with Values in an Ordered Vector Space. J. Math. Anal. Appl. 1978, 66, 282–296. [Google Scholar] [CrossRef] [Scilit]
- Kutateladze, S.S. Convex operators. Russ. Math. Surv. 1979, 34, 181–214. [Google Scholar] [CrossRef] [Scilit]
- Olteanu, O. Convexité et prolongement d’opérateurs linéaires (Convexity and extension of linear operators). C. R. Acad. Sci. Paris 1978, 286, 511–514. [Google Scholar]
- Olteanu, O. Théorèmes de prolongement d’opérateurs linéaires (Theorems of extension of linear operators). Rev. Roum. Math. Pures Appl. 1983, 28, 953–983. [Google Scholar]
- Olteanu, O. Application de théorèmes de prolongement d’opérateurs linéaires au problème des moments e à une generalization d’un théorème de Mazur-Orlicz, (Applications of theorems on extension of linear operators to the moment problem and to a generalization of Mazur-Orlicz theorem). C. R. Acad. Sci. Paris 1991, 313, 739–742. [Google Scholar]
- Niculescu, C.P.; Olteanu, O. From the Hahn-Banach extension theorem to the isotonicity of convex functions and the majorization theory. Rev. R. Acad. Cienc. Exactas Fis. Nat. 2020, 114, 171. [Google Scholar] [CrossRef] [Scilit]
- Olteanu, O. New results on extension of linear operators and Markov moment problem. MathLAB J. 2020, 5, 143–154. [Google Scholar]
- Olteanu, O. On Hahn-Banach theorem and some of its applications. Open Math. 2022, 20, 366–390. [Google Scholar] [CrossRef] [Scilit]
- Montiel López, P.; Ruiz Galán, M. Revisiting the Hahn-Banach theorem and nonlinear infinite programming. J. Math. Anal. Appl. 2017, 455, 1037–1050. [Google Scholar] [CrossRef] [Scilit]
- Ruiz Galán, M. A version of the Lax–Milgram theorem for locally convex spaces. J. Convex Anal. 2009, 16, 993–1002. [Google Scholar]
- Simons, S. The asymmetric sandwich theorem. J. Convex Anal. 2013, 20, 107–124. [Google Scholar]
- Simons, S. Bootstrapping the Mazur–Orlicz–König theorem and the Hahn–Banach–Lagrange theorem. J. Convex Anal. 2018, 25, 691–699. [Google Scholar]
- Boccuto, A. Hahn-Banach and sandwich theorems for equivariant vector lattice-valued operators and applications, Tatra Mt. Math. Publ. 2020, 76, 11–34. [Google Scholar] [CrossRef] [Scilit]
- Marshall, M. Polynomials non-negative on a strip. Proc. Am. Math. Soc. 2010, 138, 1559–1567. [Google Scholar] [CrossRef] [Scilit]
- Stoyanov, J.M.; Lin, G.D.; Kopanov, P. New checkable conditions for moment determinacy of probability distributions. SIAM Theory Probab. Appl. 2020, 65, 497–509. [Google Scholar] [CrossRef] [Scilit]
- Stochel, J. Solving the truncated moment problem solves the full moment problem. Glasg. Math. J. 2001, 43, 335–341. [Google Scholar] [CrossRef] [Scilit]
- Tagliani, A. Maximum entropy solutions and moment problem in unbounded domains. Appl. Math. Lett. 2003, 16, 519–524. [Google Scholar] [CrossRef] [Scilit]
- Inverardi, P.L.N.; Tagliani, A. Stieltjies and Hamburger reduced moment problem when MaxEnt solution does not exist. Mathematics 2021, 9, 309. [Google Scholar] [CrossRef] [Scilit]
- Cobzaş, Ș. Geometric properties of Banach spaces and the existence of nearest and farthest points. Abstr. Appl. Anal. 2005, 2005, 259–285. [Google Scholar] [CrossRef] [Scilit]
- Cobzaş, Ș. Ekeland variational principle and its equivalents in quasi-uniform spaces. Optimization 2022, 1–32. [Google Scholar] [CrossRef] [Scilit]
- Pakkaranang, N.; Kumam, P.; Cho, Y.J. Proximal point algorithms for solving convex minimization problem and common fixed points of asymptotically quasi-nonexpansive mappings in in CAT(0) spaces with convergenece analysis. Numer. Algorithms 2018, 78, 827–845. [Google Scholar] [CrossRef] [Scilit]
- Bucur, I.; Păltineanu, G. De Branges type lemma and approximation in weighted spaces. Mediterr. J. Math. 2021, 18, 120. [Google Scholar] [CrossRef] [Scilit]
- Olteanu, O. On Markov moment problem and related results. Symmetry 2021, 13, 986. [Google Scholar] [CrossRef] [Scilit]
- Olteanu, O. On special properties for continuous convex operators and related linear operators. Symmetry 2022, 14, 1390. [Google Scholar] [CrossRef] [Scilit]
- Norris, D.T. Optimal Solutions to the Moment Problem with Lattice Bounds. Ph.D. Thesis, Department of Mathematics, College of Arts and Sciences, University Colorado Boulder, Boulder, CO, USA, 2002. [Google Scholar]
- Gosse, L.; Runborg, O. Resolution of the finite Markov moment problem. C. R. Acad. Sci. Paris 2005, 341, 775–780. [Google Scholar] [CrossRef] [Scilit]
- Gosse, L.; Runborg, O. Existence, uniqueness, and a constructive solution algorithm for a class of finite Markov moment problems. SIAM J. Appl. Math. 2008, 68, 16181640. [Google Scholar] [CrossRef] [Scilit]
- Ambrozie, C.; Olteanu, O. A sandwich theorem, the moment problem, finite-simplicial sets and some inequalities. Rev. Roum. Math. Pures Appl. 2004, 49, 189–210. [Google Scholar]
- Olteanu, O. Sur les fonctions convexes définies sur les ensembles convexes bornés de (On convex functions defined on bounded convex subsets of ). C. R. Acad. Sci. Paris 1980, 290, 837–838. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).