Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear Optimization”

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 1,549 records · Page 86
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

An improved representation of the relationship between photosynthesis and stomatal conductance leads to more stable estimation of conductance parameters and improves the goodness-of-fit across diverse data sets

Stomata play a central role in surface-atmosphere exchange by controlling the flux of water and CO 2 between the leaf and the atmosphere. Representation of stomatal conductance (g sw ) is therefore an essential component of models that seek to simulate water and CO 2 exchange in plants and ecosystems. For given environmental conditions at the leaf surface (CO 2 concentration and vapor pressure deficit or relative humidity), models typically assume a linear relationship between g sw and photosynthetic CO 2 assimilation (A). However, measurement of leaf-level g sw response curves to changes in A are rare, particularly in the tropics, resulting in only limited data to evaluate this key assumption. Here, we measured the response of g sw and A to irradiance in six tropical species at different leaf phenological stages. We showed that the relationship between g sw and A was not linear, challenging the key assumption upon which optimality theory is based-that the marginal cost of water gain is constant. Our data showed that increasing A resulted in a small increase in g sw at low irradiance, but a much larger increase at high irradiance. We reformulated the popular Unified Stomatal Optimization (USO) model to account for this phenomenon and to enable consistent estimation of the key conductance parameters g 0 and g 1 . Our modification of the USO model improved the goodness-of-fit and reduced bias, enabling robust estimation of conductance parameters at any irradiance. In addition, our modification revealed previously undetectable relationships between the stomatal slope parameter g 1 and other leaf traits. We also observed nonlinear behavior between A and g sw in independent datasets that included data collected from attached and detached leaves, and from plants grown at elevated CO 2 concentration. We propose that this empirical modification of the USO model can improve the measurement of g sw parameters and the estimation of plant and ecosystem-scale water and CO 2 fluxes.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Topology Optimization for Nonlinear Transient Applications Using a Minimally Invasive Approach (LDRD Final Report)

The purpose of this project was to devise, implement, and demonstrate a method that can use Sandia's existing analysis codes (e.g., Sierra, Alegra, the CTH hydro code) with minimal modification to generate objective function gradients for optimization-based design in transient, non-linear, coupled-physics applications. The approach uses a Moving Least Squares representation of the geometry to substantially reduce the number of geometric degrees of freedom. A Multiple-Program Multiple-Data computing model is then used to compute objective gradients via finite differencing. Details of the formulation and implementation are provided, and example applications are presented that show effectiveness and scalability of the approach.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multi-scale, Multi-disciplinary, and Multi-agent Explainable AI with Koopman-Undergirded Learning, Prediction, and Analysis (M3EA KULPA) (Project Closeout Report)

The goal of this project was to develop and use domain-aware machine learning formulations, based on the Koopman Operator (KO), for modelling multi-scale, multi-disciplinary (e.g., multi-physics), and/or multi-agent systems. The project developed these formulations for the following cases: • Systems with dynamics at two separate time scales, • Systems with a bi-level hierarchical control structure, • Systems with bi-level hierarchical control and dynamics at two separate time scales (the lower level controls operating at the faster time scale), and • Systems with n separate but interacting agents/disciplines (with/without control, respectively); the controls for each agent could include bi-level hierarchical control and dynamics at two separate time scales as described above. The project then defined a set of dynamical systems consisting of different nonlinear oscillators that could be used to test these different formulations and then subsequently learned the KO models for those systems. With the KO models, we were able to do the following: • Quantify system stability, including both long-term and transient behavior, • Quantify the effects of feedbacks between the different time scales and agents/disciplines in terms of those feedbacks’ effects on system stability, • Replace a standard Proportional-Integral (PI) control in the hierarchical control structure with a KO-based Linear-Quadratic Regular (LQR), a form of optimal control, • Calculate optimal supervisory control policies a) with and without time scale separated dynamics at the lower level control levels and b) with both PI and KO-based LQR lower level control policies, and • Calculate dynamic Nash equilibria for multi-agent systems where each agent makes its own control decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A new passivity-based nonlinear causal control technique for wave energy converters with finite stroke

A new technique is proposed for the design of nonlinear causal feedback controllers for wave energy converters, which explicitly protect against stroke saturation. Here, the technique is an improvement of a technique originally proposed. The primary challenge associated with the problem is the design of nonlinear controllers for which global closed-loop stability can be assured with probability 1 for stationary stochastic response, without also unduly sacrificing power generation performance. The proposed technique consists of three steps: 1) designing a linear feedback controller using multi-objective optimization techniques; 2) augmenting this design with an extra input channel that adheres to a closed-loop passivity condition; and 3) designing an outer, nonlinear passive feedback loop that controls this augmented input in such a way as to ensure stroke limits are maintained. The primary contribution of this paper is a fundamental improvement to the second of these steps, for which the previous technique was not guaranteed to return a valid solution. The proposed technique, by contrast, is shown to always produce a nonlinear controller with the desired properties, under very general modeling assumptions. The technique is illustrated on a simple heaving-buoy wave energy converter example.

16 TIDAL AND WAVE POWER↗
NASA NTRS1964

Linear digital control.

Linear discrete of digital controller design for optimal regulation of feedback control systems

OPTIMAL CONTROL↗
NASA NTRS1972

Optimal inputs for system identification

Identification criteria are presented for linear dynamic systems with and without process noise. With process noise, the state equations are replaced by the Kalman filter equations. If the identification performance index is expanded in a Taylor's series with respect to the parameters to be identified, then maximizing the weighting factor of the quadratic term with respect to the inputs will insure that an identification algorithm will converge more rapidly and to a more accurate result than with nonoptimal inputs. The expectation of this weighting factor is the Fisher information matrix, and its inverse is a lower bound for the covariance of the parameters. Direct and indirect methods of calculating the information matrix are presented for systems with and without process noise.

Reid, D. B.↗
NASA NTRS1973

Application of modern control theory to the design of optimum aircraft controllers

A procedure is described for synthesis of optimal aircraft control systems by application of the concepts of optimal control theory to time-invariant linear systems with quadratic performance criteria. Essential in this synthesis procedure is the solution of the Riccati matrix equation which results in a constant linear feedback control law for an output regulator which maintains a plant in an equilibrium in the presence of impulse disturbances. An algorithm is derived for designing maneuverable output regulators with selected state variables for feedback.

Power, L. J.↗
NASA NTRS1974

Optimal control theory investigation of proprotor/wing response to vertical gust

Optimal control theory is used to design linear state variable feedback to improve the dynamic characteristics of a rotor and cantilever wing representing the tilting proprotor aircraft in cruise flight. The response to a vertical gust and system damping are used as criteria for the open and closed loop performance. The improvement in the dynamic characteristics achievable is examined for a gimballed rotor and for a hingeless rotor design. Several features of the design process are examined, including: (1) using only the wing or only the rotor dynamics in the control system design; (2) the use of a wing flap as well as the rotor controls for inputs; (3) and the performance of the system designed for one velocity at other forward speeds.

Frick, J. K. D.↗
NASA NTRS1983

Programming the gradient projection algorithm

The gradient projection method of numerical optimization which is applied to problems having linear constraints but nonlinear objective functions is described and analyzed. The algorithm is found to be efficient and thorough for small systems, but requires the addition of auxiliary methods and programming for large scale systems with severe nonlinearities. In order to verify the theoretical results a digital computer is used to simulate the algorithm.

Hargrove, A.↗
NASA NTRS1987

Issues in modeling and controlling the SCOLE configuration

The parametric study of the in-plane Spacecraft Control Laboratory Experiment (SCOLE) system, the Floquet Stability Analysis, and three dimensional formulations of the SCOLE system dynamics are examined. Control issues are discussed, such as: control of large structures with delayed input in continuous time; control with delayed input in discrete time; control law design for SCOLE using Linear Quadratic Gaussian (LQC)/TRR technique; and optimal torque control for SCOLE slewing maneuvers.

Bainum, Peter M.↗
NASA NTRS1991

Neighboring extremal guidance for systems with a piecewise linear control

The neighboring extremal feedback control law is developed for systems with a piecewise linear control for the case where the optimal control is obtained by nonlinear programming techniques. To develop the control perturbation for a given deviation from the nominal path, the second variation is minimized subject to the constraint that the final conditions be satisfied. This process leads to a feedback relationship between the control perturbation and the measured deviation from the nominal state. A simple example, the lunar launch problem, is used to demonstrate the validity of the guidance law. For model errors on the order of 5 percent, the results indicate that 5 percent errors occur in the final conditions.

Hull, David G.↗