Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Branch and bound”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS2022

Alternative regularizations for Outer-Approximation algorithms for convex MINLP

In this work, we extend the regularization framework from Kronqvist et al. (Math Program 180(1):285–310, 2020) by incorporating several new regularization functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems. We propose a set of regularization functions based on distance metrics and Lagrangean approximations, used in the projection problem for finding new integer combinations to be used within the Outer-Approximation (OA) method. The new approach, called Regularized Outer-Approximation (ROA), has been implemented as part of the open-source Mixed-integer nonlinear decomposition toolbox for Pyomo—MindtPy. We compare the OA method with seven regularization function alternatives for ROA. Moreover, we extend the LP/NLP Branch and Bound method proposed by Quesada and Grossmann (Comput Chem Eng 16(10–11):937–947, 1992) to include regularization in an algorithm denoted RLP/NLP. We provide convergence guarantees for both ROA and RLP/NLP. Finally, we perform an extensive computational experiment considering all convex MINLP problems in the benchmark library MINLPLib. The computational results show clear advantages of using regularization combined with the OA method.

Convex Mixed-integer nonlinear programming↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
DOE OSTI2026

$Ξ$ 𝑏 → $Ξ$ form factors from lattice QCD and standard-model predictions for $Ξ$ 𝑏 → $Ξ$⁢𝜇 + ⁢𝜇 − and $Ξ$ 𝑏 → $Ξ$⁢𝛾 decays

We present the first lattice QCD determination of the $Ξ$ 𝑏 → $Ξ$ vector, axial-vector, and tensor form factors, which are relevant for the theory of rare decays including $Ξ$ 𝑏 → $Ξ$⁢ℓ + ⁢ℓ − and $Ξ$ 𝑏 → $Ξ$⁢𝛾. The calculation is performed with 2+1 flavors of domain-wall fermions at three different lattice spacings and pion masses in the range from approximately 430 to 230 MeV. The bottom quark is implemented using an anisotropic clover action. Three-point functions with a wide range of source-sink separations and model averaging are used to extract the ground-state contributions. We fit the dependence of the form factors on the momentum transfer, the pion mass, and the lattice spacing using modified 𝑧 expansions that account for subthreshold branch cuts, and apply dispersive bounds and asymptotic behavior constraints to achieve controlled uncertainties in the full semileptonic kinematic region. Using our form factor results, we present standard model predictions for the $Ξ$$^{−}_{𝑏}$ → $Ξ$ − ⁢𝛾 and $Ξ$$^{−}_{𝑏}$ → $Ξ$ − ⁢𝜇 + ⁢𝜇 − branching fractions and two angular observables.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Production of muonic kaon atoms at high-energy colliders

We develop a framework for the formation of exotic muonic kaon atoms ($K\mu$) in semileptonic $D^{0}$ decays, using the effective weak Hamiltonian, a helicity-based treatment of the leptonic current, and a nonrelativistic bound-state projection. The resulting branching ratio, $\mathrm{BR}(D^{0}\!\to(K\mu )\nu_{\mu})=2.29\times10^{-10}$, is implemented in a ROOT-based code to estimate yields at RHIC, LHC, and STCF. We show quantitatively that $K\mu$ atoms—also produced through coalescence in the quark--gluon plasma (QGP)—provide a sensitive probe of low-momentum primordial muons and early-time electromagnetic radiation, offering complementary constraints in an otherwise unexplored phase space for thermal dilepton and photon emission. Newly estimated dissociation cross sections in detector material indicate that secondary‑vertex reconstruction should be experimentally feasible, allowing clean experimental identification of the atoms. Projected yields from QGP coalescence in LHC and RHIC heavy-ion collisions, and from $D^{0}$ decays in LHC high-luminosity $p+p$ collisions indicate that the first observation of $K\mu$ atoms is within reach. Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI. Article funded by SCOAP3 and published under licence by Chinese Physical Society and the Institute of High Energy Physics of the Chinese Academy of Science and the Institute of Modern Physics of the Chinese Academy of Sciences and IOP Publishing Ltd.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Discovery and Spectroscopic Characterization of a Distant, Compact Milky Way Satellite in Gemini

We present the discovery of a compact Milky Way satellite in the constellation of Gemini. This system was discovered by cross-matching detections from two independent search algorithms applied to Blanco/DECam data from the third data release of the DECam Local Volume Exploration survey (DELVE DR3), and confirmed with deeper imaging from Gemini/GMOS-N. Based on these data, we determine that the system is an ultra-faint ($M_V = -2.1^{+0.4}_{-0.6}$), compact ($r_{1/2} = 8.6^{+1.4}_{-1.2}$ pc) system located at a heliocentric distance of $120^{+7}_{-6}$ kpc. These physical properties place the system in the regime of ambiguous, ultra-faint compact Milky Way halo satellites that cannot be confidently classified as dwarf galaxies or star clusters from morphology alone; we therefore name the system DELVE 8/Gemini I. From medium-resolution Keck/DEIMOS spectroscopy, we securely identify four members including two blue horizontal branch stars, confirming the system as a bound satellite moving at a mean radial velocity of $v_{\rm hel} = -82.7^{+3.7}_{-3.9} {\rm km\,s}^{-1}$. We also use these spectra to place an upper limit of $\rm [Fe/H] \lesssim -2.5$ on the metallicity of DELVE 8/Gemini I's brightest star, supporting the classification of the system as either an ancient star cluster or ultra-faint dwarf galaxy. The discovery of faint, distant systems similar to DELVE 8/Gemini I is expected to become more common with upcoming surveys.

Overdeck, K. [Chicago U., Astron. Astrophys. Ctr.;↗
DOE OSTI2026

Limiter-aware adaptive excitation control for hydropower generators with legacy voltage regulation systems

Hydropower units often rely on legacy excitation systems with fixed automatic voltage regulator (AVR) settings, but parameter drift, changing operating conditions, and evolving grid-service demands can degrade terminal-voltage regulation over time. This problem should be addressed because poor voltage regulation affects reactive-power support, system stability, and reliable plant operation, and replacing installed AVR and limiter logic is costly and disruptive in practice. To address this issue, this paper proposes a retrofit-friendly enhancement for hydropower generator excitation systems that combines adaptive tuning of the AVR middle lead–lag branch with a small proportional-integral correction for removing steady bias and slow drift. The adaptive laws are normalized, projection-bounded, and equipped with leakage, while adaptation is enabled only in the middle branch. Thus, the intent of the underexcitation and overexcitation limiters, as well as legacy current and rate limits, remains unchanged. Stability is analyzed under incremental performance assumptions, yielding boundedness and asymptotic tracking in the absence of saturation. The method is evaluated using real operational data from a utility-scale hydropower unit at Rocky Reach Dam, Unit C-8. Compared with the fixed AVR baseline, the proposed method reduces terminal-voltage mean squared error by about 70%, removes long periods of steady-state bias, and improves transient tracking while coexisting with limiter actions. These results show that substantial voltage-control improvement can be achieved on existing hydropower units with minimal integration effort and without replacing the installed AVR structure.

ESST5B model↗
NASA NTRS1977

On the error probability of general trellis codes with applications to sequential decoding

An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.

Johannesson, R.↗
NASA NTRS1973

On the error probability of general tree and trellis codes with applications to sequential decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Johannesson, R.↗
DOE OSTI2025

Leptonic probes of alternative left-right symmetric models

We explore constraints on the parameter space of the alternative left-right model originating from the leptonic sector. Our analyses focuses on both lepton-flavor-conserving observables, particularly the anomalous magnetic moment of the muon, and lepton-flavor-violating processes like μ → e γ decay and μ − e conversions in nuclei. While contributions to the anomalous magnetic moment fall below the measured values at 2 σ , current and future experimental sensitivities to flavor-violating branching rations of the Standard Model leptons are expected to impose lower bounds on the mass of the peculiar S U ( 2 ) R gauge boson of the model. This provides complementary constraints relative to existing limits, which are indirect and derived from collider bounds on the mass of the associated neutral gauge boson Z ′ . Published by the American Physical Society 2025

Frank, Mariana (ORCID:0000000322684821)↗
NASA NTRS1994

Atmospheric parameters of field subdwarf B stars

High signal-to-noise ratio optical spectrophotometry of a sample of field subluminous B stars drawn largely from the Palomar Green ultraviolet-excess survey is analyzed with a new grid of model atmospheres and synthetic spectra. The stellar effective temperatures, surface gravities, and photospheric helium abundances are determined simultaneously from a detailed analysis of hydrogen and helium absorption line profiles. The derived temperatures and gravities place the subluminous B stars in the theoroetical Hertzsprung-Russell (H-R) diagram along and bounded below by theoretical sequences of the zero-age extended horizontal branch, lending strong support to the hypothesis that these stars are composed of helium-burning cores of approximately 0.5 solar mass overlain by very thin layers of hydrogen (approximately less than 0.02 solar mass). Various scenarios for their past evolutionary history are examined in the context of their probable future evolution into white dwarfs of lower than average mass.

Saffer, Rex A.↗
DOE OSTI2024

Search for lepton-flavor-violating τ – → μ – μ + μ – decays at Belle II

We present the result of a search for the charged-lepton-flavor violating decay τ – → μ – μ + μ – using a 424 fb –1 sample of data recorded by the Belle II experiment at the SuperKEKB e + e – collider. The selection of e + e – → τ + τ – events is based on an inclusive reconstruction of the non-signal tau decay, and on a boosted decision tree to suppress background. We observe one signal candidate, which is compatible with the expectation from background processes. We set a 90% confidence level upper limit of 1.9 × 10 –8 on the branching fraction of the τ – → μ – μ + μ – decay, which is the most stringent bound to date.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

New bounds on heavy QCD axions from big bang nucleosynthesis

We study big bang nucleosynthesis (BBN) constraints on heavy QCD axions. BBN offers a powerful probe of new physics that modifies the neutron-to-proton ratio during the process, thanks to the precisely measured primordial Helium-4 abundance. A heavy QCD axion provides an attractive target for this probe, because not only is it a well-motivated hypothetical particle by the strong 𝐶⁢𝑃 problem, but also it dominantly decays to hadrons if kinematically allowed. A range of its lifetime is thus excluded where the hadronic decays would significantly alter the neutron-to-proton ratio. We compute axion-induced modification of the neutron-to-proton ratio, and obtain robust upper bounds on the axion lifetimes, as low as 0.017 s for the axion mass higher than 300 MeV. Remarkably, this is stronger than projected future cosmic microwave background bounds via 𝑁 eff . Our bounds are largely insensitive to uncertainties in hadronic cross sections and the axion’s branching fractions into various hadrons, as well as to the precise value of the initial axion abundance. We also incorporate, for the first time, several key improvements, such as scattering processes by energetic 𝐾 𝐿 and secondary hadrons, that can also be important for studying general hadronic injections during BBN, not limited to those from axion decays.

Axions↗
DOE OSTI2025

Search for 𝑃 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 and 𝑃 𝑐$\overline{𝑐}$𝑠 (4338) 0 in ϒ(1𝑆,2𝑆) Inclusive Decays at Belle

Using data samples of 102 million ϒ⁡(1⁢𝑆) events and 158 million ϒ⁡(2⁢𝑆) events collected by the Belle detector at the KEKB asymmetric-energy 𝑒+⁢𝑒− collider, we search for [𝑢⁢𝑑⁢𝑠⁢𝑐$\overline{𝑐}$ ] pentaquark states decaying to 𝐽/𝜓⁢Λ. Using the first observations of ϒ⁡(1⁢𝑆,2⁢𝑆) inclusive decays to 𝐽/𝜓⁢Λ, we find evidence of the 𝑃 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 state with a local significance of 3.3 standard deviations, including statistical and systematic uncertainties. We measure the mass and width of the 𝑃 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 to be (4471.7±4.8±0.6) MeV/𝑐 2 and (22 ±13 ±3) MeV, respectively. The branching fractions for 𝑃 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 production are measured to be ℬ⁡[ϒ⁡(1⁢𝑆)→𝑃 𝑐$\overline{𝑐}$𝑠 ⁢(4459)0/ $\overline{𝑃}$ 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 +anything]=(3.5±2.0±0.2)×10 −6 and ℬ⁡[ϒ⁡(2⁢𝑆)→𝑃 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 /$\overline{𝑃}$ 𝑐$\overline{𝑐}$𝑠 ⁢(4459) 0 +anything]=(2.9±1.7±0.4)×10 −6 . The inclusive branching fractions of ϒ⁡(1⁢𝑆,2⁢𝑆) →𝐽/𝜓⁢Λ/$\overline{Λ}$ are measured to be ℬ⁡[ϒ⁡(1⁢𝑆) →𝐽/𝜓⁢Λ/$\overline{Λ}$ +anything] =(36.9 ±5.3 ±2.4) ×10 −6 and ℬ⁡[ϒ⁡(2⁢𝑆) →𝐽/𝜓⁢Λ/$\overline{Λ}$ +anything] =(22.3 ±5.7 ±3.1) ×10 −6 . We measure the visible cross section 𝜎⁡(𝑒+⁢𝑒−→𝐽/𝜓⁢Λ/ $\overline{Λ}$ +anything)=(90±14±6) fb for the continuum production at √𝑠 =10.52 GeV. In all cases, the first uncertainties are statistical and the second are systematic.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1988

Deexcitation of muonic molecules by internal conversion

Deexcitation rates, lifetimes, and branching ratios are calculated for all the J = 0, J = 1, and J = 2 bound states of the muonic molecular ion td(mu) when it serves as the nucleus of a hydrogen atom. The J = 2 binding energy (E2 = 101.59 eV) is the first reported variational result for this state. It is found that the excited J = 0 state is populated several hundred times as often as the ground state.

Bhatia, A. K.↗
NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗
NASA NTRSDate not supplied

PRECiSA: a static analysis tool for floating-point programs

This presentation introduces PRECiSA, a static analysis framework for analyzing floating-point programs. PRECiSA computes round-off error bounds for a class of floating-point programs, and produces a formal proof certificate of the correctness of these bounds. PRECiSA also has the capability of generating C code which is instrumented to detect unstable branching conditions from a real-number algorithm specification.

Floating-point↗
DOE OSTI2025

Tetraquarks in the Born-Oppenheimer approximation

The conventional loosely bound molecule interpretation of the X(3872) is not compatible with the recent LHCb experimental measurement of the ratio of branching fractions $\mathcal{R}$ = Br(X → ψ′γ)/Br(X → ψγ). We systematically determine the entire tetraquark spectrum for J = 0, 1, 2 and refine the calculation of $\mathcal{R}$ in an improved Born-Oppenheimer description of the X(3872) compact tetraquark. This refinement yields a significantly better agreement with experimental data on $\mathcal{R}$ and on the spectroscopy of the states themselves. Extending the diquark-antidiquark paradigm to encompass tetraquarks that are linear super-positions of open charm singlets and color octets, we discover that these exotic resonances manifest as compact shallow bound states of quarks in color force potentials.

Effective Field Theories of QCD↗