| 1. |
- Strömberg, Ann-Brith, 1961, et al.
(författare)
-
Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
- 2020
-
Ingår i: Numerical Nonsmooth Optimization: State of the Art Algorithms. - Cham : Springer International Publishing. ; , s. 499-547, s. 499-547
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- This chapter presents several solution methodologies for mixed-integer linear optimization, stated as mixed-binary optimization problems, by means of Lagrangian duals, subgradient optimization, cutting-planes, and recovery of primal solutions. It covers Lagrangian duality theory for mixed-binary linear optimization, a problem framework for which ultimate success—in most cases—is hard to accomplish, since strong duality cannot be inferred. First, a simple conditional subgradient optimization method for solving the dual problem is presented. Then, we show how ergodic sequences of Lagrangian subproblem solutions can be computed and used to recover mixed-binary primal solutions. We establish that the ergodic sequences accumulate at solutions to a convexified version of the original mixed-binary optimization problem. We also present a cutting-plane approach to the Lagrangian dual, which amounts to solving the convexified problem by Dantzig–Wolfe decomposition, as well as a two-phase method that benefits from the advantages of both subgradient optimization and Dantzig–Wolfe decomposition. Finally, we describe how the Lagrangian dual approach can be used to find near optimal solutions to mixed-binary optimization problems by utilizing the ergodic sequences in a Lagrangian heuristic, to construct a core problem, as well as to guide the branching in a branch-and-bound method. The chapter is concluded with a section comprising notes, references, historical downturns, and reading tips.
|
|
| 2. |
- Fotedar, Sunney, 1989
(författare)
-
Mathematical Multi-Objective Optimization of the Tactical Allocation of Machining Resources in Functional Workshops
- 2023
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- In the aerospace industry, efficient management of machining capacity is crucial to meet the required service levels to customers and to maintain control of the tied-up working capital. We introduce new multi-item , multi-level capacitated resource allocation models with a medium--to--long--term planning horizon. The model refers to functional workshops where costly and/or time- and resource-demanding preparations (or qualifications) are required each time a product needs to be (re)allocated to a machining resource. Our goal is to identify possible product routings through the factory which minimize the maximum excess resource loading above a given loading threshold while incurring as low qualification costs as possible and minimizing the inventory. In Paper I , we propose a new bi-objective mixed-integer (linear) optimization model for the Tactical Resource Allocation Problem (TRAP). We highlight some of the mathematical properties of the TRAP which are utilized to enhance the solution process. In Paper II , we address the uncertainty in the coefficients of one of the objective functions considered in the bi-objective TRAP. We propose a new bi-objective robust efficiency concept and highlight its benefits over existing robust efficiency concepts. In Paper III , we extend the TRAP with an inventory of semi-finished as well as finished parts, resulting in a tri-objective mixed-integer (linear) programming model. We create a criterion space partitioning approach that enables solving sub-problems simultaneously. In Paper IV , using our knowledge from our previous work we embarked upon a task to generalize our findings to develop an approach for any discrete tri-objective optimization problem. The focus is on identifying a representative set of non-dominated points with a pre-defined desired coverage gap .
|
|
| 3. |
- Malik, Adam, 1991
(författare)
-
Mathematical Modelling of Cell Migration and Polarization
- 2020
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Cell migration plays a fundamental role in both development and disease. It is a complex process during which cells interact with one another and with their local environment. Mathematical modelling offers tools to investigate such processes and can give insights into the underlying biological details, and can also guide new experiments. The first two papers of this thesis are concerned with modelling durotaxis, which is the phenomena where cells migrate preferentially up a stiffness gradient. Two distinct mechanisms which potentially drive durotaxis are investigated. One is based on the hypothesis that adhesion sites of migrating cells become reinforced and have a longer lifespan on stiffer substrates. The second mechanism is based on cells being able to generate traction forces, the magnitude of which depend on the stiffness of the substrate. We find that both mechanisms can indeed give rise to biased migration up a stiffness gradient. Our results encourages new experiments which could determine the importance of the two mechanisms in durotaxis. The third paper is devoted to a population-level model of cancer cells in the brain of mice. The model incorporates diffusion tensor imaging data, which is used to guide the migration of the cells. Model simulations are compared to experimental data, and highlights the model’s difficulty in producing irregular growth patterns observed in the experiments. As a consequence, the findings encourage further model development. The fourth paper is concerned with modelling cell polarization, in the absence of environmental cues, referred to as spontaneous symmetry breaking. Polarization is an important part of cell migration, but also plays a role during division and differentiation. The model takes the form of a reaction diffusion system in 3D and describes the spatio-temporal evolution of three forms of Cdc42 in the cell. The model is able to produce biologically relevant patterns, and numerical simulations show how model parameters influence key features such as pattern formation and time to polarization.
|
|
| 4. |
- Karlsson, Carl-Joar, 1995
(författare)
-
Game theory and applications
- 2021
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Individual-level interactions and decisions spread though populations and change the collective-level dynamics in an intricate way. Nevertheless, game theory is well suited for the unification of these viewpoints. This thesis introduces the works The strength of diversity and Decisions and disease: a mechanism for the evolution of cooperation, which show that games have broad applications in population dynamics modeling. In The strength of diversity we calculate the equilibrium strategies of the so-called game of teams. The game of teams is an individual-level competition between teams, and a team's strategy in this context is a distribution of strength over the team members. It turns out that the equilibrium strategies are flat distributions or 'alternating' flat distributions whenever there exists equilibrium strategies. In Decisions and disease: a mechanism for the evolution of cooperation we combine the classic SIR and SIS models from epidemiology with the prisoner's dilemma game. The transmission rate is computed as the average over defecting and cooperating individuals, and the individuals are subjected to a replicator equation that takes into account the portion of infectious members of the population. We compute the steady state solutions and interpret the results.
|
|
| 5. |
- Gerlee, Philip, 1980, et al.
(författare)
-
Scientific Models : Red Atoms, White Lies and Black Boxes in a Yellow Book
- 2016
-
Bok (övrigt vetenskapligt/konstnärligt)abstract
- A zebrafish, the hull of a miniature ship, a mathematical equation and a food chain - what do these things have in common? They are examples of models used by scientists to isolate and study particular aspects of the world around us. This book begins by introducing the concept of a scientific model from an intuitive perspective, drawing parallels to mental models and artistic representations. It then recounts the history of modelling from the 16th century up until the present day. The iterative process of model building is described and discussed in the context of complex models with high predictive accuracy versus simpler models that provide more of a conceptual understanding. To illustrate the diversity of opinions within the scientific community, we also present the results of an interview study, in which ten scientists from different disciplines describe their views on modelling and how models feature in their work. Lastly, it includes a number of worked examples that span different modelling approaches and techniques. It provides a comprehensive introduction to scientific models and shows how models are constructed and used in modern science. It also addresses the approach to, and the culture surrounding modelling in different scientific disciplines. It serves as an inspiration for model building and also facilitates interdisciplinary collaborations by showing how models are used in different scientific fields. The book is aimed primarily at students in the sciences and engineering, as well as students at teacher training colleges but will also appeal to interested readers wanting to get an overview of scientific modelling in general and different modelling approaches in particular.
|
|
| 6. |
- Gerlee, Philip, 1980, et al.
(författare)
-
Scientific Models
- 2016
-
Bok (övrigt vetenskapligt/konstnärligt)abstract
- A zebrafish, the hull of a miniature ship, a mathematical equation and a food chain - what do these things have in common? They are examples of models used by scientists to isolate and study particular aspects of the world around us. This book begins by introducing the concept of a scientific model from an intuitive perspective, drawing parallels to mental models and artistic representations. It then recounts the history of modelling from the 16th century up until the present day. The iterative process of model building is described and discussed in the context of complex models with high predictive accuracy versus simpler models that provide more of a conceptual understanding. To illustrate the diversity of opinions within the scientific community, we also present the results of an interview study, in which ten scientists from different disciplines describe their views on modelling and how models feature in their work. Lastly, it includes a number of worked examples that span different modelling approaches and techniques. It provides a comprehensive introduction to scientific models and shows how models are constructed and used in modern science. It also addresses the approach to, and the culture surrounding modelling in different scientific disciplines. It serves as an inspiration for model building and also facilitates interdisciplinary collaborations by showing how models are used in different scientific fields. The book is aimed primarily at students in the sciences and engineering, as well as students at teacher training colleges but will also appeal to interested readers wanting to get an overview of scientific modelling in general and different modelling approaches in particular.
|
|
| 7. |
- Vasilis, Jonatan, 1981
(författare)
-
Harmonic measures
- 2010
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis uses both analytic and probabilistic methods to study continuous and discrete problems. The main areas of study are the asymptotic properties of p-harmonic measure, and various aspects of the square root of the Poisson kernel. Fix a domain and a boundary point, subject to certain regularity conditions. Consider the part of the boundary that lies within a disc, centered at the fixed boundary point. It is shown that as the radius of the disc tends to zero, the p-harmonic measure of the boundary set decays as an explicitly given power of the radius. The square root of the Poisson kernel is studied in both continuous and discrete settings. In the continuous case the domain is the unit disc, and a Hardy space related to the square root of the Poisson kernel is defined. The main result is that, as opposed to the classical Hardy space, the positive functions do not admit a characterization in terms of an Orlicz space. Similar results are given also in the discrete case, where the domain is instead a regular tree. Further results in the discrete setting include the construction of a nearest neighbor random walk on the tree with exit distribution determined by powers of the Poisson kernel. The minimally thin sets of these random walks are characterized. Finally, we suggest a generalization of a two-dimensional geometric result – the ring lemma – to three dimensions.
|
|
| 8. |
|
|
| 9. |
- Gäfvert, Oliver, 1991-
(författare)
-
Topological and geometrical methods in data analysis
- 2021
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis concerns two related data analysis pipelines, using topological and geometrical methods respectively, to extract relevant information. The first pipeline, referred to as the topological data analysis (TDA) pipeline, constructs a filtered simplicial complex on a given data set in order to describe its shape. The shape is described using a persistence module, which characterizes the topological features of the filtration, and the final step of the pipeline extracts algebraic invariants from this object. The second pipeline, referred to as the geometric data analysis (GDA) pipeline, associates an algebraic variety to a given data set and aims to describe the structure of this variety. Its structure is described using homology, an invariant which for most algebraic varieties can only be computed numerically using sampling methods.In Paper A we consider invariants on multi-parameter persistence modules. We explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to the interleaving distance and so called simple noise systems. For one parameter, we recover the standard barcode information. For more than one parameter we prove that the constructed invariants are in general NP-hard to calculate. A consequence is that computing the feature counting function, proposed by Scolamiero et. al. (2016), is NP-hard.In Paper B we introduce an efficient algorithm to compute a minimal presentation of a multi-parameter persistent homology module, given a chain complex of free modules as input. Our approach extends previous work on this problem in the 2-parameter case, and draws on ideas underlying the F4 and F5 algorithms for Gröbner basis computation. In the r-parameter case, our algorithm computes a presentation for the homology of C ->F A ->G B, with modules of rank l,n,m respectively, in O(r2nr+1 + nrm + nr-1m2 + rn2 l) arithmetic operations. We implement this approach in our new software Muphasa, written in C++. In preliminary computational experiments on synthetic TDA examples, we compare our approach to a version of a classical approach based on Schreyer's algorithm, and find that ours is substantially faster and more memory efficient. In the course of developing our algorithm for computing presentations, we also introduce algorithms for the closely related problems of computing Gröbner bases for the image and kernel of the morphism G. This algorithm runs in time O(nrm + nr-1m2) and memory O(n2 + mn + nr + K), where K is the size of the output.Paper C analyzes the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in RN. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDD) of a certain variety called the hypothesis variety as the number of points in the configuration increases. Finally, we establish a connection to complexity of architectures of polynomial neural networks. For the problem of fitting an (N-1)-sphere to a configuration of m points in RN, we give a closed formula for the algebraic complexity of the hypothesis variety as m grows for the case of N=1. For the case N>1 we conjecture a generalization of this formula supported by numerical experiments.In Paper D we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing bottlenecks of the variety. Using geometric information such as the bottlenecks and the local reach we also provide bounds on the density of the sample needed in order to guarantee that the homology of the variety can be recovered from the sample. An implementation of the algorithm is provided together with numerical experiments and a computational comparison to the algorithm by Dufresne et. al. (2019).
|
|
| 10. |
- Rowlett, Julie, 1978
(författare)
-
Donut choirs and Schiemann's symphony
- 2021
-
Ingår i: Oberwolfach Reports. - 1660-8941 .- 1660-8933. ; 27, s. 33-36
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- Abstract: Flat tori are among the only types of Riemannian manifolds for which the Laplace eigenvalues can be explicitly computed. In 1964, Milnor used a construction of Witt to find an example of isospectral non-isometric Riemannian manifolds, a striking and concise result that occupied one page in the Proceedings of the National Academy of Science. Milnor's example is a pair of 16-dimensional flat tori, whose set of Laplace eigenvalues are identical, in spite of the fact that these tori are not isometric. A natural question is: what is the lowest dimension in which such isospectral non-isometric pairs exist? This question can be equivalently formulated in analytic, geometric, and number theoretic language. We will explore all three formulations and describe Schiemann's solution to this question, as well as some new results and open problems. This talk is based on joint work with Erik Nilsson and Felix Rydell (PhD students at KTH, Stockholm).
|
|
