An Eberlein–Šmulian type result for the weak* topology

We present a result on relative weak* compactness in the dual of a Banach space X that allows a short proof of both the Eberlein–Šmulian theorem and Šmulian’s characterisation of weak compactness of closed convex subsets of X.     

On weak compactness of bounded sets in Banach and locally convex spaces

We investigate the compactness of one class of bounded subsets in Banach and locally convex spaces. We obtain a generalization of the Banach-Alaoglu theorem to a class of subsets that are not polars of convex balanced neighborhoods of zero. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 52, No. 6, pp 731–739, June. 2000.     

A generalized KKMF principle

We present in this paper a generalized version of the celebrated Knaster-Kuratowski-Mazurkiewicz-Fan's principle on the intersection of a family of closed sets subject to a classical geometric condition and a weakened compactness condition. The fixed point formulation of this generalized principle extends the Browder-Fan fixed point theorem to set-valued maps of non-compact convex subsets of topological vector spaces.     

Inequality problems of quasi-hemivariational type involving set-valued operators and a nonlinear term

The aim of this paper is to establish the existence of at least one solution for a general inequality of quasi-hemivariational type, whose solution is sought in a subset K of a real Banach space E. First, we prove the existence of solutions in the case of compact convex subsets and the case of bounded closed and convex subsets. Finally, the case when K is the whole space is analyzed and necessary and sufficient conditions for the existence of solutions are stated. Our proofs rely essentially on the Schauder’s fixed point theorem and a version of the KKM principle due to Ky Fan (Math Ann 266:519–537, 1984).     

Continuous Selections and Locally Pseudocompact Groups

We characterize locally pseudocompact groups by means of the selection theory. Our result is the selection version of the well-known Comfort—Ross theorem on pseudocompactness which states that a topological group is pseudocompact if and only its Stone—Čech compactification is a topological group.     

Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form

We generalize primal—dual interior-point methods for linear programming (LP) problems to the convex optimization problems in conic form. Previously, the most comprehensive theory of symmetric primal—dual interior-point algorithms was given by Nesterov and Todd for feasible regions expressed as the intersection of a symmetric cone with an affine subspace. In our setting, we allow an arbitrary convex cone in place of the symmetric cone. Even though some of the impressive properties attained by Nesterov—Todd algorithms are impossible in this general setting of convex optimization problems, we show that essentially all primal—dual interior-point algorithms for LP can be extended easily to the general setting. We provide three frameworks for primal—dual algorithms, each framework corresponding to a different level of sophistication in the algorithms. As the level of sophistication increases, we demand better formulations of the feasible solution sets. Our algorithms, in return, attain provably better theoretical properties. We also make a very strong connection to quasi-Newton methods by expressing the square of the symmetric primal—dual linear transformation (the so-called scaling) as a quasi-Newton update in the case of the least sophisticated framework. August 25, 1999. Final version received: March 7, 2001.     

Finite-tight sets

We introduce two notions of tightness for a set of measurable functions — the finite-tightness and the Jordan finite-tightness with the aim to extend certain compactness results (as biting lemma or Saadoune-Valadier’s theorem of stable compactness) to the unbounded case. These compactness conditions highlight their utility when we look for some alternatives to Rellich-Kondrachov theorem or relaxed lower semicontinuity of multiple integrals. Finite-tightness locates the great growths of a set of measurable mappings on a finite family of sets of small measure. In the Euclidean case, the Jordan finite-tight sets form a subclass of finite-tight sets for which the finite family of sets of small measure is composed by d-dimensional intervals. The main result affirms that each tight set H ⊆ W ^1,1 for which the set of the gradients ∇H is a Jordan finite-tight set is relatively compact in measure. This result offers very good conditions to use fiber product lemma for obtaining a relaxed lower semicontinuity condition.      

Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications

In this paper, new necessary conditions for Pareto minimal points to sets and Pareto minimizers for constrained multiobjective optimization problems are established without the sequentially normal compactness property and the asymptotical compactness condition imposed on closed and convex ordering cones in Bao and Mordukhovich [10] and Durea and Dutta [5], respectively. Our approach is based on a version of the separation theorem for nonconvex sets and the subdifferentials of vector-valued and set-valued mappings. Furthermore, applications in mathematical finance and approximation theory are discussed.     

Remarks on the set-valued integrals of Debreu and Aumann

Some recently obtained sufficient conditions for the weak compactness of subsets of L¹(m, X) are used to show that for functions whose values are compact, convex subsets of a Banach space the Debreu integral, when it exists, is the same as the Aumann integral. Here no assumption is made concerning the reflexivity of X. This result extends to functions whose values are weakly compact, convex subsets of Banach space.     

Canonization theorems for finite affine and linear spaces

In this paper we prove a canonical (i.e. unrestricted) version of the Graham—Leeb—Rothschild partition theorem for finite affine and linear spaces [3]. We also mention some other kind of canonization results for finite affine and linear spaces.     

Uniformity seminorms on ℓ<Superscript>∞</Superscript> and applications

A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on ℤ/Nℤ introduced by Gowers in his proof of Szemerédi’s Theorem, used to detect uniformity of subsets of the integers. Another example is the seminorms on bounded functions in a measure preserving system (associated to the averages in Furstenberg’s proof of Szemerédi’s Theorem) defined by the authors. For each integer k ≥ 1, we define seminorms on ℓ^∞(ℤ) analogous to these norms and seminorms. We study the correlation of these norms with certain algebraically defined sequences, which arise from evaluating a continuous function on the homogeneous space of a nilpotent Lie group on a orbit (the nilsequences). Using these seminorms, we define a dual norm that acts as an upper bound for the correlation of a bounded sequence with a nilsequence. We also prove an inverse theorem for the seminorms, showing how a bounded sequence correlates with a nilsequence. As applications, we derive several ergodic theoretic results, including a nilsequence version of the Wiener-Wintner ergodic theorem, a nil version of a corollary to the spectral theorem, and a weighted multiple ergodic convergence theorem.     

The graphs of polytopes with involutory automorphisms

Steinitz’ theorem states that a graph is the graph of a 3-dimensional convex polytope if and only if it is planar and 3-connected. Grünbaum has shown that Steinitz’ proof can be modified to characterize the graphs of polytopes that are centrally symmetric or have a plane of symmetry. We show how to modify Steinitz’ proof to take care of the remaining involutory case—polytopes that are symmetric about a line. Research supported by NSF Grant GP-3470.     

Some argument inequalities for certain analytic functions

For analytic functions f(z) in the open unit disk U and convex functions g(z) in U, Nunokawa et al. [NUNOKAWA, M.—OWA, S.—NISHIWAKI, J.—KUROKI, K.—HAYAMI, T: Differential subordination and argumental property, Comput. Math. Appl. 56 (2008), 2733–2736] have proved one theorem which is a generalization of the result [POMMERENKE, CH.: On close-toconvex analytic functions, Trans. Amer. Math. Soc. 114 (1965), 176–186]. The object of the present paper is to generalize the theorem due to Nunokawa et al..     

Neighborhoods of extreme points

An examination of relationship between two neighborhood systems (relative to two linear topologies) of extreme points yields a unified approach to some known and new results, among which are Bessaga-Pełczyński’s theorem on closed bounded convex subsets of separable conjugate Banach spaces and Ryll-Nardzewski’s fixed point theorem. This research was partly supported by the U.S. National Science Foundation.     

An Answer to S. Simons’ Question on the Maximal Monotonicity of the Sum of a Maximal Monotone Linear Operator and a Normal Cone Operator

The question whether or not the sum of two maximal monotone operators is maximal monotone under Rockafellar’s constraint qualification—that is, whether or not “the sum theorem” is true—is the most famous open problem in Monotone Operator Theory. In his 2008 monograph “From Hahn-Banach to Monotonicity”, Stephen Simons asked whether or not the sum theorem holds for the special case of a maximal monotone linear operator and a normal cone operator of a closed convex set provided that the interior of the set makes a nonempty intersection with the domain of the linear operator. In this note, we provide an affirmative answer to Simons’ question. In fact, we show that the sum theorem is true for a maximal monotone linear relation and a normal cone operator. The proof relies on Rockafellar’s formula for the Fenchel conjugate of the sum as well as some results featuring the Fitzpatrick function.      

One-to-one piecewise linear mappings over triangulations

We call a piecewise linear mapping from a planar triangulation to the plane a convex combination mapping if the image of every interior vertex is a convex combination of the images of its neighbouring vertices. Such mappings satisfy a discrete maximum principle and we show that they are one-to-one if they map the boundary of the triangulation homeomorphically to a convex polygon. This result can be viewed as a discrete version of the Radó-Kneser-Choquet theorem for harmonic mappings, but is also closely related to Tutte's theorem on barycentric mappings of planar graphs.

     

A nonstandard proof of the Eberlein-Smulian theorem

The Eberlein-Smulian theorem on the equivalence of weak compactness and the finite intersection property of bounded closed convex sets is given a short elementary proof by applying Abraham Robinson's nonstandard characterization of compactness.

     

DANZER-GRüNBAUM'S THEOREM REVISITED

In this paper we prove some stronger versions of Danzer-Grünbaum's theorem including the following stability-type result. For 0 < α < 14π/27 the maximum number of vertices of a convex polyhedron in E ³ such that all angles between adjacent edges are bounded from above by α is 8. One of the main tools is the spherical geometry version of Pál's theorem. This revised version was published online in August 2006 with corrections to the Cover Date.     

On riesz subsets of abelian discrete groups

We study the class of the Riesz subsets of abelian discrete groups, that is, the sets for which the F. and M. Riesz theorem extends. We show that the “classical” tools of the theory — Riesz projections, localization in the Bohr sense, products — are leading to Riesz sets which are satisfying nice additional properties, e.g., the Mooney-Havin result extends to this class. We give an alternative proof of a result of A. B. Alexandrov, and we improve a construction of H. P. Rosenthal. The connection is made between this class and theM-structure theory. We show a result of convergence at the boundary for holomorphic functions on the polydisc. The Bourgain-Davis result on convergence of analytic martingales is improved.     

Unicity Results for General Linear Semi-Infinite Optimization Problems Using a New Concept of Active Constraints

We consider parametric semi-infinite optimization problems without the usual asssumptions on the continuity of the involved mappings and on the compactness of the index set counting the inequalities. We establish a characterization of those optimization problems which have a unique or strongly unique solution and which are stable under small pertubations. This result generalizes a well-known theorem of Nürnberger. The crucial roles in our investigations are a new concept of active constraints, a generalized Slater's condition, and a Kuhn—Tucker-type theorem. Finally, we give some applications in vector optimization, for approximation problems in normed spaces, and in the stability of the minimal value. Accepted 5 August 1996