Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear 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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Simultaneous Sensing Error Recovery and Tomographic Inversion Using an Optimization-Based Approach

Tomography can be used to reveal internal properties of a 3D object using any penetrating wave. Advanced tomographic imaging techniques, however, are vulnerable to both systematic and random errors associated with the experimental conditions, which are often beyond the capabilities of the state-of-the-art reconstruction techniques such as regularizations. Because they can lead to reduced spatial resolution and even misinterpretation of the underlying sample structures, these errors present a fundamental obstacle to full realization of the capabilities of next-generation physical imaging. In this work, we develop efficient and explicit recovery schemes of the most common experimental error: movement of the center of rotation during the experiment. We formulate new physical models to capture the experimental setup, and we devise new mathematical optimization formulations for reliable inversion of complex samples. We demonstrate and validate the efficacy of our approach on synthetic data under known perturbations of the center of rotation.

Nonlinear optimization↗
DOE OSTI2017

New method to design stellarator coils without the winding surface

Finding an easy-to-build coils set has been a critical issue for stellarator design for decades. Conventional approaches assume a toroidal 'winding' surface, but a poorly chosen winding surface can unnecessarily constrain the coil optimization algorithm, This article presents a new method to design coils for stellarators. Each discrete coil is represented as an arbitrary, closed, one-dimensional curve embedded in three-dimensional space. A target function to be minimized that includes both physical requirements and engineering constraints is constructed. The derivatives of the target function with respect to the parameters describing the coil geometries and currents are calculated analytically. A numerical code, named flexible optimized coils using space curves (FOCUS), has been developed. Furthermore, applications to a simple stellarator configuration, W7-X and LHD vacuum fields are presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

OPFLearnData: Dataset for Learning AC Optimal Power Flow

The datasets are resulting from OPFLearn.jl, a Julia package for creating AC OPF datasets. The package was developed to provide researchers with a standardized way to efficiently create AC OPF datasets that are representative of more of the AC OPF feasible load space compared to typical dataset creation methods. The OPFLearn dataset creation method uses a relaxed AC OPF formulation to reduce the volume of the unclassified input space throughout the dataset creation process. The dataset contains load profiles and their respective optimal primal and dual solutions. Load samples are processed using AC OPF formulations from PowerModels.jl. More information on the dataset creation method can be found in our publication, "OPF-Learn: An Open-Source Framework for Creating Representative AC Optimal Power Flow Datasets" and in the package website: https://github.com/NREL/OPFLearn.jl.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

Coronary artery analysis: Computer-assisted selection of best-quality segments in multiple-phase coronary CT angiography

Purpose: The authors are developing an automated method to identify the best-quality coronary arterial segment from multiple-phase coronary CT angiography (cCTA) acquisitions, which may be used by either interpreting physicians or computer-aided detection systems to optimally and efficiently utilize the diagnostic information available in multiple-phase cCTA for the detection of coronary artery disease. Methods: After initialization with a manually identified seed point, each coronary artery tree is automatically extracted from multiple cCTA phases using our multiscale coronary artery response enhancement and 3D rolling balloon region growing vessel segmentation and tracking method. The coronary artery trees from multiple phases are then aligned by a global registration using an affine transformation with quadratic terms and nonlinear simplex optimization, followed by a local registration using a cubic B-spline method with fast localized optimization. The corresponding coronary arteries among the available phases are identified using a recursive coronary segment matching method. Each of the identified vessel segments is transformed by the curved planar reformation (CPR) method. Four features are extracted from each corresponding segment as quality indicators in the original computed tomography volume and the straightened CPR volume, and each quality indicator is used as a voting classifier for the arterial segment. A weighted voting ensemble (WVE) classifier is designed to combine the votes of the four voting classifiers for each corresponding segment. The segment with the highest WVE vote is then selected as the best-quality segment. In this study, the training and test sets consisted of 6 and 20 cCTA cases, respectively, each with 6 phases, containing a total of 156 cCTA volumes and 312 coronary artery trees. An observer preference study was also conducted with one expert cardiothoracic radiologist and four nonradiologist readers to visually rank vessel segment quality. The performance of our automated method was evaluated by comparing the automatically identified best-quality segments identified by the computer to those selected by the observers. Results: For the 20 test cases, 254 groups of corresponding vessel segments were identified after multiple phase registration and recursive matching. The AI-BQ segments agreed with the radiologist’s top 2 ranked segments in 78.3% of the 254 groups (Cohen’s kappa 0.60), and with the 4 nonradiologist observers in 76.8%, 84.3%, 83.9%, and 85.8% of the 254 groups. In addition, 89.4% of the AI-BQ segments agreed with at least two observers’ top 2 rankings, and 96.5% agreed with at least one observer’s top 2 rankings. In comparison, agreement between the four observers’ top ranked segment and the radiologist’s top 2 ranked segments were 79.9%, 80.7%, 82.3%, and 76.8%, respectively, with kappa values ranging from 0.56 to 0.68. Conclusions: The performance of our automated method for selecting the best-quality coronary segments from a multiple-phase cCTA acquisition was comparable to the selection made by human observers. This study demonstrates the potential usefulness of the automated method in clinical practice, enabling interpreting physicians to fully utilize the best available information in cCTA for diagnosis of coronary disease, without requiring manual search through the multiple phases and minimizing the variability in image phase selection for evaluation of coronary artery segments across the diversity of human readers with variations in expertise.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2024

Approximate entropy analysis for nonlinear beam dynamics

In this paper, we applied an approximate entropy (ApEn) analysis to nonlinear beam dynamics. Due to the presence of strong nonlinear magnets, the degree of chaos in beam motion gradually increases proportionally with its amplitude. Such chaos can be quantitatively characterized with ApEn of beam turn-by-turn readings. ApEn analysis is a technique used to quantify the amount of regularity and the unpredictability of fluctuations with respect to time-series data. The ApEn, when applied as a chaos indicator, can then be used for nonlinear lattice optimization and analysis. The National Synchrotron Light Source II (NSLS-II) electron storage ring lattice was used as an example of a real-world application of our technique. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

A General Framework for Process Synthesis, Integration, and Intensification

Process synthesis, integration, and intensification are the three pillars of process design. Current synthesis and integration methods are able to find optimal design targets and process configurations when all the alternatives are known beforehand. Process intensification, on the other hand, combines multiple physicochemical phenomena and exploits their interactions to create innovative designs. Often times, these designs are not known beforehand, and a phenomena-level representation of chemical processes are required to identify them. This disconnection between the three paradigms limits the ability to systematically discover optimal design pathways. We demonstrate that the building block representation, originally proposed in our earlier work on process intensification, has the potential to bridge this gap. Depending on the attributes assigned to the interior and the boundaries of these two-dimensional abstract building blocks, they can represent various intensified or isolated phenomena at the lowest level, various tasks at the equipment level, and various unit operations at the flowsheet level. Here, this common multiscale representation enables an mixed-integer nonlinear optimization-based single framework for the sequential or simultaneous synthesis, integration, and intensification of chemical processes. Such a general framework is critical to reduce the risk of eliminating potential intensification pathways and candidate flowsheets at the conceptual design stage. The framework is demonstrated using a case study on an ethylene glycol process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

Automated property optimization via ab initio O(N) elongation method: Application to (hyper-)polarizability in DNA

An automated property optimization method was developed based on the ab initio O(N) elongation (ELG) method and applied to the optimization of nonlinear optical (NLO) properties in DNA as a first test. The ELG method mimics a polymerization reaction on a computer, and the reaction terminal of a starting cluster is attacked by monomers sequentially to elongate the electronic structure of the system by solving in each step a limited space including the terminal (localized molecular orbitals at the terminal) and monomer. The ELG-finite field (ELG-FF) method for calculating (hyper-)polarizabilities was used as the engine program of the optimization method, and it was found to show linear scaling efficiency while maintaining high computational accuracy for a random sequenced DNA model. Furthermore, the self-consistent field convergence was significantly improved by using the ELG-FF method compared with a conventional method, and it can lead to more feasible NLO property values in the FF treatment. The automated optimization method successfully chose an appropriate base pair from four base pairs (A, T, G, and C) for each elongation step according to an evaluation function. From test optimizations for the first order hyper-polarizability (β) in DNA, a substantial difference was observed depending on optimization conditions between “choose-maximum” (choose a base pair giving the maximum β for each step) and “choose-minimum” (choose a base pair giving the minimum β). In contrast, there was an ambiguous difference between these conditions for optimizing the second order hyper-polarizability (γ) because of the small absolute value of γ and the limitation of numerical differential calculations in the FF method. It can be concluded that the ab initio level property optimization method introduced here can be an effective step towards an advanced computer aided material design method as long as the numerical limitation of the FF method is taken into account.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Gradient-based optimization of complex nanoparticle heterostructures enabled by deep learning on heterogeneous graphs

Applications of deep learning (DL) to design nanomaterials are hampered by a lack of suitable data representations and training data. Here, in this study, we report efforts to overcome these limitations and leverage DL to optimize the nonlinear optical properties of core–shell upconverting nanoparticles (UCNPs). UCNPs, which have applications in fields such as biosensing, super-resolution microscopy and three-dimensional printing, can emit visible and ultraviolet light from near-infrared excitations. We report a large-scale dataset of UCNP emission spectra based on accurate but expensive kinetic Monte Carlo simulations (N > 6,000) and use these data to train a heterogeneous graph neural network using a physically motivated representation of UCNP nanostructure. Applying gradient-based optimization on the trained graph neural network, we identify structures with 6.5× higher predicted emission under 800-nm illumination than any UCNP in our training set. Our work reveals design principles for UCNP heterostructures and presents a roadmap for DL-based inverse design of nanomaterials.

Sivonxay, Eric [Lawrence Berkeley National Laborat↗
DOE OSTI2015

Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations

Tensor factorizations with nonnegativity constraints have found application in analysing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g. count data), which leads to sparse tensors that can be modelled by sparse factor matrices. In this paper, we investigate efficient techniques for computing an appropriate canonical polyadic tensor factorization based on the Kullback–Leibler divergence function. We propose novel subproblem solvers within the standard alternating block variable approach. Our new methods exploit structure and reformulate the optimization problem as small independent subproblems. We employ bound-constrained Newton and quasi-Newton methods. Finally, we compare our algorithms against other codes, demonstrating superior speed for high accuracy results and the ability to quickly find sparse solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Decomposition and Algorithmic Approaches for Solving Large-Scale Process Family Design Problems

Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).

Stinchfield, Georgia↗
DOE OSTI2017

An efficient MILP framework for integrating nonlinear process dynamics and control in optimal production scheduling calculations

The emphasis currently placed on enterprise-wide decision making and optimization has led to an increased need for methods of integrating nonlinear process dynamics and control information in scheduling calculations. The inevitable high dimensionality and nonlinearity of first-principles dynamic process models makes incorporating them in scheduling calculations challenging. In this work, we describe a general framework for deriving data-driven surrogate models of the closed-loop process dynamics. Focusing on Hammerstein–Wiener and finite step response (FSR) model forms, we show that these models can be (exactly) linearized and embedded in production scheduling calculations. The resulting scheduling problems are mixed-integer linear programs with a special structure, which we exploit in a novel and efficient solution strategy. A polymerization reactor case study is utilized to demonstrate the merits of this method. Finally, our framework compares favorably to existing approaches that embed dynamics in scheduling calculations, showing considerable reductions in computational effort.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

Augmenting the one-shot framework by additional constraints

The (multistep) one-shot method for design optimization problems has been successfully implemented for various applications. To this end, a slowly convergent primal fixed-point iteration of the state equation is augmented by an adjoint iteration and a corresponding preconditioned design update. In this paper we present a modification of the method that allows for additional equality constraints besides the usual state equation. Finally, a retardation analysis and the local convergence of the method in terms of necessary and sufficient conditions are given, which depend on key characteristics of the underlying problem and the quality of the utilized preconditioner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Study of Lower Emittance Lattices for SPEAR3

We study paths to significantly reduce the emittance of the SPEAR3 storage ring. Lattice possibilities are explored with the GLASS technique. New lattices are designed and optimized for practical dynamic aperture and beam lifetime. Various techniques are employed to optimize the nonlinear dynamics, including the Elegant-based genetic algorithm. Experimental studies are also carried out on the ring to validate the lattice design. The SPEAR3 storage ring is a third generation light source which has a racetrack layout with a circumference of 234.1 m. The requirement to maintain the photon beamline positions put a significant constraint on the lattice design. Consequently the emittance of SPEAR3 is not on par with some of the recently-built third generation light sources. The present operational lattice has an emittance of 10 nm. For the photon beam brightness of SSRL to remain competitive among the new or upgraded ring-based light sources, it is necessary to significantly reduce the emittance of SPEAR3. In this paper we report our ongoing effort to develop a lower emittance solution for SSRL. We first show the potential of the SPEAR3 lattice with results of the standard cell study using the GLASS technique. This is followed by a discussion of the design strategy for full-ring linear lattices. Several lattice options are compared. We then show the methods and results for dynamic aperture optimization. Experiments were also conducted on the SPEAR3 ring to implement the lattice and to measure the key lattice parameters.

43 PARTICLE ACCELERATORS↗
DOE OSTI2012

Explicit formulas for 2nd-order driving terms due to sextupoles and chromatic effects of quadrupoles

Optimization of nonlinear driving terms have become a useful tool for designing storage rings, especially modern light sources where the strong nonlinearity is dominated by the large chromatic effects of quadrupoles and strong sextupoles for chromaticity control. The Lie algebraic method is well known for computing such driving terms. However, it appears that there was a lack of explicit formulas in the public domain for such computation, resulting in uncertainty and/or inconsistency in widely used codes. This note presents explicit formulas for driving terms due to sextupoles and chromatic effects of quadrupoles, which can be considered as thin elements. The computation is accurate to the 4th-order Hamiltonian and 2nd-order in terms of magnet parameters. The results given here are the same as the APS internal note AOP-TN-2009-020. This internal nte has been revised and published here as a Light Source Note in order to get this information into the public domain, since both ELEGANT and OPA are using these formulas.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers

We present Q-SASS, a quasi-Newton method for unconstrained stochastic optimization that does not rely on common random numbers. Most existing quasi-Newton approaches leverage common random numbers to construct second-order updates. However, motivated by challenges in variational quantum algorithms—where such coordination is not possible—we consider the setting in which function values and gradients are accessible only through noisy probabilistic zeroth- and first-order oracles, and no common random numbers can be exploited. We derive high-probability tail bounds on the iteration complexity of our algorithm for nonconvex, convex, and strongly convex (more generally, those satisfying the PL condition) objective functions. Finally, we demonstrate the empirical benefits of our quasi-Newton updating scheme on both synthetic and quantum chemistry problems.

Complexity bound↗
DOE OSTI2011

LOW HORIZONTAL BETA FUNCTION IN LONG STRAIGHTS OF THE NSLS-II LATTICE

The NSLS-II storage ring lattice is comprised of 30 DBA cells arranged in 15 superperiods. There are 15 long straight sections (9.3m) for injection, RF and insertion devices and 15 short straights (6.6m) for insertion devices. In the baseline lattice, the short straights have small horizontal and vertical beta functions but the long straights have large horizontal beta function optimized for injection. In this paper, we explore the possibility of maintaining three long straights with large horizontal beta function while providing the other 12 long straights with smaller horizontal beta function to optimize the brightness of insertion devices. Our study considers the possible linear lattice solutions as well as characterizing the nonlinear dynamics. Results are reported on optimization of dynamic aperture required for good injection efficiency and adequate Touschek lifetime. This paper discusses dynamic aperture optimization for the NSLS-II lattice with alternate high and low horizontal beta function in the long straights, which is proposed for the optimization of the brightness of insertion devices. The linear optics is optimized to meet the requirements of lattice function and source properties. Nonlinear optimization for a lattice with working point at (37.18, 16.2) is performed. Considering the realistic magnets errors and physical apertures, we calculate the frequency maps and plot the tune footprint. The results show that the lattice with high-low beta function has adequate dynamic aperture for good injection efficiency and sufficient Touschek lifetime.

43 PARTICLE ACCELERATORS↗
DOE OSTI2016

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Interactive Exploration of High-Dimensional Phase Diagrams

High-dimensional thermodynamic phase stability databases are becoming increasingly common due to the convergence of three recent trends: (i) the widespread interest in so-called “high-entropy” alloys, (ii) the availability of high-throughput computational assessments of phase stability in broad composition spaces and (iii) the ongoing development of ever-increasingly broad, multicomponent, multiphase CALPHAD databases. Although automated computational tools can readily process such high-dimensional data, scientists are often unable to visualize the relevant phase relations, an ability that is crucial to gaining an intuitive understanding of the stability constraints governing materials design. The present work addresses this need by providing algorithms that enable the interactive exploration of phase equilibria in high-dimensional spaces. These algorithms concentrate the complex nonlinear nonsmooth optimization needed into a preprocessing step that generates a large number of high-dimensional yet elementary graphical primitives. Furthermore, these primitives can then be cross-sectioned to yield 3-dimensional views in a computationally efficient manner that enables an interactive exploration of high-dimensional spaces. All of these operations are highly parallelizable, thus facilitating scaling of this method to large data sets.

36 MATERIALS SCIENCE↗