Motzkin decomposition of closed convex sets via truncation

A nonempty set F is called Motzkin decomposable when it can be expressed as the Minkowski sum of a compact convex set C with a closed convex cone D. In that case, the sets C and D are called compact and conic components of F. This paper provides new characterizations of the Motzkin decomposable sets involving truncations of F (i.e., intersections of FF with closed halfspaces), when F contains no lines, and truncations of the intersection F̂ of F with the orthogonal complement of the lineality of F, otherwise. In particular, it is shown that a nonempty closed convex set F is Motzkin decomposable if and only if there exists a hyperplane H parallel to the lineality of F such that one of the truncations of F̂ induced by H is compact whereas the other one is a union of closed halflines emanating from H. Thus, any Motzkin decomposable set F can be expressed as F=C+D, where the compact component C is a truncation of F̂. These Motzkin decompositions are said to be of type T when F contains no lines, i.e., when C is a truncation of F. The minimality of this type of decompositions is also discussed.

On the stability of the Motzkin representation of closed convex sets

A set is called Motzkin decomposable when it can be expressed as the Minkowski sum of a compact convex set with a closed convex cone. This paper analyzes the continuity properties of the set-valued mapping associating to each couple (C,D) formed by a compact convex set C and a closed convex cone D its Minkowski sum C + D. The continuity properties of other related mappings are also analyzed.

LSA silicon material task closed-cycle process development : interim summary report, August-December 1978 /

Includes bibliographical references (page 37).

Sufficient Conditions of Optimality for Control Pproblem Governed by Variational Inequalities

* This work was completed while the author was visiting the University of Limoges. Support from the laboratoire “Analyse non-linéaire et Optimisation” is gratefully acknowledged.

Convex-transitive Banach spaces and their hyperplanes

The topic of this dissertation is the geometric and isometric theory of Banach spaces. This work is motivated by the known Banach-Mazur rotation problem, which asks whether each transitive separable Banach space is isometrically a Hilbert space. A Banach space X is said to be transitive if the isometry group of X acts transitively on the unit sphere of X. In fact, some weaker symmetry conditions than transitivity are studied in the dissertation. One such condition is an almost isometric version of transitivity. Another investigated condition is convex-transitivity, which requires that the closed convex hull of the orbit of any point of the unit sphere under the rotation group is the whole unit ball. Following the tradition developed around the rotation problem, some contemporary problems are studied. Namely, we attempt to characterize Hilbert spaces by using convex-transitivity together with the existence of a 1-dimensional bicontractive projection on the space, and some mild geometric assumptions. The convex-transitivity of some vector-valued function spaces is studied as well. The thesis also touches convex-transitivity of Banach lattices and resembling geometric cases.

Experimental Investigation of Stretch Blow Molding, Part 2: Analysis of Process Variables, Blowing Kinematics, and Bottle Properties

The work presented in this paper takes advantage of newly developed instrumentation suitable for in process monitoring of an industrial stretch blow molding machine. The instrumentation provides blowing pressure and stretch rod force histories along with the kinematics of polymer contact with the mould wall. A Design of Experiments pattern was used to qualitatively relate machine inputs with these process parameters and the thickness distribution of stretch blow molded PET (polyethylene terephtalate) bottles. Material slippage at the mold wall and thickness distribution is also discussed in relation to machine inputs. The key process indicators defined have great potential for use in a closed loop process control system and for validation of process simulations.

Lower-semicontinuity and optimization of convex functionals

The result that we treat in this article allows to the utilization of classic tools of convex analysis in the study of optimality conditions in the optimal control convex process for a Volterra-Stietjes linear integral equation in the Banach space G([a, b],X) of the regulated functions in [a, b], that is, the functions f : [a, 6] → X that have only descontinuity of first kind, in Dushnik (or interior) sense, and with an equality linear restriction. In this work we introduce a convex functional Lβf(x) of Nemytskii type, and we present conditions for its lower-semicontinuity. As consequence, Weierstrass Theorem garantees (under compacity conditions) the existence of solution to the problem min{Lβf(x)}. © 2009 Academic Publications.

Stability of Supporting and Exposing Elements of Convex Sets in Banach Spaces

* This work was supported by the CNR while the author was visiting the University of Milan.

Convergence of bimodules over maximal abelian selfadjoint algebras

We prove a continuity result for the map sending a masa-bimodule to its support. We characterise the convergence of a net of weakly closed convex hulls of bilattices in terms of the convergence of the corresponding supports, and establish a lower-semicontinuity result for the map sending a support to the corresponding masa-bimodule.

Updating Credal Networks is Approximable in Polynomial Time

Credal networks relax the precise probability requirement of Bayesian networks, enabling a richer representation of uncertainty in the form of closed convex sets of probability measures. The increase in expressiveness comes at the expense of higher computational costs. In this paper, we present a new variable elimination algorithm for exactly computing posterior inferences in extensively specified credal networks, which is empirically shown to outperform a state-of-the-art algorithm. The algorithm is then turned into a provably good approximation scheme, that is, a procedure that for any input is guaranteed to return a solution not worse than the optimum by a given factor. Remarkably, we show that when the networks have bounded treewidth and bounded number of states per variable the approximation algorithm runs in time polynomial in the input size and in the inverse of the error factor, thus being the first known fully polynomial-time approximation scheme for inference in credal networks.

Estudo comparativo das propriedades mecânicas em compósitos da fibra modal e poliester

In the present work, three composites with distinct reinforcements (polyester, modal e polyester + modal), all if a unsaturated orthophthalic polyester resin as matrix were used, in order to conduct a comparative study by mechanical tests and water absorption. The fibre mats were prepared in a mat preparatory by immersion developed in the Textile Engineering Laboratory. The composites were manufactured using a closed mould process by compression using an unsaturated orthophthalic polyester resin as matrix and 1% MEK (methyl ethyl ketone peroxide) as an initiator. In each composite twelve samples with the dimensions of 150x25x3 mm were cut randomly for the mechanical analysis (tension x extension, three points bending and water absorption and Scanning Electron Micsroscopy). The mechanical tests were carried out in the Laboratório de Metais e Ensaios Mecânicos UFRN . All the analyses were carried out according to the ASTM norms. The resultant samples from the mechanical analysis were subjected for the Scanning Electron Microscopy analysis. Based on the results obtained, it was observed that the reinforced composite with two fibres (modal + polyester) presented better results in comparison to the other two composites both in the tension/extension as well on the three point bending tests. In the water absorption test, it was possible to observe an equilibrium in the water absorption by the modal and polyester composite, due to the union of the two fibres. In the SEM images, the regions of rupture in the composites as well as the adsorption between the fiber and the matrix could be observed

Inclusões Dinâmicas em Escalas Temporais: Existência de Soluções sob a Hipótese de Semicontinuidade Inferior

In this paper we consider the problem of differential inclusion in time scales whose vector field is a multifunction, that is, a function that maps points to sets. It is provided conditions of existence without requiring compactness of the vector field; it is required that the vector field is closed, convex, and lower semicontinuous. In previous work in literature, it is required that the field is either scalar or compact, convex, and has closed graph.

Robust linear semi-infinite programming duality under uncertainty

In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain Lagrangian dual. We show that robust duality holds whenever a robust moment cone is closed and convex. We then establish that the closed-convex robust moment cone condition in the case of constraint-wise uncertainty is in fact necessary and sufficient for robust duality. In other words, the robust moment cone is closed and convex if and only if robust duality holds for every linear objective function of the program. In the case of uncertain problems with affinely parameterized data uncertainty, we establish that robust duality is easily satisfied under a Slater type constraint qualification. Consequently, we derive robust forms of the Farkas lemma for systems of uncertain semi-infinite linear inequalities.

Voronoi cells via linear inequality systems

The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.

From the Farkas Lemma to the Hahn–Banach Theorem

This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f(x) ≥ 0 which are consequences of a composite convex inequality (S ◦ g)(x) ≤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-convex function. In parallel, associated versions of a stable Farkas lemma, considering arbitrary linear perturbations of f, are also given. These new versions of the Farkas lemma, and their corresponding stable forms, are established under the weakest constraint qualification conditions (the so-called closedness conditions), and they are actually equivalent to each other, as well as equivalent to an extended version of the so-called Hahn–Banach–Lagrange theorem, and its stable version, correspondingly. It is shown that any of them implies analytic and algebraic versions of the Hahn–Banach theorem and the Mazur–Orlicz theorem for extended sublinear functions.