Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “SQP”

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 55 records · Page 3

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-Vapor-Pressure Solvent Additives Function as Polymer Swelling Agents in Bulk Heterojunction Organic Photovoltaics

Here, bulk heterojunction (BHJ) photovoltaics based on blends of conjugated polymers and fullerenes require an optimized nanoscale morphology. Casting BHJ films using solvent additives such as 1,8-diiodooctane (DIO), 1,8-octanedithiol (ODT), chloronapthalene (CN), or diphenyl ether (DPE) often helps achieve this proper morphology: adding just a few volume percent of additive to the casting solution can improve polymer/fullerene mixing or phase separation, so that solvent additives have become staples in producing high-efficiency BHJ solar cells. The mechanism by which these additives improve BHJ morphology, however, is poorly understood. Here, we investigate how these additives control polymer/fullerene mixing by taking advantage of sequential processing (SqP), in which the polymer is deposited first and then the fullerene is intercalated into the polymer underlayer in a second processing step using a quasi-orthogonal solvent. In this way, SqP isolates the role of the additives’ interactions with the polymer and the fullerene.

1,8-diiodooctane↗

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗

Robustness, generality and efficiency of optimization algorithms in practical applications

The theoretical foundations of two approaches, sequential quadratic programming (SQP) and optimality criteria (OC), are analyzed and compared, with emphasis on the critical importance of parameters such as accuracy, generality, robustness, efficiency, and ease of use in large scale structural optimization. A simplified fighter wing and active control of space structures are considered with other example problems. When applied to general system identification problems, the OC methods are shown to lose simplicity and demonstrate lack of generality, accuracy and robustness. It is concluded that the SQP method with a potential constraint strategy is a better choice as compared to the currently prevalent mathematical programming and OC approaches.

Thanedar, P. B.↗

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Brown, Aaron J.↗

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Optimal design of microtube recuperators for an indirect supercritical carbon dioxide recompression closed Brayton cycle

This paper presents a baseline design and optimization approach developed in Aspen Custom Modeler (ACM) for microtube shell-and-tube exchangers (MSTEs) used for high- and low-temperature recuperation in a 10 MWe indirect supercritical carbon dioxide (sCO 2 ) recompression closed Brayton cycle (RCBC). The MSTE-type recuperators are designed using one-dimensional models with thermal-hydraulic correlations appropriate for sCO 2 and properties models that capture considerable nonlinear changes in CO 2 properties near the critical and pseudo-critical points. Using the successive quadratic programming (SQP) algorithm in ACM, optimal recuperator designs are obtained for either custom or industry-standard microtubes considering constraints based on current advanced manufacturing techniques. The three decision variables are the number of tubes, tube pitch-to-diameter ratio, and tube diameter. Five different objective functions based on different key design measures are considered: minimization of total heat transfer area, heat exchanger volume, metal weight, thermal residence time, and maximization of compactness. Sensitivities studies indicate the constraint on the maximum number of tubes per shell does affect the number of parallel heat exchanger trains but not the tube selection, total number of tubes, tube length and other key design measures in the final optimal design when considering industry-standard tubes. In this study, the optimally designed high- and low-temperature recuperators have 47,000 3/32 inch tubes and 63,000 1/16 inch tubes, respectively. In addition, sensitivities to the design temperature approach and maximum allowable pressure drop are studied, since these specifications significantly impact the optimal design of the recuperators as well as the thermal efficiency and the economic performance of the entire sCO 2 Brayton cycle.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Biomimetic model-based advanced control strategy integrated with multi-agent optimization for nonlinear chemical processes

Here, a novel framework is proposed for integrating biomimetic-based advanced control and multi-agent optimization approaches for nonlinear chemical process applications. In particular, a Biologically-Inspired Optimal Control Strategy, denoted as BIO-CS, is combined with multi-agent optimization (MAO) techniques to provide optimal solutions for dynamic systems. In this combined framework, the BIO-CS algorithm employs gradient-based optimal control solvers for the intermediate problems associated with the leader-follower agents’ local interactions. Also, the MAO uses the capabilities of heuristic-based optimization techniques by sharing process information to obtain optimal operating setpoints for the controller considering an overall process objective. The applicability of the proposed method is demonstrated using a nonlinear, multivariable, process model of a fermentation system. Specifically, the optimal operating points are computed by the MAO implementation for setpoint tracking, trajectory tracking and plant-model mismatch scenarios for BIO-CS application. Results of the developed framework are compared to a gradient-based Sequential Quadratic Programming (SQP) technique and a classical proportional-integral (PI) controller in terms of optimization and control studies, respectively. As an additional contribution, BIO-CS is also cast as a model predictive controller (MPC) for the first time and compared to the agent-based BIO-CS approach in terms of computational time and tracking error. Closed-loop control results show up to 46% improvement in tracking performance during transient for the multi-agent BIO-CS when compared to BIO-CS as MPC for additional computational expense. The obtained results illustrate the capabilities of this novel integrated framework including BIO-CS as MPC to achieve desired nonlinear system performance for various scenarios.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Demonstration of low-level biogenic fuel content using quench curve and direct liquid scintillation counting (LSC) methods

In this work, an investigation into the direct method for liquid scintillation counting (LSC) quantification of biogenic fuel content in fuel blendstock is presented. This method development intentionally used a colored matrix (~99 wt%), fossil diesel fraction, and low-level biogenic fractions (~1 wt%) to determine the applicability of the LSC technique in colored blend mixtures. LSC procedures for quench correction, including the use of an instrument internal standard (Quantulus SQP values), color quench curves, and an internal 14 C standard spike on samples containing low-level amounts of biogenic gasoline, jet, and diesel mixed with fossil fuel, were compared. Samples were analyzed on both Perkin-Elmer Quantulus and Tri-Carb instruments, and the 14 C contents were compared with those determined by accelerator mass spectrometry (AMS). Results from the Tri-Carb instrument showed that percent differences of <10 % compared to AMS-reported values are achievable at 5-hour count times despite colored samples. A comparison between the impact of chemical and color quenching in the fuel samples showed that color quenching in highly colored samples reduces efficiency significantly more than chemical quenching, indicating that chemical quench curves are not appropriate for highly colored biofuel/fossil-fuel blended samples. Results indicate that both the direct method with internal spike quench correction and the use of a color-quench curve provide accurate results for 1 % biogenic fuel blends. Additionally, we have explored the use of Fourier transform infrared (FTIR) spectroscopy in measuring the biogenic content of the colored blended fuel samples. Preliminary results show the presence of biogenic carbon-derived fingerprints that are absent in fossil-derived sample. However, further work is needed to develop an FTIR-based quantitative method.

09 BIOMASS FUELS↗

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constraint Optimization Problem For The Cutting Of A Cobalt Chrome Refractory Material

This paper shows a complete approach to solve a given problem, from the experimentation to the optimization of different cutting parameters. In response to an industrial problem of slotting FSX 414, a Cobalt-based refractory material, we have implemented a design of experiment to determine the most influent parameters on the tool life, the surface roughness and the cutting forces. After theses trials, an optimization approach has been implemented to find the lowest manufacturing cost while respecting the roughness constraints and cutting force limitation constraints. The optimization approach is based on the Response Surface Method (RSM) using the Sequential Quadratic programming algorithm (SQP) for a constrained problem. To avoid a local optimum and to obtain an accurate solution at low cost, an efficient strategy, which allows improving the RSM accuracy in the vicinity of the global optimum, is presented. With these models and these trials, we could apply and compare our optimization methods in order to get the lowest cost for the best quality, i.e. a satisfying surface roughness and limited cutting forces.

36 MATERIALS SCIENCE↗

Fast methods for multisite charge transfer processes. I. Constrained, state averaged CASSCF(1,n) and CASSCF(2n − 1,n) simulations

We design a dynamically weighted state-averaged constrained complete active space self-consistent field (DW-SA-cCASSCF) algorithm to treat electrons or holes moving between n molecular fragments (where n can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider configurations that are mutually single excitations of each other, and we apply a generalized set of constraints to tailor the method for studying charge transfer problems. The constrained optimization problem is efficiently solved using a DIIS-SQP algorithm, thus maintaining computational efficiency. We demonstrate the method for a finite Su–Schrieffer–Heeger chain, successfully reproducing the expected exponential decay of diabatic couplings with distance. When combined with a gradient, the current extension immediately enables efficient nonadiabatic dynamics simulations of complex multi-state charge transfer processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-E-I-76: Matching Primary and Scattered X-Ray Spectra for Use in Calculating the Diagnostic Radiation Index of Protection

Purpose: Lightweight lead-free or lead-composite protective garments exploit k-edge interactions to attenuate scattered X-rays. Manufacturers specify the protective value of garments in terms of lead equivalence at a single kVp. This is inadequate, as the protection provided by such garments varies with radiation quality in different use conditions. We present a method for matching scattered X-ray spectra to primary X-ray spectra. The resulting primary spectra can be used to measure penetration through protective garments, and such measurements can be weighted and summed to determine a Diagnostic Radiation Index for Protection (DRIP). Methods: Scattered X-ray spectra from fluoroscopic procedures were modeled using Monte Carlo techniques in MCNP-X 2.7. Data on imaging geometry, operator position, patient size, and primary beam spectra were gathered from clinical fluoroscopy procedures. These data were used to generate scattered X-ray spectra resulting from procedural conditions. Technical factors, including kV and added filtration, that yielded primary X-ray spectra that optimally matched the generated scattered X-ray spectra were identified through numerical optimization using a sequential quadratic programming (SQP) algorithm. Results: The primary spectra generated with shape functions matched the relative flux in each bin of the scattered spectra within 5%, and half and quarter-value layers matched within 0.1%. The DRIP for protective garments can be determined by measuring the penetration through protective garments using the matched primary spectra, then calculating a weighted average according to the expected clinical use of the garment. The matched primary spectra are specified in terms of first and second half-value layers in aluminum and acrylic. Conclusion: Lead equivalence is inadequate for completely specifying the protective value of garments. Measuring penetration through a garment using full scatter conditions is very difficult. The primary spectra determined in this work allow for practical primary penetration measurements to be made with equipment readily available to clinical medical physicists.

61 RADIATION PROTECTION AND DOSIMETRY↗

GlobiPack v. 1.0

GlobiPack contains a small collection of optimization globalization algorithms. These algorithms are used by optimization and various nonlinear equation solver algorithms.Used as the line-search procedure with Newton and Quasi-Newton optimization and nonlinear equation solver methods. These are standard published 1-D line search algorithms such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. One set of algorithms were copied and refactored from the existing open-source Trilinos package MOOCHO where the linear search code is used to globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.

Bartlett, Roscoe↗

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗

Nuclear Fuel Cycle

These slides will be presented at the training course “International Training Course on Implementing State Systems of Accounting for and Control (SSAC) of Nuclear Material for States with Small Quantity Protocols (SQP),” on November 3-7, 2014 in Santa Fe, New Mexico. The slides provide a basic overview of the Nuclear Fuel Cycle. This is a joint training course provided by NNSA and IAEA.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗