On infinite dimensional quadratic Volterra operators

In this paper we study a class of quadratic operators named by Volterra operators on infinite dimensional space. We prove that such operators have infinitely many fixed points and the set of Volterra operators forms a convex compact set. In addition, it is described its extreme points. Besides, we study certain limit behaviors of such operators and give some more examples of Volterra operators for which their trajectories do not converge. Finally, we define a compatible sequence of finite dimensional Volterra operators and prove that any power of this sequence converges in weak topology.     

Extremal Polygons with Minimal Perimeter

In this paper we will investigate an isoperimetric type problem in lattices. If K is a bounded O-symmetric (centrally symmetric with respect to the origin) convex body in En of volume v(K) = 2n det L which does not contain non-zero lattice points in its interior, we say that K is extremal with respect to the given lattice L. There are two variations of the isoperimetric problem for this class of polyhedra. The first one is: Which bodies have minimal surface area in the class of extremal bodies for a fixed n-dimensional lattice? And the second one is: Which bodies have minimal surface area in the class of extremal bodies with volume 1 of dimension n? We characterize the solutions of these two problems in the plane. There is a consequence of these results, the solutions of the above problems in the plane give the solution of the lattice-like covering problem: Determine those centrally symmetric convex bodies whose translated copies (with respect to a fixed lattice L) cover the space and have minimal surface area.

     

Existence and characterization of regions minimizing perimeter under a volume constraint inside Euclidean cones

We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of the cone coincides with the one of the half-space. This allows us to give some criteria ensuring existence of isoperimetric regions: for instance, local convexity of the cone at some boundary point.

We also characterize which are the stable regions in a convex cone, i.e., second order minima of perimeter under a volume constraint. From this it follows that the isoperimetric regions in a convex cone are the euclidean balls centered at the vertex intersected with the cone.

     

Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems

In this paper, we first establish characterizations of the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with a general ordering cone (with or without a cone constraint) defined in a finite dimensional space. Using one of the characterizations, we further establish for a convex vector optimization problem with a general ordering cone and a cone constraint defined in a finite dimensional space the equivalence between the nonemptiness and compactness of its weakly efficient solution set and the generalized type I Levitin-Polyak well-posednesses. Finally, for a cone-constrained convex vector optimization problem defined in a Banach space, we derive sufficient conditions for guaranteeing the generalized type I Levitin-Polyak well-posedness of the problem.     

Adaptive subgradient method for the split quasi-convex feasibility problems

In this paper, we consider a type of the celebrated convex feasibility problem, named as split quasi-convex feasibility problem (SQFP). The SQFP is to find a point in a sublevel set of a quasi-convex function in one space and its image under a bounded linear operator is contained in a sublevel set of another quasi-convex function in the image space. We propose a new adaptive subgradient algorithm for solving SQFP problem. We also discuss the convergence analyses for two cases: the first case where the functions are upper semicontinuous in the setting of finite dimensional, and the second case where the functions are weakly continuous in the infinite-dimensional settings. Finally some numerical examples in order to support the convergence results are given.     

Optimality problem for infinite dimensional bilinear systems

For any finite dimensional control system with arbitrary cost, Pontryagin's Maximum Principle (PMP) [N. Bensalem, Localisation des courbes anormales et problème d'accessibilité sur un groupe de Lie hilbertien nilpotent de degré 2, Thèse de doctorat, Université de Savoie, 1998. [6]] gives necessary conditions for optimality of trajectories. In the infinite dimensional case, it is well known that these conditions are no more true in general. The purpose of this paper is to establish an “approached” version of PMP for infinite dimensional bilinear systems, with fixed final time and without constraints on the final state. Moreover, if the set of control is contained in a closed bounded convex subset with operators defining its dynamics are compact, or if it is contained in a finite dimensional space, we get an “exact” version of PMP. We also give two applications of these results. The first one deals with sub-Riemannian geometry on nilpotent Hilbertian Lie groups for which we can define a sub-Riemannian distance. The second one deals with heat equation for which we analyse the necessary conditions to give the optimal controls.     

On the Hamilton's isoperimetric ratio in complete Riemannian manifolds of finite volume

We study a family of geometric variational functionals introduced by Hamilton, and considered later by Daskalopulos, Sesum, Del Pino and Hsu, in order to understand the behavior of maximal solutions of the Ricci flow both in compact and noncompact complete Riemannian manifolds of finite volume. The case of dimension two has some peculiarities, which force us to use different ideas from the corresponding higher-dimensional case. Under some natural restrictions, we investigate sufficient and necessary conditions which allow us to show the existence of connected regions with a connected complementary set (the so-called “separating regions”). In dimension higher than two, the associated problem of minimization is reduced to an auxiliary problem for the isoperimetric profile (with the corresponding investigation of the minimizers). This is possible via an argument of compactness in geometric measure theory valid for the case of complete finite volume manifolds. Moreover, we show that the minimum of the separating variational problem is achieved by an isoperimetric region. The dimension two requires different techniques of proof. The present results develop a definitive theory, which allows us to circumvent the shortening curve flow approach of the above mentioned authors at the cost of some applications of the geometric measure theory and of the Ascoli-Arzela's Theorem.     

Log-concave and spherical models in isoperimetry

We derive several functional forms of isoperimetric inequalities, in the case of concave isoperimetric profile. In particular, we answer the question of a canonical and sharp functional form of the Lévy—Schmidt theorem on spheres. We use these results to derive a comparison theorem for product measures: the isoperimetric function of is bounded from below in terms of the isoperimetric functions of . We apply this to measures with finite dimensional isoperimetric behaviors. All the previous estimates can be improved when uniform enlargement is considered. Submitted: December 2000, Revised: May 2001.     

The common minimal-norm fixed point of a finite family of nonexpansive mappings

Consider a finite family of nonexpansive mappings which are defined on a closed convex subset of a Hilbert space H. Suppose the set of common fixed points of this family is nonempty. We then address the problem of finding the minimum-norm element of this common fixed point set. We introduce both cyclic and parallel iteration methods to find this minimal-norm element.     

Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems

We consider convex semiinfinite programming (SIP) problems with an arbitrary fixed index set T. The article analyzes the relationship between the upper and lower semicontinuity (lsc) of the optimal value function and the optimal set mapping, and the so-called Hadamard well-posedness property (allowing for more than one optimal solution). We consider the family of all functions involved in some fixed optimization problem as one element of a space of data equipped with some topology, and arbitrary perturbations are premitted as long as the perturbed problem continues to be convex semiinfinite. Since no structure is required for T, our results apply to the ordinary convex programming case. We also provide conditions, not involving any second order optimality one, guaranteeing that the distance between optimal solutions of the discretized subproblems and the optimal set of the original problem decreases by a rate which is linear with respect to the discretization mesh-size.