The design of self-collapsed super-strong nanotube bundles

The study reported in this paper suggests that the influence of the surrounding nanotubes in a bundle is nearly identical to that of a liquid having surface tension equal to the surface energy of the nanotubes. This surprising behaviour is supported by the calculation of the polygonization and especially of the self-collapse diameters, and related dog-bone configurations, of nanotubes in a bundle, in agreement with atomistic simulations and nanoscale experiments. Accordingly, we have evaluated the strength of the nanotube bundle, with or without collapsed nanotubes, assuming a sliding failure: the self-collapse can increase the strength up to a value of about ∼30%, suggesting the design of self-collapsed super-strong nanotube bundles.Other systems, such as peapods and fullerites, can be similarly treated, including the effect of the presence of a liquid, as reported in the appendices.     

Flat weakly miquelian laguerre planes are ovoidal

Every flat Laguerre plane that satisfies a certain variation of the Miquel Condition is ovoidal. Equivalently, in flat Laguerre planes a certain special version of the Bundle Theorem already implies the Bundle Theorem.     

Comparison of bundle and classical column generation

When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However, more stable methods with better theoretical convergence rates are known and have been used as alternatives to this standard. One of them is the bundle method; our aim is to illustrate its differences with Kelley’s method. In the process we review alternative stabilization techniques used in column generation, comparing them from both primal and dual points of view. Numerical comparisons are presented for five applications: cutting stock (which includes bin packing), vertex coloring, capacitated vehicle routing, multi-item lot sizing, and traveling salesman. We also give a sketchy comparison with the volume algorithm. This research has been supported by Inria New Investigation Grant “Convex Optimization and Dantzig-Wolfe Decomposition”.     

Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

Robinson has proposed the bundle-based decomposition algorithm to solve a class of structured large-scale convex optimization problems. In this method, the original problem is transformed (by dualization) to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. In this paper, we give a posteriori error estimates on the approximate primal optimal solution and on the duality gap. We describe implementation and present computational experience with a special case of this class of problems, namely, block-angular linear programming problems. We observe that the method is efficient in obtaining the approximate optimal solution and compares favorably with MINOS and an advanced implementation of the Dantzig—Wolfe decomposition method.     

Variable metric bundle methods: From conceptual to implementable forms

To minimize a convex function, we combine Moreau-Yosida regularizations, quasi-Newton matrices and bundling mechanisms. First we develop conceptual forms using “reversal” quasi-Newton formulae and we state their global and local convergence. Then, to produce implementable versions, we incorporate a bundle strategy together with a “curve-search”. No convergence results are given for the implementable versions; however some numerical illustrations show their good behaviour even for large-scale problems.     

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition

We propose a dynamic version of the bundle method to get approximate solutions to semidefinite programs with a nearly arbitrary number of linear inequalities. Our approach is based on Lagrangian duality, where the inequalities are dualized, and only a basic set of constraints is maintained explicitly. This leads to function evaluations requiring to solve a relatively simple semidefinite program. Our approach provides accurate solutions to semidefinite relaxations of the Max-Cut and the Equipartition problem, which are not achievable by direct approaches based only on interior-point methods. Received: April, 2004 The last author gratefully acknowledges the support from the Austrian Science Foundation FWF Project P12660-MAT.     

A -algorithm for convex minimization

For convex minimization we introduce an algorithm based on -space decomposition. The method uses a bundle subroutine to generate a sequence of approximate proximal points. When a primal-dual track leading to a solution and zero subgradient pair exists, these points approximate the primal track points and give the algorithm's , or corrector, steps. The subroutine also approximates dual track points that are -gradients needed for the method's -Newton predictor steps. With the inclusion of a simple line search the resulting algorithm is proved to be globally convergent. The convergence is superlinear if the primal-dual track points and the objective's -Hessian are approximated well enough. Dedicated to Terry Rockafellar who has had a great influence on our work via strong support for proximal points and for structural definitions that involve tangential convergence. On leave from INRIA Rocquencourt Research of the first author supported by the National Science Foundation under Grant No. DMS-0071459 and by CNPq (Brazil) under Grant No. 452966/2003-5. Research of the second author supported by FAPERJ (Brazil) under Grant No.E26/150.581/00 and by CNPq (Brazil) under Grant No. 383066/2004-2.     

Cokernel bundles and Fibonacci bundles

We are interested in those bundles C on ?^N which admit a resolution of the form 0 → ?^s ? E ?^t ? F → C → 0. In this paper we prove that, under suitable conditions on (E, F), a generic bundle with this form is either simple or canonically decomposable. As applications we provide an easy criterion for the stability of such bundles on ?² and we prove the stability when E = ??, F = ??(1) and C is an exceptional bundle on ?^N for N ≥ 2. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

How chemistry shifts horizons: element, substance, and the essential

In 1931 eminent chemist Fritz Paneth maintained that the modern notion of “element” is closely related to (and as “metaphysical” as) the concept of element used by the ancients (e.g., Aristotle). On that basis, the element chlorine (properly so-called) is not the elementary substance dichlorine, but rather chlorine as it is in carbon tetrachloride. The fact that pure chemicals are called “substances” in English (and closely related words are so used in other European languages) derives from philosophical compromises made by grammarians in the late Roman Empire (particularly Priscian [fl. ~520 CE]). When the main features of the constitution of isotopes became clear in the first half of the twentieth century, the formal (IUPAC) definition of a “chemical element” was changed. The features that are “essential” to being an element had previously been “transcendental” (“beyond the sphere of consciousness”) but, by the mid-twentieth century the defining characteristics of elements, as such, had come to be understood in detail. This amounts to a shift in a “horizon of invisibility” brought about by progress in chemistry and related sciences. Similarly, chemical insight is relevant to currently-open philosophical problems, such as the status of “the bundle theory” of the coherence of properties in concrete individuals.

On regular 4-coverings and their application for lattice coverings in normed planes

It is well known that the famous covering problem of Hadwiger is completely solved only in the planar case, i.e.: any planar convex body can be covered by four smaller homothetical copies of itself. Lassak derived the smallest possible ratio of four such homothets (having equal size), using the notion of regular 4-covering. We will continue these investigations, mainly (but not only) referring to centrally symmetric convex plates. This allows to interpret and derive our results in terms of Minkowski geometry (i.e., the geometry of finite dimensional real Banach spaces). As a tool we also use the notion of quasi-perfect and perfect parallelograms of normed planes, which do not differ in the Euclidean plane. Further on, we will use Minkowskian bisectors, different orthogonality types, and further notions from the geometry of normed planes, and we will construct lattice coverings of such planes and study related Voronoi regions and gray areas. Discussing relations to the known bundle theorem, we also extend Miquel’s six-circles theorem from the Euclidean plane to all strictly convex normed planes.