Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Slack variable”

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.

Bayesian Optimization Under Mixed Constraints with A Slack-Variable Augmented Lagrangian

An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usually solved with local solvers. Recently, surrogate-based Bayesian optimization (BO) sub-solvers have been successfully deployed in the AL framework for a more global search in the presence of inequality constraints; however, a drawback was that expected improvement (EI) evaluations relied on Monte Carlo. Here we introduce an alternative slack variable AL, and show that in this formulation the EI may be evaluated with library routines. The slack variables furthermore facilitate equality as well as inequality constraints, and mixtures thereof. We show our new slack “ALBO” compares favorably to the original. Its superiority over conventional alternatives is reinforced on several mixed constraint examples.

Picheny, Victor↗

Mixture Experiment Alternatives to the Slack Variable Approach

A mixture experiment involves mixing two or more components in various proportions and measuring one or more response variables on each mixture. This article presents mixture-experiment approaches for designing experiments and/or modeling the resulting data in situations where the slack-variable (SV) approach has been used. With the SV approach, one mixture component is designated the SV and the experiment is designed and/or the data are analyzed in terms of the remaining components. In a SV design, the proportion of the SV is obtained by subtracting from one the sum of the proportions of the remaining components, thus "taking up the slack". With the mixture-experiment approach, the experiment is designed and the data are analyzed using all of the mixture components. The article considers four situations in which the SV approach has been used, and explains for each situation that it is generally preferable to use an appropriate mixture-experiment approach. For each situation, the recommended mixture-experiment approach is discussed and compared to the SV approach using an example.

97 MATHEMATICS AND COMPUTING↗

Comparison of Slack Variable and Mixture Experiment Approaches

In a mixture experiment, the response variable depends on the proportions of the components, which must sum to one. Because of this constraint, standard polynomial models cannot be used to analyze mixture experiment data. To get around this, some researchers ignore one of the components and use standard polynomial models in the remaining components. Because the component proportions must sum to one, the ignored component (referred to as the slack variable (SV)) makes up the remaining proportion of the mixture. In the literature, there have been many examples of researchers using the SV approach instead of a mixture approach. We have analyzed data from several of these examples using both approaches. For examples whose goal was to screen the mixture components (screening examples), we fit full linear models and identified which components were important using both approaches. In the screening examples, the mixture approach revealed that the SV had a significant effect on the response. For examples that had sufficient data to fit quadratic models to the data (quadratic examples), we used stepwise regression to develop reduced quadratic models for the SV approach, and partial quadratic mixture (PQM) models for the mixture approach. In three quadratic examples, the PQM models identified the SV and/or one of its quadratic blending terms as having a significant effect on the response variable. Hence, by completely ignoring a component’s effect on the response, SV analysis carries an inherent risk of wrong conclusions. There are fewer possible reduced quadratic SV models than possible PQM models because the reduced quadratic SV models are a subset of the class of PQM models. As a result, the PQM models will always fit the data as well as, or better than, the best reduced quadratic SV model. Our research concludes that it is better to analyze mixture experiments using methods specifically developed for them instead of using standard methods with the SV approach.

97 MATHEMATICS AND COMPUTING↗

Mixture Experiments

A mixture experiment involves combining two or more components in various proportions or amounts and then measuring one or more responses for the resulting end products. Other factors that affect the response(s), such as process variables and/or the total amount of the mixture, may also be studied in the experiment. A mixture experiment design specifies the combinations of mixture components and other experimental factors (if any) to be studied and the response variable(s) to be measured. Mixture experiment data analyses are then used to achieve the desired goals, which may include (i) understanding the effects of components and other factors on the response(s), (ii) identifying components and other factors with significant and nonsignificant effects on the response(s), (iii) developing models for predicting the response(s) as functions of the mixture components and any other factors, and (iv) developing end-products with desired values and uncertainties of the response(s). Given a mixture experiment problem, a practitioner must consider the possible approaches for designing the experiment and analyzing the data, and then select the approach best suited to the problem. Eight possible approaches include 1) component proportions, 2) mathematically independent variables, 3) slack variable, 4) mixture amount, 5) component amounts, 6) mixture process variable, 7) mixture of mixtures, and 8) multi-factor mixture. The article provides an overview of the mixture experiment designs, models, and data analyses for these approaches.

Component amounts↗

Semidefinite programming algorithm for the quantum mechanical bootstrap

Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

97 MATHEMATICS AND COMPUTING↗

An Algorithm for Constructing and Searching Spaces of Alternative Hypotheses

In this paper, we develop techniques for automated hypothesis-space exploration over data sets that may contain contradictions. To do so, we make use of the equivalence between two formulations: those of first-order predicate logic with prefix modal quantifiers under the finite-model hypothesis and those of mixed-integer linear programming (MILP) problems. Unlike other approaches, we do not assume that all logical assertions are true without doubt. Instead, we look for alternative hypotheses about the validity of the claims by identifying alternative optimal solutions to a corresponding MILP. We use a collection of slack variables in the derived linear constraints to indicate the presence of contradictory data or assumptions. The objective is to minimize contradictions between data and assertions represented by the presence of nonzero slack in the set of linear constraints. In this paper, we present the following: 1) a correspondence between first-order predicate logic with modal quantifier prefixes under the finite-model hypothesis and MILP problems and 2) an implicit enumeration algorithm for exploring the contradiction hypothesis space.

99 GENERAL AND MISCELLANEOUS↗

An Algorithm for Constructing and Searching Spaces of Alternative Hypotheses

In this paper we develop techniques for automated hypothesis generation over data sets that maycontain contradictions. To do so, we make use of the equivalence between two formulations: those offirst order predicate logic with prefix modal quantifiers under the finite model hypothesis and those ofMixed Integer Linear Programming (MILP) problems. The equivalence between integer programming and logical satisfiability has been known since Karp'sseminal work in NP-completeness. Other authors have made use of this equivalence to explore efficientmethods of solving the satisfiability problem in the propositional calculus for specific problem types.The work presented here differentiates itself from previous work in that we do not assume that alllogical assertions are true without doubt. Instead we look for alternative hypotheses about the validityof the claims by identifying alternative optimal solutions to a corresponding MILP. We use a collectionof slack variables in the derived linear constraints to indicate the presence of contradictory data orassumptions. The objective is to minimize contradictions between data and assertions represented bythe presence of non-zero slack in the set of linear constraints.

99 GENERAL AND MISCELLANEOUS↗

SU-F-T-340: Direct Editing of Dose Volume Histograms: Algorithms and a Unified Convex Formulation for Treatment Planning with Dose Constraints

Purpose: To develop a procedure for including dose constraints in convex programming-based approaches to treatment planning, and to support dynamic modification of such constraints during planning. Methods: We present a mathematical approach that allows mean dose, maximum dose, minimum dose and dose volume (i.e., percentile) constraints to be appended to any convex formulation of an inverse planning problem. The first three constraint types are convex and readily incorporated. Dose volume constraints are not convex, however, so we introduce a convex restriction that is related to CVaR-based approaches previously proposed in the literature. To compensate for the conservatism of this restriction, we propose a new two-pass algorithm that solves the restricted problem on a first pass and uses this solution to form exact constraints on a second pass. In another variant, we introduce slack variables for each dose constraint to prevent the problem from becoming infeasible when the user specifies an incompatible set of constraints. We implement the proposed methods in Python using the convex programming package cvxpy in conjunction with the open source convex solvers SCS and ECOS. Results: We show, for several cases taken from the clinic, that our proposed method meets specified constraints (often with margin) when they are feasible. Constraints are met exactly when we use the two-pass method, and infeasible constraints are replaced with the nearest feasible constraint when slacks are used. Finally, we introduce ConRad, a Python-embedded free software package for convex radiation therapy planning. ConRad implements the methods described above and offers a simple interface for specifying prescriptions and dose constraints. Conclusion: This work demonstrates the feasibility of using modifiable dose constraints in a convex formulation, making it practical to guide the treatment planning process with interactively specified dose constraints. This work was supported by the Stanford BioX Graduate Fellowship and NIH Grant 5R01CA176553.

60 APPLIED LIFE SCIENCES↗

Leveraging Inequality-Constrained Data for Enhanced Liquidus Temperature Prediction in Nuclear Waste Glass Melts

Inequality-constrained data are frequently discarded in engineering, leading to significant information loss in data-scarce domains like glass characterization in nuclear waste vitrification. This paper presents a nonparametric censored-data regression framework based on an l1-norm optimization criterion that leverages slack variables to integrate left-, right-, and interval-constrained observations into training without distributional assumptions. Validated on synthetic data and a Physics-Informed Neural Network (PINN) for predicting liquidus temperature (TL), the method improved R2 from 0.60 to 0.89 and reduced Mean Absolute Error (MAE) by 48% (51.46 to 26.89?rC) on deterministic values. The traditional models failed to satisfy any inequality constraints while the proposed l1-norm PINN satisfies 81.25% of the constraints. The proposed framework effectively extracts actionable information from previously unusable data to enhance predictive accuracy, reduce epistemic uncertainty, and ensure physical consistency in complex industrial applications.

Garcia-Morado, Erick↗

Quantifying Turbulence for Tidal Power Applications

Using newly collected data from a tidal power site in Puget Sound, WA, metrics for turbulence quantification are assessed and discussed. The quality of raw ping Acoustic Doppler Current Profiler (ADCP) data for turbulence studies is evaluated against Acoustic Doppler Velocimeter (ADV) data at a point. Removal of Doppler noise from the raw ping data is shown to be a crucial step in turbulence quantification. Excluding periods of slack tide, the turbulent intensity estimates at a height of 4.6 m above the seabed are 8% and 11% from the ADCP and ADV, respectively. Estimates of the turbulent dissipation rate are more variable, from 10e-3 to 10e-1 W/m^3. An example analysis of coherent Turbulent Kinetic Energy (TKE) is presented.

16 TIDAL AND WAVE POWER↗

Monitoring the Urban Heat Island Effect and the Efficacy of Future Countermeasures

To relate fine-scale spatial air-temperature variations in local urban heat islands and urban cool islands—increases and decreases in outside air temperature—within a large urban-climate archipelago to variations in land-use and land-cover properties in the Los Angeles Basin, the research team sought to (a) use fine-resolution meso-urban climate models to identify areas of urban heat and cool islands, select sites for fixed weather monitoring, and choose routes for mobile observations; (b) relate observed intraurban temperature variations to land use and land cover and surface physical properties; and (c) calibrate/validate the climate models. The research team assessed urban temperature variations via simulations and observations, including mobile transects, mesonet, dense networks of personal weather stations, and sparse but more accurate research-grade monitors. To identify the causative factors of the urban heat and cool islands at the neighborhood scale, the research team collected detailed urban morphometric and land use and land cover datasets, such as 1-meter (3.3 foot) resolution roof albedo (solar reflectance) and tree canopy cover. The research team used the observationvalidated model to finalize the transect routes and site the stationary monitors. This study provides the first observational evidence from analysis of high-spatial-density weather stations that increases in roof albedo at neighborhood scale are associated with reductions in near-surface air temperature. This finding was corroborated with the analysis from mobile transect measurements and correlation of observed air temperature with neighborhood-scale albedo and vegetation. This correlation revealed a cooling effect from areawide increase in albedo or canopy cover or both. The calibrated meteorological model accurately identified the localized urban heat and cool islands observed in this study. Interested stakeholders/researchers can use the same models and calibration/validation methodology to characterize within-city microclimate variations elsewhere in California, and can apply them to analyze the benefits from using urban heat island countermeasures. This project report is an extended and more detailed version of a related report prepared for California’s Fourth Climate Change Assessment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Multi-scale temporal patterns in fish presence in a high-velocity tidal channel

The natural variation of fish presence in high-velocity tidal channels is not well understood. A better understanding of fish use of these areas would aid in predicting fish interactions with marine hydrokinetic (MHK) devices, the effects of which are uncertain but of high concern. To characterize the patterns in fish presence at a tidal energy site in Cobscook Bay, Maine, we examined two years of hydroacoustic data continuously collected at the proposed depth of an MHK turbine with a bottom-mounted, side-looking echosounder. The maximum number of fish counted per hour ranged from hundreds in the early spring to over 1,000 in the fall. Counts varied greatly with tidal and diel cycles in a seasonally changing relationship, likely linked to the seasonally changing fish community of the bay. In the winter and spring, higher hourly counts were generally confined to ebb tides and low slack tides near sunrise and sunset. In summer and fall of each year, the highest fish counts shifted to night and occurred during ebb, low slack, and flood tides. Fish counts were not linked to current speed, and did not decrease as current speed increased, contrary to observations at other tidal power sites. As fish counts may be proportional to the encounter rate of fish with an MHK turbine at the same depth, highly variable counts indicate that the risk to fish is similarly variable. The links between fish presence and environmental cycles at this site will likely be present at other locations with similar environmental forcing, making these observations useful in predicting potential fish interactions at tidal energy sites worldwide.

54 ENVIRONMENTAL SCIENCES↗

Quantification of Margins and Uncertainty for Multicomponent Systems

This report describes and illustrates several metrics for application to the analysis of a multicomponent system. Specifically, three metrics are calculated for each system component. The first metric is component failure probability (π). This will typically be expressed as the probability that a component performance variable (P) exceeds a specified or random threshold (T). The margin (M) for component performance is defined as M = P - T and will be the focus of analysis throughout this report. The second metric is referred to as margin to failure rate φ (MTF φ ). This is an estimate of the allowable “slack” in component performance that could be tolerated to modify its failure rate from π to a user-specified value φ. The third and final metric is margin sensitivity (MS). This quantity orders components based on the degree to which changes in their failure rates are affected by shifts in their margin distributions. We first motivate the metrics in an idealized setting, and then expand to the typical application scenarios where they must be estimated from experimental or simulated data. In this environment, we discuss methods for estimating the metrics with uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗