Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrete 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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Computational methods for optimal linear-quadratic compensators for infinite dimensional discrete-time systems

An abstract approximation theory and computational methods are developed for the determination of optimal linear-quadratic feedback control, observers and compensators for infinite dimensional discrete-time systems. Particular attention is paid to systems whose open-loop dynamics are described by semigroups of operators on Hilbert spaces. The approach taken is based on the finite dimensional approximation of the infinite dimensional operator Riccati equations which characterize the optimal feedback control and observer gains. Theoretical convergence results are presented and discussed. Numerical results for an example involving a heat equation with boundary control are presented and used to demonstrate the feasibility of the method.

Gibson, J. S.↗
NASA NTRS2006

A Convex Guidance Algorithm for Formation Reconfiguration

In this paper, a reconfiguration guidance algorithm for formation flying spacecraft is presented. The formation reconfiguration guidance problem is first formulated as a continuous-time minimum-fuel or minimum-energy optimal control problem with collision avoidance and control constraints. The optimal control problem is then discretized to obtain a finite dimensional parameter optimization problem. In this formulation, the collision avoidance constraints are imposed via separating planes between each pair of spacecraft. A heuristic is introduced to choose these separating planes that leads to the convexification of the collision avoidance constraints. Additionally, convex constraints are imposed to guarantee that no collisions occur between discrete time samples. The resulting finite dimensional optimization problem is a second order cone program, for which standard algorithms can compute the global optimum with deterministic convergence and a prescribed level of accuracy. Consequently, the formation reconfiguration algorithm can be implemented onboard a spacecraft for real-time operations.

formation reconfiguration↗
DOE OSTI2026

Multipoint Aerostructural Optimization of Wind Turbine Rotors Using a Coupled Blade‐Resolved Aerostructural Solver

Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high‐fidelity studies with simplified structural models, leaving the most complex design trade‐offs unexplored. We close this gap by performing the first tightly coupled gradient‐based multipoint aerostructural rotor optimization using 3D aerodynamic and structural solvers with discrete coupled adjoints. The optimizer simultaneously varies blade planform, airfoil shapes, and structural thickness through more than 270 design variables, minimizing a weighted combination of rotor mass and power across multiple wind speeds. Applied to a modified DTU 10‐MW benchmark under conservative structural and aerodynamic constraints, our multipoint optimization reduces rotor mass by up to 36% and increases power by 12%–15% across the main operating conditions; biasing the objective toward power yields power gains up to 18% and a 17% mass reduction. For a nominal wind distribution, 3‐point rotor designs accounting for low RPM and high thrust conditions capture dominant trade‐offs and outperform single‐point designs. Adding two off‐design points changes individual‐condition power by less than 3% but leaves the weighted average within 0.5%, and the mass‐power bias has a stronger effect on the final design than the operating‐point weighting itself. Our framework extends naturally to richer load cases and site‐specific wind distributions, providing a basis for high‐fidelity multipoint design earlier in industrial workflows.

17 WIND ENERGY↗
NASA NTRS1978

Design of a compensation for an ARMA model of a discrete time system

The design of an optimal dynamic compensator for a multivariable discrete time system is studied. Also the design of compensators to achieve minimum variance control strategies for single input single output systems is analyzed. In the first problem the initial conditions of the plant are random variables with known first and second order moments, and the cost is the expected value of the standard cost, quadratic in the states and controls. The compensator is based on the minimum order Luenberger observer and it is found optimally by minimizing a performance index. Necessary and sufficient conditions for optimality of the compensator are derived. The second problem is solved in three different ways; two of them working directly in the frequency domain and one working in the time domain. The first and second order moments of the initial conditions are irrelevant to the solution. Necessary and sufficient conditions are derived for the compensator to minimize the variance of the output.

Mainemer, C. I.↗
NASA NTRS2000

Reliability Constrained Priority Load Shedding for Aerospace Power System Automation

The need for improving load shedding on board the space station is one of the goals of aerospace power system automation. To accelerate the optimum load-shedding functions, several constraints must be involved. These constraints include congestion margin determined by weighted probability contingency, component/system reliability index, generation rescheduling. The impact of different faults and indices for computing reliability were defined before optimization. The optimum load schedule is done based on priority, value and location of loads. An optimization strategy capable of handling discrete decision making, such as Everett optimization, is proposed. We extended Everett method to handle expected congestion margin and reliability index as constraints. To make it effective for real time load dispatch process, a rule-based scheme is presented in the optimization method. It assists in selecting which feeder load to be shed, the location of the load, the value, priority of the load and cost benefit analysis of the load profile is included in the scheme. The scheme is tested using a benchmark NASA system consisting of generators, loads and network.

Momoh, James A.↗
DOE OSTI2024

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Further discrete variable results for a panel flutter optimization problem

Numerical solutions are presented for the problem of minimum weight design of a thin one-dimensional, simply supported, solid panel in compression, with one side exposed to a parallel high supersonic air flow. The flutter speed is held fixed and a minimum thickness constraint is imposed.

Pierson, B. L.↗
NASA NTRS1997

Improving Discrete-Sensitivity-Based Approach for Practical Design Optimization

In developing the automated methodologies for simulation-based optimal shape designs, their accuracy, efficiency and practicality are the defining factors to their success. To that end, four recent improvements to the building blocks of such a methodology, intended for more practical design optimization, have been reported. First, in addition to a polynomial-based parameterization, a partial differential equation (PDE) based parameterization was shown to be a practical tool for a number of reasons. Second, an alternative has been incorporated to one of the tedious phases of developing such a methodology, namely, the automatic differentiation of the computer code for the flow analysis in order to generate the sensitivities. Third, by extending the methodology for the thin-layer Navier-Stokes (TLNS) based flow simulations, the more accurate flow physics was made available. However, the computer storage requirement for a shape optimization of a practical configuration with the -fidelity simulations (TLNS and dense-grid based simulations), required substantial computational resources. Therefore, the final improvement reported herein responded to this point by including the alternating-direct-implicit (ADI) based system solver as an alternative to the preconditioned biconjugate (PbCG) and other direct solvers.

Baysal, Oktay↗
DOE OSTI2026

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

Development of a Multiobjective Optimization Procedure for Sonic Boom Minimization

A design optimization procedure for improved sonic boom and aerodynamic performance of high speed aircraft is presented. The multiobjective optimization procedure simultaneously minimizes the sonic boom at a given distance from the aircraft and the drag-to-lift ratio (C(sub D)/C(sub L)) Of the aircraft. Upper and lower bounds are also imposed on the lift coefficient. The Kreisselmeier - Steinhauser function is used for the multiobjective optimization formulation. A discrete semi-analytical aerodynamic sensitivity analysis procedure coupled with an analytical grid sensitivity analysis technique is used for evaluating design sensitivities. The use of the semi-analytical sensitivity analysis techniques results in significant computational savings. The flow equations are solved using a three-dimensional parabolized Navier-Stokes solver. Sonic boom analysis is performed using an extrapolation procedure. A nonlinear programming technique and an approximate analysis procedure are used for the optimization. The optimization procedure developed is applied to the design of two high speed configurations, namely, a doubly swept wing-body configuration and a delta wing-body configuration. For the two sweep case only, minimization of the first peak in the pressure signature is performed first by optimizing only the nose radius and length of the aircraft. Minimization of the second peak in the pressure signature is performed next by optimizing only the wing geometric parameters. Significant improvements are obtained in the sonic boom characteristics and the aerodynamic performance of the wing-body configurations.

Narayan, J. R.↗
NASA NTRS1993

Optimization of composite laminates

Design of composite structures can be viewed as a multi-faceted task, one which requires integration of issues related to composite mechanics, structural analysis, optimization, and manufacturing. The major coverage of the paper is on the issue of optimization, with special emphasis on the use of optimization for designing with discrete and integer valued variables required for the stacking-sequence optimization. Different techniques that can be used for stacking sequence optimization are introduced, and different aspects of their application are demonstrated for laminate buckling optimization.

Gurdal, Zafer↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
NASA NTRS1989

Optimal error analysis of spectral methods with emphasis on non-constant coefficients and deformed geometries

The numerical analysis of spectral methods when non-constant coefficients appear in the equation, either due to the original statement of the equations or to take into account the deformed geometry, is presented. Particular attention is devoted to the optimality of the discretization even for low values of the discretization parameter. The effect of some overintegration is also addressed, in order to possibly improve the accuracy of the discretization.

Maday, Yvon↗
NASA NTRS1997

Application of PML Absorbing Boundary Conditions to the Benchmark Problems of Computational Aeroacoustics

Accurate numerical non-reflecting boundary conditions are important in all the proposed benchmark problems of the Second Workshop. Recently, a new absorbing boundary condition has been developed using Perfectly Matched Layer (PML) equations for the Euler equations. In this approach, a region with a width of a few grid points is introduced adjacent to the non-reflecting boundaries. In the added region, Perfectly Matched Layer equations are constructed and applied so that the out-going waves are absorbed inside the layer with little reflection to the interior domain. It will be demonstrated in the present paper that the proposed absorbing boundary condition is quite general and versatile, applicable to radiation boundaries as well as inflow and outflow boundaries. It is also easy to implement. The emphasis of the paper will be on the application of the PML absorbing boundary condition to problems in Categories 1, 2, and 3. In Category 1, solutions of problems 1 and 2 are presented. Both problems are solved using a multi-domain polar grid system. Perfectly Matched Layer equations for a circular boundary are constructed and their effectiveness assessed. In Category 2, solutions of problem 2 are presented. Here, in addition to the radiation boundary conditions at the far field in the axisymmetric coordinate system, the inflow boundary condition at the duct inlet is also dealt with using the proposed Perfectly Match Layer equations. At the inlet, a PML domain is introduced in which the incident duct mode is simulated while the waves reflected from the open end of the duct are absorbed at the same time. In Category 3, solutions of all three problems are presented. Again, the PML absorbing boundary condition is used at the inflow boundary so that the incoming vorticity wave is simulated while the outgoing acoustic waves are absorbed with very little numerical reflection. All the problems are solved using central difference schemes for spatial discretizations and the optimized Low-Dissipation and Low-Dispersion Runge-Kutta scheme for the time integration. Issues of numerical accuracy and efficiency are also addressed.

Hu, Fang Q.↗