Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear programming 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 577 records · Page 32

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

TAP 1: A Finite Element Program for Steady-State Thermal Analysis of Convectively Cooled Structures

The program has a finite element library of six elements: two conduction/convection elements to model heat transfer in a solid, two convection elements to model heat transfer in a fluid, and two integrated conduction/convection elements to represent combined heat transfer in tubular and plate/fin fluid passages. Nonlinear thermal analysis due to temperature dependent thermal parameters is performed using the Newton-Raphson iteration method. Program output includes nodal temperatures and element heat fluxes. Pressure drops in fluid passages may be computed as an option. A companion plotting program for displaying the finite element model and predicted temperature distributions is presented. User instructions and sample problems are presented in appendixes.

Thornton, E. A.↗

Development of a moderately sized finite element program for nonlinear structural analysis

AGGIE 1 is a computer program for predicting the linear and nonlinear, static and dynamic structural response of two- and three-dimensional continuum solids. The program is based on isoparametric finite elements and allows for 2-D plane stress, plane strain, and axisymmetric analyses and general 3-D analyses. Large strain kinematics is based on the total Lagrangian formulation. Materially nonlinear models include several elastic-plastic work-hardening models as well as an incompressible Mooney-Rivlin model. Included in this report is a brief description of the theoretical bases of the program, the material models used, the element library and the overall program organization. Instructions for data input preparation are given in detail. Several sample problems are given along with the required program input and program generated solutions.

Haisler, W. E.↗

Design challenges encountered in the F-15 PCA flight test program

The NASA Dryden Flight Research Center conducted flight tests of a propulsion-controlled aircraft system on an F-15 airplane. This system was designed to explore the feasibility of providing safe emergency landing capability using only the engines to provide flight control in the event of a catastrophic loss of conventional flight controls. Control laws were designed to control the flight path and bank angle using only commands to the throttles. While the program was highly successful, this paper concentrates on the challenges encountered using engine thrust as the only control effector. Compared to conventional flight control surfaces, the engines are slow, nonlinear, and have limited control effectiveness. This increases the vulnerability of the system to outside disturbances and changes in aerodynamic conditions. As a result, the PCA system had problems with gust rejection. Cross coupling of the longitudinal and lateral axis also occured, primarily as a result of control saturation. The normally negligible effects of inlet airframe interactions became significant with the engines as the control effector. Flight and simulation data are used to illustrate these difficulties.

Maine, Trindel A.↗

Calculation of shocked one-dimensional flows on abruptly changing grids by mathematical programming

Cell-centered finite differences on cells of an arbitrarily spaced grid are presently used to discretize the steady-state inviscid and nearly inviscid Burgers' equations for steady-state shocked flow in a quasi-one-dimensional nozzle. The everdetermined system of nonlinear algebraic equations thus obtained is solved by a procedure which minimizes a weighted sum of the residuals' absolute values. Numerical solutions for both viscous and inviscid problems are accurate and nonoscillatory, on grids whose abrupt mesh lengths refinements are as great as a factor of 10,000.

Lavery, John E.↗

CICART Center For Integrated Computation And Analysis Of Reconnection And Turbulence

CICART is a partnership between the University of New Hampshire (UNH) and Dartmouth College. CICART addresses two important science needs of the DoE: the basic understanding of magnetic reconnection and turbulence that strongly impacts the performance of fusion plasmas, and the development of new mathematical and computational tools that enable the modeling and control of these phenomena. The principal participants of CICART constitute an interdisciplinary group, drawn from the communities of applied mathematics, astrophysics, computational physics, fluid dynamics, and fusion physics. It is a main premise of CICART that fundamental aspects of magnetic reconnection and turbulence in fusion devices, smaller-scale laboratory experiments, and space and astrophysical plasmas can be viewed from a common perspective, and that progress in understanding in any of these interconnected fields is likely to lead to progress in others. The establishment of CICART has strongly impacted the education and research mission of a new Program in Integrated Applied Mathematics in the College of Engineering and Applied Sciences at UNH by enabling the recruitment of a tenure-track faculty member, supported equally by UNH and CICART, and the establishment of an IBM-UNH Computing Alliance. The proposed areas of research in magnetic reconnection and turbulence in astrophysical, space, and laboratory plasmas include the following topics: (A) Reconnection and secondary instabilities in large high-Lundquist-number plasmas, (B) Particle acceleration in the presence of multiple magnetic islands, (C) Gyrokinetic reconnection: comparison with fluid and particle-in-cell models, (D) Imbalanced turbulence, (E) Ion heating, and (F) Turbulence in laboratory (including fusion-relevant) experiments. These theoretical studies make active use of three high-performance computer simulation codes: (1) The Magnetic Reconnection Code, based on extended two-fluid (or Hall MHD) equations, in an Adaptive Mesh Refinement (AMR) framework, (2) the Particle Simulation Code, a fully electromagnetic 3D Particle-In-Cell (PIC) code that includes a collision operator, and (3) GS2, an Eulerian, electromagnetic, kinetic code that is widely used in the fusion program, and simulates the nonlinear gyrokinetic equations, together with a self-consistent set of Maxwell’s equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Global trajectory targeting via computer graphics

A technique is described in which the two-point boundary value problem (TPBVP) may be solved with the aid of interactive computer graphics. The particular TPBVP considered is the optimal electric propulsion space trajectory problem. An appropriate two-dimensional projection of the TPBVP mapping, or trajectory, is displayed on the computer's television screen, and a man-in-the-loop varies selected trajectory starting conditions in the fashion of a nonlinear walk until the viewed trajectory endpoint lies near a displayed target. Once global targeting is accomplished in this manner, program internal logic can easily handle local targeting to strongly solve the TPBVP.

Mann, F. I.↗

Ozone profiling from backscattered UV radiance measurements A new procedure

This paper presents a data analysis technique that has been developed to support a stratospheric ozone measurement and profiling program. The data consist of solar backscattered UV radiation monitored by a spacecraft. The output consists of ozone mixing ratio profiles complete with error bars throughout the atmosphere. The technique is based upon principles of nonlinear optimal estimation. It provides a number of desirable features that have not been available together in any previously constructed technique for the problem. Iteration on both radiation measurements and total ozone measurements is among these features.

Whitney, C. K.↗

Application of decomposition techniques to the preliminary design of a transport aircraft

A multifaceted decomposition of a nonlinear constrained optimization problem describing the preliminary design process for a transport aircraft has been made. Flight dynamics, flexible aircraft loads and deformations, and preliminary structural design subproblems appear prominently in the decomposition. The use of design process decomposition for scheduling design projects, a new system integration approach to configuration control, and the application of object-centered programming to a new generation of design tools are discussed.

Rogan, J. E.↗

Convexity property of the one-sided multivariable stability margin

In evaluating the stability robustness of multivariable control systems having one-sided parameter uncertainty, a problem that naturally arises is the minimization over diagonal matrices D of the greatest eigenvalue of (e sup D Ae sup -D + (e sup D Ae sup -D)*)/2. The minimization is proved to be convex, thus guaranteeing that every local minimum is also a global minimum and, in theory, guaranteeing the global convergence of generalized gradient nonlinear programming algorithms for computing the minimizing D.

Tekawy, Jonathan A.↗

Next-generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience

This report summarizes the work performed under the project project Next-Generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for infrastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years of Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasible region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality constraints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.

97 MATHEMATICS AND COMPUTING↗

Solution of steady-state, two-dimensional conservation laws by mathematical programming

A truly two-dimensional algorithm is created for solving the steady-state two-dimensional conservation-law problem. An overdetermined system of algebraic equations is obtained through discretization by finite-volume formulas. These equations are perturbed nonsingularly and are solved by an efficient geometrically oriented l(1) procedure. The basic algorithm and the theory for the linear case f(u) = u are presented, and computational results for the nonlinear case f(u) = sq u are also analyzed. It is noted that the l(1) procedure captures boundary shocks as well as oblige and zigzag interior shocks in bands that are one cell wide, and the solution values are accurate up to the edge of the shock.

Lavery, John E.↗

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

STARS: An Integrated, Multidisciplinary, Finite-Element, Structural, Fluids, Aeroelastic, and Aeroservoelastic Analysis Computer Program

A multidisciplinary, finite element-based, highly graphics-oriented, linear and nonlinear analysis capability that includes such disciplines as structures, heat transfer, linear aerodynamics, computational fluid dynamics, and controls engineering has been achieved by integrating several new modules in the original STARS (STructural Analysis RoutineS) computer program. Each individual analysis module is general-purpose in nature and is effectively integrated to yield aeroelastic and aeroservoelastic solutions of complex engineering problems. Examples of advanced NASA Dryden Flight Research Center projects analyzed by the code in recent years include the X-29A, F-18 High Alpha Research Vehicle/Thrust Vectoring Control System, B-52/Pegasus Generic Hypersonics, National AeroSpace Plane (NASP), SR-71/Hypersonic Launch Vehicle, and High Speed Civil Transport (HSCT) projects. Extensive graphics capabilities exist for convenient model development and postprocessing of analysis results. The program is written in modular form in standard FORTRAN language to run on a variety of computers, such as the IBM RISC/6000, SGI, DEC, Cray, and personal computer; associated graphics codes use OpenGL and IBM/graPHIGS language for color depiction. This program is available from COSMIC, the NASA agency for distribution of computer programs.

Gupta, K. K.↗

Semidefinite programming algorithm for the quantum mechanical bootstrap

Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

97 MATHEMATICS AND COMPUTING↗

Iterative explicit guidance for low thrust spacecraft.

A retargeting procedure is developed for use as a nonlinear low thrust guidance scheme. The selection of a control program composed of a sequence of inertially fixed thrust-acceleration vectors permits all trajectory computations to be made with closed form expressions, and allows the controls to be represented by constant parameters, thrust-acceleration vectors and thrusting times. By requiring each trajectory to be time optimal, the guidance problem is transformed into a parameter optimization problem which is solved by the conjugate gradient method. The scheme is applied to a low thrust capture mission, and the results of computer simulations are presented.

Jacobson, R. A.↗

Multiplexed Predictive Control of a Large Commercial Turbofan Engine

Model predictive control is a strategy well-suited to handle the highly complex, nonlinear, uncertain, and constrained dynamics involved in aircraft engine control problems. However, it has thus far been infeasible to implement model predictive control in engine control applications, because of the combination of model complexity and the time allotted for the control update calculation. In this paper, a multiplexed implementation is proposed that dramatically reduces the computational burden of the quadratic programming optimization that must be solved online as part of the model-predictive-control algorithm. Actuator updates are calculated sequentially and cyclically in a multiplexed implementation, as opposed to the simultaneous optimization taking place in conventional model predictive control. Theoretical aspects are discussed based on a nominal model, and actual computational savings are demonstrated using a realistic commercial engine model.

Richter, hanz↗

Performance Analysis and Design Synthesis (PADS) computer program. Volume 2: Program description, part 2

The QL module of the Performance Analysis and Design Synthesis (PADS) computer program is described. Execution of this module is initiated when and if subroutine PADSI calls subroutine GROPE. Subroutine GROPE controls the high level logical flow of the QL module. The purpose of the module is to determine a trajectory that satisfies the necessary variational conditions for optimal performance. The module achieves this by solving a nonlinear multi-point boundary value problem. The numerical method employed is described. It is an iterative technique that converges quadratically when it does converge. The three basic steps of the module are: (1) initialization, (2) iteration, and (3) culmination. For Volume 1 see N73-13199.

Source record↗