Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convex optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 595 records · Page 33

Measurements and analytics of wide-area file transfers over dedicated connections

Distributed scientific and big-data computations are becoming increasingly dependent on access to remote files. Wide-area file transfers are supported by two basic schemes: (i) application-level tools, such as GridFTP, that provide transport services between file systems housed at geographically separated sites, and (ii) file systems mounted over wide-area networks, using mechanisms such as LNet routers that make them transparently available. In both cases, the file transfer performance critically depends on the configuration consisting of host, file, IO, and disk subsystems, which are complex by themselves, as well as on their complex compositions implemented using buffers and IO-network data transitions. We present extensive file transfer rate measurements collected over dedicated 10 Gbps connections with 0-366 ms round-trip times, using GridFTP and XDD file transfer tools, and Lustre file system extended over wide-area networks using LNet routers. Our test configurations are composed of: three types of host systems; XFS, Lustre, and ext3 file systems; and Ethernet and SONET wide-area connections. We present analytics based on the convexity-concavity of throughput profiles which provide insights into throughput and its superior or inferior trend compared to linear interpolations. We propose the utilization-concavity coefficient, a scalar metric that characterizes the overall performance of any file transfer method consisting of specific configuration and scheme. Our results enable performance optimizations by highlighting the significant roles of (i) buffer sizes and parallelism in GridFTP and XDD, and (ii) buffer utilization and credit mechanism in LNet routers.

Rao, Nageswara↗

Optimization-based algorithms for nonlinear mechanics and frictional contact

An optimization-based strategy for solving nonlinear mechanics problems is proposed. In contrast to typical nonlinear equation solver algorithms that aim to find zeros in the residual force function, we minimize an energy (or energy-like) function to encourage solutions which are locally stable equilibria. These smooth and potentially non-convex objective functions are minimized using a preconditioned conjugate-gradient trust-region algorithm. Contact is formulated as an inequality constrained minimization problem, and is solved with an augmented Lagrangian algorithm. Friction is included in the approach via a regularized quasi-potential energy, and other dissipative behavior is included through the use of variational constitutive updates. Finally, to accelerate convergence rates for the Lagrange multipliers, we propose a novel multiplier update algorithm utilizing the Fischer-Burmeister function, and demonstrate super-linear solver convergence for some applications.

42 ENGINEERING↗

A framework to evaluate machine learning crystal stability predictions

The rapid adoption of machine learning in various scientific domains calls for the development of best practices and community agreed-upon benchmarking tasks and metrics. We present Matbench Discovery as an example evaluation framework for machine learning energy models, here applied as pre-filters to first-principles computed data in a high-throughput search for stable inorganic crystals. We address the disconnect between (1) thermodynamic stability and formation energy and (2) retrospective and prospective benchmarking for materials discovery. Alongside this paper, we publish a Python package to aid with future model submissions and a growing online leaderboard with adaptive user-defined weighting of various performance metrics allowing researchers to prioritize the metrics they value most. To answer the question of which machine learning methodology performs best at materials discovery, our initial release includes random forests, graph neural networks, one-shot predictors, iterative Bayesian optimizers and universal interatomic potentials. We highlight a misalignment between commonly used regression metrics and more task-relevant classification metrics for materials discovery. Accurate regressors are susceptible to unexpectedly high false-positive rates if those accurate predictions lie close to the decision boundary at 0 eV per atom above the convex hull. The benchmark results demonstrate that universal interatomic potentials have advanced sufficiently to effectively and cheaply pre-screen thermodynamic stable hypothetical materials in future expansions of high-throughput materials databases.

Riebesell, Janosh↗

On Nonuniqueness of Solutions of Hamilton–Jacobi–Bellman Equations

An example of a nonunique solution of the Cauchy problem of Hamilton–Jacobi–Bellman (HJB) equation with surprisingly regular Hamiltonian is presented. The Hamiltonian H(t, x, p) is locally Lipschitz continuous with respect to all variables, convex in p and with linear growth with respect to p and x. The HJB equation possesses two distinct lower semicontinuous solutions with the same final conditions; moreover, one of them is the value function of the corresponding Bolza problem. The definition of lower semicontinuous solution was proposed by Frankowska (SIAM J. Control Optim. 31:257–272, 1993) and Barron and Jensen (Commun. Partial Differ. Equ. 15(12):1713–1742, 1990). Using the example an analysis and comparison of assumptions in some uniqueness results in HJB equations is provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-leakage and low-instability labyrinth seal

Improved labyrinth seal designs are disclosed. The present invention relates to labyrinth seal systems with selected sealing surfaces and seal geometry to optimize flow deflection and produce maximum turbulent action. Optimum seal performance is generally accomplished by providing sealing surfaces and fluid cavities formed to dissipate fluid energy as a function of the geometry of the sealing surfaces along with the position and size of the fluid cavities formed between members of the labyrinth seal system. Improved convex surfaces, annular flow reversal grooves, flow deflection blocks and rough, machined surfaces cooperate to enhance the performance of the labyrinth seal systems. For some labyrinth seal systems a mid-cavity throttle and either rigid teeth or flexible spring teeth may be included.

Rhode, David L.↗

A Generic Model for Electric Double Layers in Porous Electrodes

The performance of electric-double-layer capacitors (EDLCs) hinges on microscopic charge distributions near the electrode/electrolyte interfaces. Whereas practical EDLCs consist of electrodes made of amorphous porous materials, theoretical understanding of EDLCs is mostly based on EDL structure near a planar surface or on simplistic models that have little relevance to realistic systems. In this work, we propose a spherical shell model to account for both pore size and curvature effects of amorphous porous materials. The EDL structure in spherical shells has been investigated over a broad range of pore sizes and curvatures by use of classic density functional theory. Theoretical results reveal that the curvature effects on convex and concave EDLs are drastically different and that materials with extensive convex surfaces will lead to maximized capacitance. Like a slit pore, the spherical shell model also predicts oscillatory variation of capacitance with pore size, but the oscillatory behavior is magnified as the curvature increases. The joint effects of pore size and curvature identified in this work give new insight into materials design for porous electrodes with optimal EDLC performance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-power terahertz quantum cascade lasers with ∼0.23 W in continuous wave mode

Terahertz quantum cascade lasers with a record output power up to ∼0.23 W in continuous wave mode were obtained. We show that the optimal 2.9-mm-long device operating at 3.11 THz has a low threshold current density of 270 A/cm{sup 2} at ∼15 K. The maximum operating temperature arrived at ∼65 K in continuous wave mode and the internal quantum efficiencies decreased from 0.53 to 0.19 for the devices with different cavity lengths. By using one convex lens with the effective focal length of 13 mm, the beam profile was collimated to be a quasi Gaussian distribution.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A convex complementarity approach for simulating large granular flows.

Aiming at the simulation of dense granular flows, we propose and test a numerical method based on successive convex complementarity problems. This approach originates from a multibody description of the granular flow: all the particles are simulated as rigid bodies with arbitrary shapes and frictional contacts. Unlike the discrete element method (DEM), the proposed approach does not require small integration time steps typical of stiff particle interaction; this fact, together with the development of optimized algorithms that can run also on parallel computing architectures, allows an efficient application of the proposed methodology to granular flows with a large number of particles. We present an application to the analysis of the refueling flow in pebble-bed nuclear reactors. Extensive validation of our method against both DEM and physical experiments results indicates that essential collective characteristics of dense granular flow are accurately predicted.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Theoretical search for possible Li–Ni–B crystal structures using an adaptive genetic algorithm

The structural diversity of rare-earth and transition metal borides indicates that alkali-transition metal borides (A-T-B) show tremendous promise in exhibiting a variety of crystal structures with different dimensionalities of T-B frameworks. On the other hand, the A-T-B ternary systems are severely underexplored because of the synthetic challenges associated with their preparation. Accurate and efficient computational predictions of low-energy stable and metastable phases can identify the optimal compositions of the hypothetical compounds in the A-T-B systems to guide the synthesis. As such, in this work, we have computationally discovered several new phases in the Li–Ni–B ternary system. The newly discovered LiNiB, Li 2 Ni 3 B, and Li 2 NiB phases expand the existing theoretical database, and the convex-hull surface of Li–Ni–B has been re-constructed. The lowest energy structure of the LiNiB compound has been found by an adaptive genetic algorithm with layered motif, which matches with the experimentally determined structure. According to our electrochemical calculations, LiNiB and another predicted layered Li 2 NiB compounds have great potential as anode materials for lithium batteries. The Li 2 Ni 3 B compound with the space group P4 3 32 was predicted to crystallize in a cubic structure composed of distorted octahedral units of BNi 6 , which is isostructural to two noncentrosymmetric superconductors Li 2 Pd 3 B and Li 2 Pt 3 B. While we were unable to experimentally confirm the Li 2 Ni 3 B compound utilizing the hydride synthetic route, attempts to synthesize this compound by alternate methods remain highly desirable, considering its potential superconducting properties.

36 MATERIALS SCIENCE↗

UV Capabilities of the CETUS Multi-Object Spectrometer (MOS) and NUV/FUV Camera

The Cosmic Evolution Through UV Spectroscopy (CETUS) concept enables parallel observations by the UV multiobject spectrometer (MOS) and near-UV/far-UV camera which operate simultaneously but independently with their separate field of views. The near-UV MOS can target up to 100 objects at a time without confusion with nearby sources or background zodiacal light. This multiplexing will allow over 100,000 galaxies to be observed over a typical mission lifetime. The MOS includes a next-generation micro-shutter array (NGMSA), an efficient aspheric Offner-like spectrometer design with a convex grating, and nanotube light traps for suppressing unwanted wavelengths. The NUV/FUV Camera has the capability to image in a range of sub-bands from 115-400 nm at the same time the MOS is operating at 180-350 nm. The UV camera has a similar Offner-like relay, selectable filters, and two separate detectors to optimize observing in either the far-UV (115-175 nm) or the near-UV (180-400 nm) utilizing a CsI Micro-Channel Plate detector (MCP) and a CCD respectively.

The Cosmic Evolution Through UV Spectroscopy (CETU↗

Generating moment matching scenarios using optimization techniques

An optimization based method is proposed to generate moment matching scenarios for numerical integration and its use in stochastic programming. The main advantage of the method is its flexibility: it can generate scenarios matching any prescribed set of moments of the underlying distribution rather than matching all moments up to a certain order, and the distribution can be defined over an arbitrary set. This allows for a reduction in the number of scenarios and allows the scenarios to be better tailored to the problem at hand. The method is based on a semi-infinite linear programming formulation of the problem that is shown to be solvable with polynomial iteration complexity. A practical column generation method is implemented. The column generation subproblems are polynomial optimization problems; however, they need not be solved to optimality. It is found that the columns in the column generation approach can be efficiently generated by random sampling. The number of scenarios generated matches a lower bound of Tchakaloff's. The rate of convergence of the approximation error is established for continuous integrands, and an improved bound is given for smooth integrands. Extensive numerical experiments are presented in which variants of the proposed method are compared to Monte Carlo and quasi-Monte Carlo methods on both numerical integration problems and stochastic optimization problems. The benefits of being able to match any prescribed set of moments, rather than all moments up to a certain order, is also demonstrated using optimization problems with 100-dimensional random vectors. Here, empirical results show that the proposed approach outperforms Monte Carlo and quasi-Monte Carlo based approaches on the tested problems.

97 MATHEMATICS AND COMPUTING↗

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant: Preprint

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗

Towards optimal sensor placement for inverse problems in spaces of measures

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in the sensor configuration and robust with respect to the source, yet relatively easy to compute in practice, compared to a direct evaluation of the error by a large number of samples. In particular, we consider the identification of a measure consisting of an unknown linear combination of point sources from a finite number of measurements contaminated by Gaussian noise. The statistical framework for recovery relies on two main ingredients: first, a convex but non-smooth variational Tikhonov point estimator over the space of Radon measures and, second, a suitable mean-squared error based on its Hellinger–Kantorovich distance to the ground truth. To quantify the error, we employ a non-degenerate source condition as well as careful linearization arguments to derive a computable upper bound. This leads to asymptotically sharp error estimates in expectation that are explicit in the sensor configuration. Thus they can be used to estimate the expected reconstruction error for a given sensor configuration and guide the placement of sensors in sparse inverse problems.

97 MATHEMATICS AND COMPUTING↗

An efficient algorithm for solving the generalized trust region subproblem

In this paper, we consider the interval bounded generalized trust region subproblem (GTRS) which is the problem of minimizing a general quadratic function subject to an upper and lower bounded general quadratic constraint. Under the assumption that two matrices from the objective and the constraint functions can be simultaneously diagonalizable via congruence, a diagonalization-based algorithm is introduced to solve it by showing that GTRS is indeed equivalent to a linearly constrained convex univariate problem. Some numerical experiments are given to show the effectiveness of the proposed method and to compare it with the extended Rendl–Wolkowicz algorithm due to Pong and Wolkowicz.

97 MATHEMATICS AND COMPUTING↗

Automated searching for quantum subsystem codes

Quantum error correction allows for faulty quantum systems to behave in an effectively error-free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to active quantum error-correcting schemes as well as to the design of self-correcting quantum memories. Previous approaches for investigating these codes have focused on applying theoretical analysis to look for interesting codes and to investigate their properties. In this paper we present an alternative approach that uses computational analysis to accomplish the same goals. Specifically, we present an algorithm that computes the optimal quantum subsystem code that can be implemented given an arbitrary set of measurement operators that are tensor products of Pauli operators. We then demonstrate the utility of this algorithm by performing a systematic investigation of the quantum subsystem codes that exist in the setting where the interactions are limited to two-body interactions between neighbors on lattices derived from the convex uniform tilings of the plane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiple-Effector Control Allocation: Theory and Practice

Redundant controls are ubiquitous in many aerospace domains, including aircraft, spacecraft, and launch vehicles. Multiple control effectors having different capabilities (e.g., reaction controls, aerosurfaces, and vectored engines) must be optimally allocated to achieve high-performance and robust vehicle control, while considering different constraints, cost, or performance metrics associated with various control mixing schemes. These can include force or deflection limits, rate limits, propellant usage or drag penalties, cross-axis coupling, uncertainties, or even servoelastic interactions. This presentation introduces the fundamentals of control allocation theory, based on linear algebra and convex sets, using a handful of examples taken from the air and space vehicle domains. It is shown that even simple methods can provide verifiable and quantifiable performance benefits over ad-hoc approaches, and can support enhanced functions like fault tolerance and control reconfiguration.

Bill Benson↗

Tightening McCormick Relaxations Toward Global Solution of the ACOPF Problem

Here, we show that a strong upper bound on the objective of the alternating current optimal power flow (ACOPF) problem can significantly improve the effectiveness of optimization-based bounds tightening (OBBT) on a number of relaxations. We additionally compare the performance of relaxations of the ACOPF problem, including the rectangular form without reference bus constraints, the rectangular form with reference bus constraints, and the polar form. We find that relaxations of the rectangular form significantly strengthen existing relaxations if reference bus constraints are included. Overall, relaxations of the polar form perform the best. However, neither the rectangular nor the polar form dominates the other. Ultimately, with these strategies, we are able to reduce the optimality gap to less than 0.1% on all but 5 NESTA test cases with up to 300 buses by performing OBBT alone.

24 POWER TRANSMISSION AND DISTRIBUTION↗