SEARCH · Engineering Papers

Results for “non convex”

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.

SourceResearch connectionFrom yearThrough year

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

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Nonconvex regularization for sparse neural networks

Convex ℓ 1 regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can lead to a loss of sparsity and result in networks with too many active neurons for the given data, in particular if the number of data samples is large. As a remedy, in this paper, a nonconvex regularization method is investigated in the context of shallow ReLU networks: We prove that in contrast to the convex approach, any resulting (locally optimal) network is finite even in the presence of infinite data (i.e., if the data distribution is known and the limiting case of infinite samples is considered). Moreover, here we show that approximation guarantees and existing bounds on the network size for finite data are maintained.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Instabilities and phase transitions in architected metamaterials: a gradient-enhanced continuum approach

Architected metamaterials such as foams and lattices exhibit a wide range of properties governed by microstructural instabilities and emerging phase transitions. Their macroscopic response–including energy dissipation during impact, large recoverable deformations, morphing between configurations, and auxetic behavior–remains difficult to capture with conventional continuum models, which often rely on discrete approaches that limit scalability. In this work, we propose a nonlocal continuum formulation that captures both stable and unstable responses of elastic architected metamaterials. The framework extends anisotropic hyperelasticity by introducing nonlocal variables and internal length scales reflective of microstructural features. Local polyconvex free-energy models are systematically augmented with two families of non-(poly)convex energies, enabling both metastable and bistable responses. Implementation in a finite element framework enables solution using a hybrid monolithic–staggered strategy. Simulations capture densification fronts, forward and reverse transitions, hysteresis loops, imperfection sensitivity, and globally coordinated auxetic modes. Overall, this framework provides a robust foundation for accelerated modeling of instability-driven phenomena in architected metamaterials, while enabling extensions to anisotropic, dissipative, and active systems as well as integration with data-driven and machine learning approaches.

42 ENGINEERING↗

DOE OSTI2024

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗

DOE OSTI2022

Scaling and Benchmarking an Evolutionary Algorithm for Constructing Biophysical Neuronal Models

Single neuron models are fundamental for computational modeling of the brain's neuronal networks, and understanding how ion channel dynamics mediate neural function. A challenge in defining such models is determining biophysically realistic channel distributions. Here, we present an efficient, highly parallel evolutionary algorithm for developing such models, named NeuroGPU-EA. NeuroGPU-EA uses CPUs and GPUs concurrently to simulate and evaluate neuron membrane potentials with respect to multiple stimuli. We demonstrate a logarithmic cost for scaling the stimuli used in the fitting procedure. NeuroGPU-EA outperforms the typically used CPU based evolutionary algorithm by a factor of 10 on a series of scaling benchmarks. We report observed performance bottlenecks and propose mitigation strategies. Finally, we also discuss the potential of this method for efficient simulation and evaluation of electrophysiological waveforms.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

A Distributed Model Identification Algorithm for Multi-Agent Systems: Preprint

In this study, we investigate agent-based approach for system model identification with emphasis on power distribution system applications. Departing from conventional practices of relying on historical data for offline model identification, we adopt online update approach utilizing real-time data by employing the latest data points for gradient computation. This methodology offers advantages including a large reduction in the communication network's bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt in real-time to disturbances. Furthermore, we extend our model identification process from linear frameworks to more complex non-linear convex models. This extension is validated through numerical studies demonstrating improved control performance for a synthetic IEEE test case.

data-driven control↗

DOE OSTI2025

Splitting regions and shrinking islands from higher point constraints

We study constraints from higher-point amplitudes on 2 → 2 scattering in the context of effective field theory (EFT) using the perturbative numerical S-matrix bootstrap. Specifically, we investigate the class of weakly coupled EFTs with amplitudes that obey the hidden zero and split conditions that are known to hold both for Tr(Φ 3 ) theory and for certain string tree amplitudes, including at 4-point the beta function. Requiring the splitting condition for the 5-point amplitude not only fixes nearly all its contact terms, but it also imposes non-linear constraints among the 4-point EFT Wilson coefficients. When included in the bootstrap, the resulting allowed region consistent with positivity is no longer convex but is restricted to a smaller non-convex region — which has a sharp corner near the string beta function! Assuming the absence of an infinite spin tower at the mass gap, the allowed region bifurcates into a trivial region (with states only above a chosen cutoff) and an island that continues to shrink around the string as more constraints are included in the bootstrap. The numerics indicate that in the absence of single-mass infinite spin towers the string beta function is the unique 4-point amplitude compatible with hidden zero and the 5-point splitting constraints. The analysis provides a prototype example for how features of higher-point amplitudes constrain the bootstrap of 4-point amplitudes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Measure this, not that: Optimizing the cost and model-based information content of measurements

Model-based design of experiments (MBDoE) is a powerful framework for selecting and calibrating science-based mathematical models from data. Here, this work extends popular MBDoE workflows by proposing a convex mixed integer (non)linear programming (MINLP) to optimize the selection of measurements. The solver MindtPy is modified to support calculating the D-optimality objective and its gradient via an external package, scipy, using the grey-box module in Pyomo. The new approach is demonstrated in two case studies: estimating highly correlated kinetics from a batch reactor and estimating transport parameters in a large-scale rotary packed bed for CO 2 capture. Both case studies show how examining the Pareto optimal trade-offs between information content measured by A- and D-optimality versus measurement budget offers practical guidance for selecting measurements for scientific experiments.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A Minkowski difference-based advancing front packing technique for generating convex noncircular particles in complex domains

In this work, a Minkowski difference-based advancing front approach is proposed to generate convex and non-circular particles in a predefined computational domain. Two specific algorithms are developed to handle the contact conformity of generated particles with the boundaries of the computational domain. The first, called the open form, is used to handle the smooth contact of generated particles with (external) boundaries, while the other, called the closed form, is proposed to handle the internal boundaries of a computational domain with a complex cavity. The Gilbert-Johnson-Keerthi (GJK) method is used to efficiently solve the contact detection between the newly generated particle at the front and existing particles. Furthermore, the problem of one-sided particle lifting, which can cause some defects in the packing structure in existing advancing front methods during packing generation, is highlighted and an effective solution is developed. Several examples of increasing complexity are used to demonstrate the efficiency and applicability of the proposed packing generation approach. The numerical results show that the generated packing is not only more uniform, but also achieves a higher packing density than existing advancing front methods.

42 ENGINEERING↗

DOE OSTI2022

Cross Inference of Throughput Profiles Using Micro Kernel Network Method

Dedicated network connections are being increasingly deployed in cloud, centralized and edge computing and data infrastructures, whose throughput profiles are critical indicators of the underlying data transfer performance. Due to the cost and disruptions to physical infrastructures, network emulators, such as Mininet, are often used to generate measurements needed to estimate throughput profiles, typically expressed as a function of the connection round trip time. The profiles estimated using measurements from such emulated networks are usually inaccurate for high bandwidth and high latency connections, since they do not accurately reflect the critical network transport dynamics mainly due to computing and memory constraints of the host. We present a machine learning (ML) method to estimate the throughput profiles using emulation measurements to closely match the testbed and production network profiles. In particular, we propose a micro Kernel Network (mKN) that provides baseline throughput measurements on the host running Mininet emulations, which are used to learn a regression map that converts them to the corresponding testbed measurement estimates. Once initially learned, this map is applied to measurements from subsequent network emulations on the same host. We present experimental measurements to illustrate this approach, and derive generalization equations for the proposed mKN-ML method. Using a four-site scenario emulation, we show the effectiveness of this method in providing accurate concave throughput profiles from inaccurate convex or non-smooth ones indicated by Mininet emulation.

Rao, Nageswara↗

DOE OSTI2025

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

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↗

NASA NTRS2006

RAISHIN: A High-Resolution Three-Dimensional General Relativistic Magnetohydrodynamics Code

We have developed a new three-dimensional general relativistic magnetohydrodynamic (GRMHD) code, RAISHIN, using a conservative, high resolution shock-capturing scheme. The numerical fluxes are calculated using the Harten, Lax, & van Leer (HLL) approximate Riemann solver scheme. The flux-interpolated, constrained transport scheme is used to maintain a divergence-free magnetic field. In order to examine the numerical accuracy and the numerical efficiency, the code uses four different reconstruction methods: piecewise linear methods with Minmod and MC slope-limiter function, convex essentially non-oscillatory (CENO) method, and piecewise parabolic method (PPM) using multistep TVD Runge-Kutta time advance methods with second and third-order time accuracy. We describe code performance on an extensive set of test problems in both special and general relativity. Our new GRMHD code has proven to be accurate in second order and has successfully passed with all tests performed, including highly relativistic and magnetized cases in both special and general relativity.

Mizuno, Yosuke↗

NASA NTRS1992

Electromagnetic scattering by coated convex surfaces and wedges simulated by approximate boundary conditions

Asymptotic/high-frequency solutions are developed for analyzing the non-specular scattering mechanisms associated with coated convex surfaces and edges simulated by approximate boundary conditions. In particular, the standard impedance boundary conditions (SIBC's) and the second order generalized impedance boundary conditions (GIBC's) are employed for a characterization of the edge diffraction, creeping wave, and surface diffracted wave contributions. To study the creeping wave and surface diffracted wave mechanisms, rigorous UTD (uniform geometrical theory of diffraction) diffraction coefficients are developed for a convex coated cylinder simulated with SIBC's and GIBC's. The ray solutions obtained remain valid in the transition region and reduce uniformly to those in the deep lit and shadow regions. A uniform asymptotic solution is also presented for observations in the close vicinity of the cylinder. The diffraction coefficient for a convex cylinder are obtained via a generalization of the corresponding ones of the circular cylinder. To validate the asymptotic/high-frequency solution, integral equations are derived for both E and H-polarization and solved numerically using the method of moments. Results are presented for a single and three layered coated convex cylinder. Some insights are also provided on the accuracy of the employed GIBC's versus SIBC's for application to curved surfaces. To characterize the scattering by impedance wedges illuminated at skew incidence, diffraction coefficients are derived from an approximate solution of the governing functional difference equations. This solution exactly recovers the known ones for an impedance half plane or an arbitrary wedge at normal incidence, and to validate it for other wedge angles, a moment method code was used. Finally, to test the usefulness of the approximate skew incidence impedance wedge diffraction coefficient for three dimensional structures, equivalent currents are derived in the context of the physical theory of diffraction (PTD) for a finite length impedance wedge of arbitrary internal angles. These are incorporated in a standard general purpose PTD code and results are presented for a number of different impedance structures.

Syed, H. H.↗

DOE OSTI2025

Convex relaxation for Fokker–Planck equation

We propose an approach to directly estimate the moments or marginals for a high-dimensional equilibrium distribution in statistical mechanics by solving the high-dimensional Fokker–Planck equation in terms of low-order cluster moments or marginals. With this approach, we bypass the exponential complexity of estimating the full high-dimensional distribution and directly solve the simplified partial differential equations for low-order moments/marginals. Moreover, the proposed moment/marginal relaxation is fully convex and can be solved via off-the-shelf solvers. We further propose a time-dependent version of the convex programs to study non-equilibrium dynamics. In a specific setting, we show the proposed method can recover a mean-field-type equilibrium density. Numerical results are provided to demonstrate the performance of the proposed algorithm for high-dimensional systems.

Chen, Yian↗

NASA NTRS1990

Random search optimization based on genetic algorithm and discriminant function

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

Kiciman, M. O.↗

DOE OSTI2022

Geometric prior of multi-resolution yielding manifolds and the local closest point projection for nearly non-smooth plasticity

Elastoplasticity models often introduce a scalar-valued yield function to implicitly represent the boundary between elastic and plastic material states. Here this paper introduces a new alternative where the yield envelope is represented by a manifold of which the topology and the geometry are learned from a set of data points in a parametric space (e.g. principal stress space, π-plane). Here, deep geometric learning enables us to reconstruct a highly complex yield envelope by breaking it down into multiple coordinate charts. The global atlas that consists of these coordinate charts in return allows us to represent the yield surface via multiple overlapping patches, each with a specific local parametrization. This setup provides several advantages over the classical implicit function representation approach. For instance, the availability of coordinate charts enables us to introduce an alternative stress integration algorithm where the trial stress may project directly on a local patch and hence circumvent the issues related to non-smoothness and the lack of convexity of yield surfaces. Meanwhile, the local parametric approach also enables us to predict hardening/softening locally in the parametric space, even without complete knowledge of the yield surface. Comparisons between the classical yield function approach on the non-smooth plasticity and anisotropic cam-clay plasticity model are provided to demonstrate the capacity of the models for highly precise yield surface and the feasibility of the implementation of the learned model in the local stress integration algorithm.

42 ENGINEERING↗

NASA NTRS2003

Imparting Desired Attributes by Optimization in Structural Design

Commonly available optimization methods typically produce a single optimal design as a Constrained minimum of a particular objective function. However, in engineering design practice it is quite often important to explore as much of the design space as possible with respect to many attributes to find out what behaviors are possible and not possible within the initially adopted design concept. The paper shows that the very simple method of the sum of objectives is useful for such exploration. By geometrical argument it is demonstrated that if every weighting coefficient is allowed to change its magnitude and its sign then the method returns a set of designs that are all feasible, diverse in their attributes, and include the Pareto and non-Pareto solutions, at least for convex cases. Numerical examples in the paper include a case of an aircraft wing structural box with thousands of degrees of freedom and constraints, and over 100 design variables, whose attributes are structural mass, volume, displacement, and frequency. The method is inherently suitable for parallel, coarse-grained implementation that enables exploration of the design space in the elapsed time of a single structural optimization.

Sobieszczanski-Sobieski, Jaroslaw↗

NASA NTRS1998

Numerical Simulation of THM Growth of CdTe in Presence of Rotating Magnetic Fields

The influence of rotating magnetic fields (RMF) on the flow pattern and compositional uniformity in the solution zone of a traveling heater method (THM) system for growth of CdTe is numerically investigated. The analysis is conducted at the 10(exp -6) and 10(exp -1) g(sub 0) as representative of space and ground processing conditions. It is shown that under microgravity conditions, application of RMF can be used to overwhelm residual buoyancy-induced convection and to control the uniformity of solution-zone composition at the growth front without appreciable modification of the growth interface shape. At high gravity levels, RMF is found not to be able to completely dominate buoyancy-induced convection. In this regime, for the range of field strengths studied, RMF is found to result in a) complex flow structures in the solution zone, b) enhancement of compositional non-uniformities at the growth front, and c) increased convexity of the growth interface. A scaling analysis of convection in the solution zone is used to generate a non-dimensional map delineating the RMF- and gravity-dominated flow regimes.

Ghaddar, Chahid K.↗