Search NASA⌕ Search

SEARCH · Search NASA

Results for “quadratically constrained quadratic programs”

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.

80 records · Page 5

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer

Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a minimum-energy state of the quantum system. While many NP-hard problems can be easily formulated as binary quadratic optimization problems, such formulations almost always contain one or more constraints, which are not allowed in a QUBO. Embedding such constraints as quadratic penalties is the standard approach for addressing this issue, but it has drawbacks such as the introduction of large coefficients and using too many additional qubits. In this paper, we propose an alternative approach for implementing constraints based on a combinatorial design and solving mixed-integer linear programming (MILP) problems in order to find better embeddings of constraints of the type Σ x i = k for binary variables x i . Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.

97 MATHEMATICS AND COMPUTING↗

3-D Deep Penetration Neutron Imaging of Thick Absorgin and Diffusive Objects Using Transport Theory

A current area of research interest in national security is to effectively and efficiently determine the contents of the many shipping containers that enter ports in the United States. This interest comes as a result of the 9/11 Commission Act passed by Congress in 2007 that requires 100% of inbound cargo to be scanned by 2012. It appears that this requirement will be achieved by 2012, but as of February of 2009 eighty percent of the 11.5 million inbound cargo containers were being scanned. The systems used today in all major U.S. ports to determine the presence of radioactive material within cargo containers are Radiation Portal Monitors (RPM). These devices generally exist in the form of a gate or series of gates that the containers can be driven through and scanned. The monitors are effective for determining the presence of radiation, but offer little more information about the particular source. This simple pass-fail system leads to many false alarms as many everyday items emit radiation including smoke detectors due to the Americium-241 source contained inside, bananas, milk, cocoa powder and lean beef due to the trace amounts of Potassium-40, and fire brick and kitty litter due to their high clay content which often contains traces of uranium and thorium. In addition, if an illuminating source is imposed on the boundary of the container, the contents of the container may become activated. These materials include steel, aluminum and many agricultural products. Current portal monitors also have not proven to be that effective at identifying natural or highly enriched uranium (HEU). In fact, the best available Advanced Spectroscopic Portal Monitors (ASP) are only capable of identifying bare HEU 70-88% of the time and masked HEU and depleted uranium (DU) only 53 percent of the time. Therefore, a better algorithm that uses more information collected from better detectors about the specific material distribution within the container is desired. The work reported here explores the inverse problem of optical tomography applied to heterogeneous domains. The neutral particle transport equation was used as the forward model for how neutral particles stream through and interact within these heterogeneous domains. A constrained optimization technique that uses Newtons method served as the basis of the inverse problem. Optical tomography aims at reconstructing the material properties using (a) illuminating sources and (b) detector readings. However, accurate simulations for radiation transport require that the particle (gamma and/or neutron) energy be appropriate discretize in the multigroup approximation. This, in turns, yields optical tomography problems where the number of unknowns grows (1) about quadratically with respect to the number of energy groups, G, (notably to reconstruct the scattering matrix) and (2) linearly with respect to the number of unknown material regions. As pointed out, a promising approach could rely on algorithms to appropriately select a material type per material zone rather than G2 values. This approach, though promising, still requires further investigation: (a) when switching from cross-section values unknowns to material type indices (discrete integer unknowns), integer programming techniques are needed since derivative information is no longer available; and (b) the issue of selecting the initial material zoning remains. The work reported here proposes an approach to solve the latter item, whereby a material zoning is proposed using one-group or few-groups transport approximations. The capabilities and limitations of the presented method were explored; they are briefly summarized next and later described in fuller details in the Appendices. The major factors that influenced the ability of the optimization method to reconstruct the cross sections of these domains included the locations of the sources used to illuminate the domains, the number of separate experiments used in the reconstruction, the locations where measurements were collected, the optical thickness of the domain, the amount of signal noise and signal bias applied to the measurements and the initial guess for the cross section distribution. All of these factors were explored for problems with and without scattering. Increasing the number of source and measurement locations and experiments generally was more successful at reconstructing optically thicker domains while producing less error in the image. The maximum optical thickness that could be reconstructed with this method was ten mean free paths for pure absorber and two mean free paths for scattering problems. Applying signal noise and signal bias to the measured fluxes produced more error in the produced image. Generally, Newtons method was more successful at reconstructing domains from an initial guess for the cross sections that was greater in magnitude than their true values than from an initial guess that was lower in magnitude.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Development of improved space sampling strategies for ocean chemical properties: Total carbon dioxide and dissolved nitrate

Large-scale ocean observing programs such as the Joint Global Ocean Flux Study (JGOFS) and the World Ocean Circulation Experiment (WOCE) today, must face the problem of designing an adequate sampling strategy. For ocean chemical variables, the goals and observing technologies are quite different from ocean physical variables (temperature, salinity, pressure). We have recently acquired data on the ocean CO2 properties on WOCE cruises P16c and P17c that are sufficiently dense to test for sampling redundancy. We use linear and quadratic interpolation methods on the sampled field to investigate what is the minimum number of samples required to define the deep ocean total inorganic carbon (TCO2) field within the limits of experimental accuracy (+/- 4 micromol/kg). Within the limits of current measurements, these lines were oversampled in the deep ocean. Should the precision of the measurement be improved, then a denser sampling pattern may be desirable in the future. This approach rationalizes the efficient use of resources for field work and for estimating gridded (TCO2) fields needed to constrain geochemical models.

Goyet, Catherine↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

Group-equivariant autoencoder for identifying spontaneously broken symmetries

We introduce the group-equivariant autoencoder (GE autoencoder), a deep neural network (DNN) method that locates phase boundaries by determining which symmetries of the Hamiltonian have spontaneously broken at each temperature. We use group theory to deduce which symmetries of the system remain intact in all phases, and then use this information to constrain the parameters of the GE autoencoder such that the encoder learns an order parameter invariant to these “never-broken” symmetries. This procedure produces a dramatic reduction in the number of free parameters such that the GE-autoencoder size is independent of the system size. We include symmetry regularization terms in the loss function of the GE autoencoder so that the learned order parameter is also equivariant to the remaining symmetries of the system. By examining the group representation by which the learned order parameter transforms, we are then able to extract information about the associated spontaneous symmetry breaking. We test the GE autoencoder on the 2D classical ferromagnetic and antiferromagnetic Ising models, finding that the GE autoencoder (1) accurately determines which symmetries have spontaneously broken at each temperature; (2) estimates the critical temperature in the thermodynamic limit with greater accuracy, robustness, and time efficiency than a symmetry-agnostic baseline autoencoder; and (3) detects the presence of an external symmetry-breaking magnetic field with greater sensitivity than the baseline method. Lastly, we describe various key implementation details, including a quadratic-programming-based method for extracting the critical temperature estimate from trained autoencoders and calculations of the DNN initialization and learning rate settings required for fair model comparisons.

42 ENGINEERING↗

Closed Loop Control Compact Exercise Device for Use on MPCV

Long duration space travel to Mars or to an asteroid will expose astronauts to extended periods of reduced gravity. To combat spaceflight physiological deconditioning, astronauts will use resistive and aerobic exercise regimens for the duration of the space flight to minimize the loss of bone density, muscle mass and aerobic capacity that occurs during exposure to a reduced gravity environment. Unlike the International Space Station (ISS), the mass and volume available for an exercise device in the next generation of spacecraft is limited. Therefore, compact exercise device prototypes are being developed for human in the loop evaluations. The NASA Human Research Program (HRP) is managing Advanced Exercise Concepts (AEC) requirements development and candidate technology maturation for all exploration mission profiles from Multi-Purpose Crew Vehicle (MPCV) exploration missions (e.g., EM-2, up to 21 day) to Mars Transit (up to 1000 day) missions. Numerous technologies have been considered and evaluated against HRP-approved functional requirements and include flywheel, pneumatic and closed-loop microprocessor-controlled motor driven power plants. Motor driven technologies offer excellent torque density and load accuracy characteristics as well as the ability to create custom mechanical impedance (the dynamic relationship between force and velocity) and custom load versus position exercise algorithms. Further, closed-loop motor-driven technologies offer the ability to monitor exercise dose parameters and adapt to the needs of the crewmember for real time optimization of exercise prescriptions. A simple proportional-integral-derivative (PID) controller is demonstrated in a prototype motor driven exercise device with comparison to resistive static and dynamic load set points and aerobic work rate targets. The resistive load term in the algorithm includes a constant force component (Fcmg) as well as inertial component (Fima) and a discussion of system tuning is presented in terms of addressing key functional requirements and human interfaces. The device aerobic modality is modelled as a rowing exercise using ground data sets obtained from Concept 2 rowers as well as competitive rowing1. A discussion of software and electronic implementations are presented which demonstrate unique approaches to meeting the constrained mass, volume and power requirements of the MPCV. . In addition to utilizing traditional PID control, controllers utilizing state feedback with gains solved using a Linear Quadratic Regulator will be developed. Controllability and observability will be utilized to investigate the need for state measurement in the design. As the control system directly interacts with human test subjects, robust methods such as H-infinity are also being investigated.1. Kleshnev V. Biomechanics. In: Rowing, Handbook of Sports Medicine and Science. ed. by Secher N., Voliantis S. IOC Medical Commission, Blackwell Pub. pp. 22-34, 2007

microgravity↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗