MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECTinspired optimization algorithm for experimentally accessible computational material design
Abstract
Computational materials design has suffered from a lack of algorithms formulated in terms of experimentally accessible variables. Here we formulate the problem of (ternary) alloy optimization at the level of choice of atoms and their composition that is normal for synthesists. Mathematically, this is a mixed integer problem where a candidate solution consists of a choice of three elements, and how much of each of them to use. This space has the natural structure of a set of equilateral triangles. We solve this problem by introducing a novel version of the DIRECT algorithm that (1) operates on equilateral triangles instead of rectangles and (2) works across multiple triangles. We demonstrate on a test case that the algorithm is both robust and efficient. Lastly, we offer an explanation of the efficacy of DIRECT  specifically, its balance of global and local search  by showing that 'potentially optimal rectangles' of the original algorithm are akin to the Pareto front of the 'multicomponent optimization' of global and local search.
 Authors:
 National Renewable Energy Lab. (NREL), Golden, CO (United States)
 Univ. of Colorado Denver, Denver, CO (United States)
 Publication Date:
 Research Org.:
 National Renewable Energy Lab. (NREL), Golden, CO (United States)
 Sponsoring Org.:
 USDOE Office of Science (SC)
 OSTI Identifier:
 1395085
 Report Number(s):
 NREL/JA2C0060589
Journal ID: ISSN 09266003
 Grant/Contract Number:
 AC3608GO28308
 Resource Type:
 Journal Article: Accepted Manuscript
 Journal Name:
 Computational Optimization and applications
 Additional Journal Information:
 Journal Volume: 68; Journal Issue: 3; Journal ID: ISSN 09266003
 Publisher:
 Springer
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING; mixed integer optimization; DIRECT optimization; Pareto front; Sierpinski triangle; computational material design
Citation Formats
Graf, Peter A., and Billups, Stephen. MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECTinspired optimization algorithm for experimentally accessible computational material design. United States: N. p., 2017.
Web. doi:10.1007/s1058901799229.
Graf, Peter A., & Billups, Stephen. MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECTinspired optimization algorithm for experimentally accessible computational material design. United States. doi:10.1007/s1058901799229.
Graf, Peter A., and Billups, Stephen. Mon .
"MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECTinspired optimization algorithm for experimentally accessible computational material design". United States.
doi:10.1007/s1058901799229.
@article{osti_1395085,
title = {MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECTinspired optimization algorithm for experimentally accessible computational material design},
author = {Graf, Peter A. and Billups, Stephen},
abstractNote = {Computational materials design has suffered from a lack of algorithms formulated in terms of experimentally accessible variables. Here we formulate the problem of (ternary) alloy optimization at the level of choice of atoms and their composition that is normal for synthesists. Mathematically, this is a mixed integer problem where a candidate solution consists of a choice of three elements, and how much of each of them to use. This space has the natural structure of a set of equilateral triangles. We solve this problem by introducing a novel version of the DIRECT algorithm that (1) operates on equilateral triangles instead of rectangles and (2) works across multiple triangles. We demonstrate on a test case that the algorithm is both robust and efficient. Lastly, we offer an explanation of the efficacy of DIRECT  specifically, its balance of global and local search  by showing that 'potentially optimal rectangles' of the original algorithm are akin to the Pareto front of the 'multicomponent optimization' of global and local search.},
doi = {10.1007/s1058901799229},
journal = {Computational Optimization and applications},
number = 3,
volume = 68,
place = {United States},
year = {Mon Jul 24 00:00:00 EDT 2017},
month = {Mon Jul 24 00:00:00 EDT 2017}
}

A methodology is proposed for designing a lowenergy consuming ternaryvalued full adder based on a quantum dot (QD) electrostatically coupled with a single electron transistor operating as a charge sensor. The methodology is based on design optimization: the values of the physical parameters of the system required for implementing the logic operations are optimized using a multiobjective genetic algorithm. The searching space is determined by elements of the capacitance matrix describing the electrostatic couplings in the entire device. The objective functions are defined as the maximal absolute error over actual device logic outputs relative to the ideal truth tables formore »

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixedinteger programs
We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for twostage and multistage stochastic mixedinteger programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.Cited by 4 
PIPSSBB: A Parallel DistributedMemory BranchandBound Algorithm for Stochastic MixedInteger Programs
Stochastic mixedinteger programs (SMIPs) deal with optimization under uncertainty at many levels of the decisionmaking process. When solved as extensive formulation mixed integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPSSBB: a distributedmemory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPSSBB to improve furthermore » 
Efficient integer optimization algorithms for optimal coordination of capacitors and regulators
The optimal coordination of switched capacitors and tapchanging transformers in a radial distribution system is considered. The formulation incorporates voltage constraints. The coordination problem is approximated by a constrained discrete quadratic optimization using the results from the corresponding unconstrained continuous problem. The discrepancy between the actual and approximating problem is discussed. Two algorithms are proposed to seek solutions to the approximating optimization problem. The first is a randomized algorithm that runs fast but for which there is no guarantee of optimality. The second is a deterministic algorithm, the run time of which is polynomially bounded in the problem size. Formore » 
A twolevel approach to large mixedinteger programs with application to cogeneration in energyefficient buildings
We study a twostage mixedinteger linear program (MILP) with more than 1 million binary variables in the second stage. We develop a twolevel approach by constructing a semicoarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semicoarse model is guaranteed to find a feasible solution of the original problem and hence providesmore »Cited by 1