Search NASASearch

SEARCH · Search NASA

Results for “Optimization problem”

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 217 records · Page 12

A piecewise linear approximation scheme for hereditary optimal control problems

An approximation scheme based on 'piecewise linear' approximations of L2 spaces is employed to formulate a numerical method for solving quadratic optimal control problems governed by linear retarded functional differential equations. This piecewise linear method is an extension of the so called averaging technique. It is shown that the Riccati equation for the linear approximation is solved by simple transformation of the averaging solution. Thus, the computational requirements are essentially the same. Numerical results are given.

Cliff, E. M.

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, K.

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, Kazufumi

Finite element solution of optimal control problems with inequality constraints

A finite-element method based on a weak Hamiltonian form of the necessary conditions is summarized for optimal control problems. Very crude shape functions (so simple that element numerical quadrature is not necessary) can be used to develop an efficient procedure for obtaining candidate solutions (i.e., those which satisfy all the necessary conditions) even for highly nonlinear problems. An extension of the formulation allowing for discontinuities in the states and derivatives of the states is given. A theory that includes control inequality constraints is fully developed. An advanced launch vehicle (ALV) model is presented. The model involves staging and control constraints, thus demonstrating the full power of the weak formulation to date. Numerical results are presented along with total elapsed computer time required to obtain the results. The speed and accuracy in obtaining the results make this method a strong candidate for a real-time guidance algorithm.

Bless, Robert R.

A sequential linear optimization approach for controller design

A linear optimization approach with a simple real arithmetic algorithm is presented for reliable controller design and vibration suppression of flexible structures. Using first order sensitivity of the system eigenvalues with respect to the design parameters in conjunction with a continuation procedure, the method converts a nonlinear optimization problem into a maximization problem with linear inequality constraints. The method of linear programming is then applied to solve the converted linear optimization problem. The general efficiency of the linear programming approach allows the method to handle structural optimization problems with a large number of inequality constraints on the design vector. The method is demonstrated using a truss beam finite element model for the optimal sizing and placement of active/passive-structural members for damping augmentation. Results using both the sequential linear optimization approach and nonlinear optimization are presented and compared. The insensitivity to initial conditions of the linear optimization approach is also demonstrated.

Horta, L. G.

Finite element solution of optimal control problems with state-control inequality constraints

It is demonstrated that the weak Hamiltonian finite-element formulation is amenable to the solution of optimal control problems with inequality constraints which are functions of both state and control variables. Difficult problems can be treated on account of the ease with which algebraic equations can be generated before having to specify the problem. These equations yield very accurate solutions. Owing to the sparse structure of the resulting Jacobian, computer solutions can be obtained quickly when the sparsity is exploited.

Bless, Robert R.

Computer program for mass optional solutions of some endpoint trajectory problems

Optimization of trajectories for propellant comsumption is achieved by incorporating a coast arc device into a three-dimensional fixed end-point steepest ascent computer program. It calculates a trajectory between any two points in space defined by initial and final position vectors, without restrictions on thrust or orbit characteristics.

Bennett, A. G.

A Markovian reset problem

Optimal control of systems with time transitions described by finite state stationary Markov chain, noting resetting control

Kolesar, P.

A study of commuter airplane design optimization

Problems of commuter airplane configuration design were studied to affect a minimization of direct operating costs. Factors considered were the minimization of fuselage drag, methods of wing design, and the estimated drag of an airplane submerged in a propellor slipstream; all design criteria were studied under a set of fixed performance, mission, and stability constraints. Configuration design data were assembled for application by a computerized design methodology program similar to the NASA-Ames General Aviation Synthesis Program.

Roskam, J.

Stochastic minibatch approach to the ptychographic iterative engine

The ptychographic iterative engine (PIE) is a widely used algorithm that enables phase retrieval at nanometer-scale resolution over a wide range of imaging experiment configurations. By analyzing diffraction intensities from multiple scanning locations where a probing wavefield interacts with a sample, the algorithm solves a difficult optimization problem with constraints derived from the experimental geometry as well as sample properties. The effectiveness at which this optimization problem is solved is highly dependent on the ordering in which we use the measured diffraction intensities in the algorithm, and random ordering is widely used due to the limited ability to escape from stagnation in poor-quality local solutions. In this study, we introduce an extension to the PIE algorithm that uses ideas popularized in recent machine learning training methods, in this case minibatch stochastic gradient descent. Our results demonstrate that these new techniques significantly improve the convergence properties of the PIE numerical optimization problem.

47 OTHER INSTRUMENTATION

Stress evolution and creep deformation in solid-oxide electrolysis cell systems – Dynamic modeling and multi-objective optimization to maximize stack life and efficiency

Here, this study develops a thermal stress model of solid-oxide electrolysis cells (SOECs) including a model for creep strain and failure probability that is integrated with a dynamic plant-wide model of a hydrogen production process. Uncertainties in key material properties of the cell are quantified to assess their impact on stress profile variability. The oxygen electrode is found to have about 10 times higher failure probability compared to the fuel electrode. The study shows that if the stack operation is not optimized, cycling operation would lead to stress build-up eventually leading to catastrophic failure. A dynamic optimization problem is set up for obtaining the optimal operational profile considering a variable hydrogen production rate. Due to the tradeoff between the efficiency and stress build-up, the dynamic optimization problem is multi-objective. It is observed that the optimizer can considerably reduce the stress build-up (i.e., can increase the stack life) albeit at the cost of a lower efficiency thus exhibiting strong tradeoffs between capital and operating costs. For example, if the stack would be replaced in 0.5 yr, specific energy requirement would be 48.5 kWh/kg H 2 while for a stack replacement time of about 6 yr, the specific energy requirement rises by about 4.2 %.

SOEC

An explicit, energy-conserving particle-in-cell scheme

We present an explicit temporal discretization of particle-in-cell schemes for the non-relativistic Vlasov equation that results in exact energy conservation when combined with an appropriate spatial discretization. The scheme is inspired by a simple, second-order explicit scheme that conserves energy exactly in the Eulerian context. We show that direct translation to particle-in-cell does not result in strict conservation, but derive a simple correction based on an analytically solvable optimization problem that recovers conservation. While this optimization problem is not guaranteed to have a real solution for every particle, we provide a correction that makes imaginary values extremely rare and still admits $\mathcal{O}$(10 –12 ) fractional errors in energy for practical simulation parameters. We present the scheme in both electrostatic – where we use the Ampère formulation – and electromagnetic contexts. With an electromagnetic field solve, the field update is most naturally linearly implicit, but the more computationally intensive particle update remains fully explicit. Here, we also show how the scheme can be extended to use the fully explicit leapfrog and pseudospectral analytic time-domain (PSATD) field solvers. The scheme is tested on standard kinetic plasma problems, confirming its conservation properties.

Energy conservation

Genetic-evolution-based optimization methods for engineering design

This paper presents the applicability of a biological model, based on genetic evolution, for engineering design optimization. Algorithms embodying the ideas of reproduction, crossover, and mutation are developed and applied to solve different types of structural optimization problems. Both continuous and discrete variable optimization problems are solved. A two-bay truss for maximum fundamental frequency is considered to demonstrate the continuous variable case. The selection of locations of actuators in an actively controlled structure, for minimum energy dissipation, is considered to illustrate the discrete variable case.

Rao, S. S.

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery

Using Approximations to Accelerate Engineering Design Optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

Torczon, Virginia

Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

Ono, Masahiro