255 research outputs found

    Concurrent Multiscale Computing of Deformation Microstructure by Relaxation and Local Enrichment with Application to Single-Crystal Plasticity

    Get PDF
    This paper is concerned with the effective modeling of deformation microstructures within a concurrent multiscale computing framework. We present a rigorous formulation of concurrent multiscale computing based on relaxation; we establish the connection between concurrent multiscale computing and enhanced-strain elements; and we illustrate the approach in an important area of application, namely, single-crystal plasticity, for which the explicit relaxation of the problem is derived analytically. This example demonstrates the vast effect of microstructure formation on the macroscopic behavior of the sample, e.g., on the force/travel curve of a rigid indentor. Thus, whereas the unrelaxed model results in an overly stiff response, the relaxed model exhibits a proper limit load, as expected. Our numerical examples additionally illustrate that ad hoc element enhancements, e.g., based on polynomial, trigonometric, or similar representations, are unlikely to result in any significant relaxation in general

    Global optimization of rational functions:A semidefinite programming approach

    Get PDF
    We consider the problem of global minimization of rational functions on (unconstrained case), and on an open, connected, semi-algebraic subset of , or the (partial) closure of such a set (constrained case). We show that in the univariate case (n = 1), these problems have exact reformulations as semidefinite programming (SDP) problems, by using reformulations introduced in the PhD thesis of Jibetean [16]. This extends the analogous results by Nesterov [13] for global minimization of univariate polynomials. For the bivariate case (n = 2), we obtain a fully polynomial time approximation scheme (FPTAS) for the unconstrained problem, if an a priori lower bound on the infimum is known, by using results by De Klerk and Pasechnik [1]. For the NP-hard multivariate case, we discuss semidefinite programming-based relaxations for obtaining lower bounds on the infimum, by using results by Parrilo [15], and Lasserre [12]

    Euclidean distance geometry and applications

    Full text link
    Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in Euclidean space that realizes the given distances. We survey some of the theory of Euclidean distance geometry and some of the most important applications: molecular conformation, localization of sensor networks and statics.Comment: 64 pages, 21 figure

    International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book

    Get PDF
    The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions. This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
    corecore