A Brief Introduction to Mathematical Optimization in Julia (Part 1)
Explore the source record for details and available documents.
Engineering topics
Publications and source records attributed to Coffrin, Carleton James.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
This paper studies mixed-integer nonlinear programs featuring disjunctive constraints and trigonometric functions and presents a strengthened version of the convex quadratic relaxation of the optimal transmission switching problem. We first characterize the convex hull of univariate quadratic on/off constraints in the space of original variables using perspective functions. Next, we introduce new tight quadratic relaxations for trigonometric functions featuring variables with asymmetrical bounds. These results are used to further tighten recent convex relaxations introduced for the optimal transmission switching problem in power systems. Using the proposed improvements, along with bound propagation, on 23 medium-sized test cases in the PGLib benchmark library with a relaxation gap of more than 1%, we reduce the gap to less than 1% on five instances. The tightened model has promising computational results when compared with state-of-the-art formulations.
This presentation covers a framework for categorizing heuristics including neighborhood size, iterated local search, and performance metrics. The question, "How does Quantum Annealing stack up?" is addressed through Random with Fields (RANF-1), Biased Ferromagnet (BFM), and Corrupted Biased Ferromagnet (CBFM). Concluding thoughts are then given.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Los Alamos researchers have developed the Severe Contingency Solver (SCS) to help power network operators and policy makers better understand the vulnerabilities of electric power transmission systems to extreme events, such as hurricanes, ice storms, and earthquakes. It guarantees a solution for power networks with hundreds to thousands of damaged components. SCS supports multiple platforms (e.g., Linux, Windows, Mac OS X) and removes the need for human intervention when analyzing severely damaged power networks. The information can be used to prepare for extreme events and plan network upgrades for improved network resilience.
Abstract not provided.
Conclusions: Emerging computational hardware may fundamentally change optimization algorithm development; Ising Coprocessors are like ALUs or GPUs for optimization!; Based on initial benchmarking efforts D-Wave hardware is not outperforming state-of-the-art alternatives, but seems competitive
The Information Science & Technology Institute (ISTI), with partnering entities at Los Alamos National Laboratory (LANL), regularly organizes and executes Rapid Response efforts in mission-relevant growth areas within information science. This report describes 18 projects conducted at LANL in response to a Rapid Response Familiarization call titled “Exploring Cloud Computing 2018.”
This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonlinear, non-convex optimization problem, and is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 N – k scenarios on seven power networks ranging in size from 70 to 6000 buses. Furthermore, the most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.
Convex relaxations of the AC power ow equations have attracted signi cant interest in the power systems research community in recent years. The following collection of video lectures provides a brief introduction to the mathematics of AC power systems, continuous nonlinear optimization, and relaxations of the power ow equations. The aim of the videos is to provide the high level ideas of convex relaxations and their applications in power system optimization, and could be used as a starting point for researchers who want to study, use or develop new convex relaxations for use in their own research. The videos do not aim to provide an in-depth tutorial about speci c convex relaxations, but rather focus on ideas that are common to all convex relaxations of the AC optimal power ow problem. The videos assume minimal prerequisite knowledge and are designed to be accessible to a variety of disciplines (e.g. power system engineers, industrial engineers and computer scientists). They are designed to be modular, such that interested listeners can either watch the series as a whole, or choose only the subset that matches their interest. The following sections provide a brief overview of the topics and references covered in each video.
Explore the source record for details and available documents.
No abstract provided.