SEARCH · Search NASA

Results for “Constraints”

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 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2023

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1994

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Constraint Satisfaction Problems CSP constraint pr↗

NASA NTRSDate not supplied

Quantum-accelerated Global Constraint Filtering

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the all different constraint and the global cardinality constraint (gcc). The subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search.

Quantum algorithms↗

DOE OSTI2022

Posterior Regularized Bayesian Neural Network incorporating soft and hard knowledge constraints

Neural Networks (NNs) have been widely used in supervised learning due to their ability to model complex nonlinear patterns, often presented in high-dimensional data such as images and text. However, traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs (BNNS) could help measure the uncertainty by considering the distributions of the NN model parameters. Besides, domain knowledge is commonly available and could improve the performance of BNNs if it can be appropriately incorporated. In this work, we propose a novel Posterior-Regularized Bayesian Neural Network (PR-BNN) model by incorporating different types of knowledge constraints, such as the soft and hard constraints, as a posterior regularization term. Furthermore, we propose to combine the augmented Lagrangian method and the existing BNN solvers for efficient inference. Furthermore, the experiments in simulation and two case studies about aviation landing prediction and solar energy output prediction have shown the knowledge constraints and the performance improvement of the proposed model over traditional BNNs without the constraints.

14 SOLAR ENERGY↗

DOE OSTI2023

Quantum Annealing with Inequality Constraints: The Set Cover Problem

Abstract Quantum annealing is a promising method for solving hard optimization problems by transforming them into quadratic unconstrained binary optimization (QUBO) problems. However, when constraints are involved, particularly multiple inequality constraints, incorporating them into the objective function poses challenges. In this paper, the authors present two novel approaches for solving problems with multiple inequality constraints on a quantum annealer and apply them to the set cover problem (SCP). The first approach uses the augmented Lagrangian method to represent the constraints, while the second approach employs a higher‐order binary optimization (HUBO) formulation. The experiments show that both approaches outperform the standard approach for solving the SCP on the D‐Wave Advantage quantum annealer. The HUBO formulation performs slightly better than the augmented Lagrangian method in solving the SCP, but its scalability in terms of embeddability in the quantum chip is worse. The results demonstrate that the proposed augmented Lagrangian and HUBO methods can successfully implement a large number of inequality constraints, making them applicable to a broad range of constrained problems beyond the SCP.

Djidjev, Hristo N.↗

DOE OSTI2023

Improving constraints on models addressing the Hubble tension with CMB delensing

The Hubble Tension is a well-known issue in modern cosmology that refers to the apparent disagreement in inferences of the Hubble constant H 0 as found through low-redshift observations and those derived from the ΛCDM model utilizing early universe observations. Several extensions to ΛCDM have been proposed to address the Hubble Tension that involve new ingredients or dynamics in the early universe. Reversing the effects of gravitational lensing on cosmic microwave background (CMB) maps produces sharper acoustic peaks in power spectra and allows for tighter constraints on cosmological parameters. We investigate the efficacy of CMB delensing for improving the constraints on parameters used in extensions of the ΛCDM model that are aimed at resolving the Hubble Tension (such as varying fundamental constants, contributions from early dark energy, and self-interacting dark radiation). We use Fisher forecasting to predict the expected constraints with and without this delensing procedure. We demonstrate that CMB delensing improves constraints on H 0 by ~ 20% for viable models and significantly improves constraints on parameters across the board in the low-noise regime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Non-Gaussianity constraints with anisotropic μ distortion measurements from Planck

ABSTRACT Primordial non-Gaussianity can source μ-distortion anisotropies that are correlated with the large-scale temperature and polarization signals of the cosmic microwave background (CMB). A measurement of μT and μE correlations can therefore be used to constrain it on wavelengths of perturbations not directly probed by the standard CMB anisotropies. We carry out a first rigorous search for μ-distortion anisotropies with Planck data, applying the well-tested constrained ILC component-separation method combined with the needlet framework. We correlate the reconstructed μ map with the CMB anisotropies to derive constraints on the amplitude fNL of the local form bispectrum, specifically on the squeezed configurations with effective wavenumbers $k_s \simeq {740}\, \mathrm{Mpc^{-1}}$ and $k_L \simeq {0.05}\, \mathrm{Mpc^{-1}}$, improving previously estimated constraints by more than an order of magnitude. This enhancement is owing to the fact that we are able to use the full multipole information by carefully controlling biases and systematic effects in the analysis. We also for the first time incorporate constraints from measurements of μE correlations, which further tighten the limits. A combination of the derived Planck μT and μE power spectra yields |fNL| ≲ 6800 (95 per cent c.l.) on this highly squeezed bispectrum. This is only ≃3 times weaker than the anticipated constraint from Litebird. Furthermore we show that a combination of Litebird with Planck can improve the expected future constraint by ${\simeq}20{{\%}}$. These limits can be used to constrain multifield inflation models and primordial black hole formation scenarios, thus providing a promising novel avenue forward in CMB cosmology.

Rotti, Aditya (ORCID:0000000341245226)↗

DOE OSTI2025

The Dark Energy Camera All Data Everywhere cosmic shear project V: Constraints on cosmology and astrophysics from 270 million galaxies across 13,000 deg$^2$ of the sky

We present constraints on models of cosmology and astrophysics using cosmic shear data vectors from three datasets: the northern and southern Galactic cap of the Dark Energy Camera All Data Everywhere (DECADE) project, and the Dark Energy Survey (DES) Year 3. These data vectors combined consist of 270 million galaxies spread across 13,000 ${\rm deg}^2$ of the sky. We first extract constraints for $Λ$CDM cosmology and find $S_8= 0.805^{+0.019}_{-0.019}$ and $Ω_{\rm m} = 0.262^{+0.023}_{-0.036}$, which is consistent within $1.9 σ$ of constraints from the Planck satellite. Extending our analysis to dynamical dark energy models shows that lensing provides some (but still minor) improvements to existing constraints from supernovae and baryon acoustic oscillations. Finally, we study six different models for the impact of baryons on the matter power spectrum. We show the different models provide consistent constraints on baryon suppression, and associated cosmology, once the astrophysical priors are sufficiently wide. Current scale-cut approaches for mitigating baryon contamination result in a residual bias of $\approx 0.3σ$ in the $S_8, Ω_{\rm m}$ posterior. Using all scales with dedicated baryon modeling leads to negligible improvement as the new information is used solely to self-calibrate the baryon model on small scales. Additional non-lensing datasets, and/or calibrations of the baryon model, will be required to access the full statistical power of the lensing measurements. The combined dataset in this work represents the largest lensing dataset to date (most galaxies, largest area) and provides an apt testing ground for analyses of upcoming datasets from Stage IV surveys. The DECADE shear catalogs, data vectors, and likelihoods are made publicly available.

Anbajagane, D. [Chicago U., Astron. Astrophys. Ctr↗

DOE OSTI2023

Efficient Integration of Algebraic Constraint for Exponential Time Integration

This work is a continuation of a previous project where the high efficiency of exponential integration methods for DRMHD systems was demonstrated. Often algebraic constraints must also be enforced for DRMHD systems of interest. Straightforward application of exponential methods to DRMHD equations with constraints leads to prohibitively computationally expensive methods. In this work, we propose new exponential schemes that allow the constraints to be removed from evaluation of exponential matrix functions which drastically reduces computational complexity by eliminating the need to perform computations enforcing constraints in exponential calculations while still preserving a high order of accuracy and allowing for a large time step even when the problem is stiff. This idea is similar to the W-methods and is achieved by carefully designing a method with the desired order of accuracy, even with an incomplete Jacobian matrix used as an argument of exponential-like functions. The constraints are accounted for by including them in the evaluation of the right-hand-side forcing function of the spatially discretized system. We study performance of the new methods on test problems and outline future research directions that this work opens.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

First Constraints on Growth Rate from Redshift-space Ellipticity Correlations of SDSS Galaxies at 0.16 < z < 0.70

We report the first constraints on the growth rate of the universe, f(z)σ 8 (z), with intrinsic alignments (IAs) of galaxies. We measure the galaxy density-intrinsic ellipticity cross-correlation and intrinsic ellipticity autocorrelation functions over 0.16 < z < 0.7 from luminous red galaxies (LRGs) and LOWZ and CMASS galaxy samples in the Sloan Digital Sky Survey (SDSS) and SDSS-III BOSS survey. We detect clear anisotropic signals of IA due to redshift-space distortions. By combining measured IA statistics with the conventional galaxy clustering statistics, we obtain tighter constraints on the growth rate. The improvement is particularly prominent for the LRG, which is the brightest galaxy sample and known to be strongly aligned with underlying dark matter distribution; using the measurements on scales above 10 h -1 Mpc, we obtain $f{\sigma }_{8}={0.5196}_{-0.0354}^{+0.0352}$ (68% confidence level) from the clustering-only analysis and $f{\sigma }_{8}={0.5322}_{-0.0291}^{+0.0293}$ with clustering and IA, meaning 19% improvement. The constraint is in good agreement with the prediction of general relativity, f σ 8 = 0.4937 at z = 0.34. For LOWZ and CMASS samples, the improvement of constraints on f σ 8 is found to be 10% and 3.5%, respectively. Our results indicate that the contribution from IA statistics for cosmological constraints can be further enhanced by carefully selecting galaxies for a shape sample.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1974

Optimal control problems with mixed control-phase variable equality and inequality constraints

In this paper, necessary conditions are obtained for optimal control problems containing equality constraints defined in terms of functions of the control and phase variables. The control system is assumed to be characterized by an ordinary differential equation, and more conventional constraints, including phase inequality constraints, are also assumed to be present. Because the first-mentioned equality constraint must be satisfied for all t (the independent variable of the differential equation) belonging to an arbitrary (prescribed) measurable set, this problem gives rise to infinite-dimensional equality constraints. To obtain the necessary conditions, which are in the form of a maximum principle, an implicit-function-type theorem in Banach spaces is derived.

Makowski, K.↗

NASA NTRS1988

Minimum weight design of rectangular and tapered helicopter rotor blades with frequency constraints

The minimum weight design of a helicopter rotor blade subject to constraints on coupled flap-lag natural frequencies has been studied. A constraint has also been imposed on the minimum value of the autorotational inertia of the blade in order to ensure that it has sufficient inertia to autorotate in the case of engine failure. The program CAMRAD is used for the blade modal analysis and CONMIN is used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for both rectangular and tapered blades. Design variables include taper ratio, segment weights, and box beam dimensions. It is shown that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for both rectangular and tapered blades.

Chattopadhyay, Aditi↗

NASA NTRS1988

Minimum weight design of rectangular and tapered helicopter rotor blades with frequency constraints

The minimum weight design of a helicopter rotor blade subject to constraints on coupled flap-lag natural frequencies has been studied. A constraint has also been imposed on the minimum value of the autorotational inertia of the blade in order to ensure that it has sufficient inertia to aurorotate in the case of engine failure. The program CAMRAD is used for the blade modal analysis and CONMIN is used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for both rectangular and tapered blades. Design variables include taper ratio, segment weights, and box beam dimensions. It is shown that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for both rectangular and tapered blades.

Chattopadhyay, Aditi↗

NASA NTRS1989

Minimum weight design of helicopter rotor blades with frequency constraints

The minimum weight design of helicopter rotor blades subject to constraints on fundamental coupled flap-lag natural frequencies has been studied in this paper. A constraint has also been imposed on the minimum value of the blade autorotational inertia to ensure that the blade has sufficient inertia to autorotate in case of an engine failure. The program CAMRAD has been used for the blade modal analysis and the program CONMIN has been used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for blades in vacuum with both rectangular and tapered box beam structures. Design variables include taper ratio, nonstructural segment weights and box beam dimensions. The paper shows that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for blades with rectangular and tapered box beams.

Chattopadhyay, Aditi↗

NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗

NASA NTRS1991

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

Smith, Stephen F.↗

NASA NTRS1993

Three-dimensional elastic-plastic finite-element analyses of constraint variations in cracked bodies

Three-dimensional elastic-plastic (small-strain) finite-element analyses were used to study the stresses, deformations, and constraint variations around a straight-through crack in finite-thickness plates for an elastic-perfectly plastic material under monotonic and cyclic loading. Middle-crack tension specimens were analyzed for thicknesses ranging from 1.25 to 20 mm with various crack lengths. Three local constraint parameters, related to the normal, tangential, and hydrostatic stresses, showed similar variations along the crack front for a given thickness and applied stress level. Numerical analyses indicated that cyclic stress history and crack growth reduced the local constraint parameters in the interior of a plate, especially at high applied stress levels. A global constraint factor alpha(sub g) was defined to simulate three-dimensional effects in two-dimensional crack analyses. The global constraint factor was calculated as an average through-the-thickness value over the crack-front plastic region. Values of alpha(sub g) were found to be nearly independent of crack length and were related to the stress-intensity factor for a given thickness.

Newman, J. C., Jr.↗

NASA NTRS1992

Motion planning of mobile multi-limb robotic systems subject to force and friction constraints

A method is presented to generate motions for a class of multilimb robotic systems enabling them to apply large static forces over large ranges of motion without saturating actuator effort limits, system-environment friction constraints, kinematic joint limits, or geometric workspace obstacles. The approach, termed the force-workspace (FW) approach, maps these constraints into the system C-space to form constraint obstacles using a recursive subdivision process. To generate motions along which actuator efforts can be specified without violating system constraints, paths are planned that avoid these constraint obstacles. The method permits the shape of the paths to be controlled using any configuration-dependent performance criterion. The FW approach was applied to a proposed three-limb planar climbing robot whose task is to climb upwards between two vertical walls by pushing outwards to generate frictional support. Motions were planned automatically within the system FW, enabling it to lift itself upwards using two limbs at a time, and a gait was planned to enable it to switch limbs and climb continuously.

Madhani, Akhil↗