Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical 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

Neural Network and Regression Approximations in High Speed Civil Transport Aircraft Design Optimization

Nonlinear mathematical-programming-based design optimization can be an elegant method. However, the calculations required to generate the merit function, constraints, and their gradients, which are frequently required, can make the process computational intensive. The computational burden can be greatly reduced by using approximating analyzers derived from an original analyzer utilizing neural networks and linear regression methods. The experience gained from using both of these approximation methods in the design optimization of a high speed civil transport aircraft is the subject of this paper. The Langley Research Center's Flight Optimization System was selected for the aircraft analysis. This software was exercised to generate a set of training data with which a neural network and a regression method were trained, thereby producing the two approximating analyzers. The derived analyzers were coupled to the Lewis Research Center's CometBoards test bed to provide the optimization capability. With the combined software, both approximation methods were examined for use in aircraft design optimization, and both performed satisfactorily. The CPU time for solution of the problem, which had been measured in hours, was reduced to minutes with the neural network approximation and to seconds with the regression method. Instability encountered in the aircraft analysis software at certain design points was also eliminated. On the other hand, there were costs and difficulties associated with training the approximating analyzers. The CPU time required to generate the input-output pairs and to train the approximating analyzers was seven times that required for solution of the problem.

Patniak, Surya N.↗

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗

Implementation of efficient sensitivity analysis for optimization of large structures

The paper presents the theoretical bases and implementation techniques of sensitivity analyses for efficient structural optimization of large structures, based on finite element static and dynamic analysis methods. The sensitivity analyses have been implemented in conjunction with two methods for optimization, namely, the Mathematical Programming and Optimality Criteria methods. The paper discusses the implementation of the sensitivity analysis method into our in-house software package, AutoDesign.

Umaretiya, J. R.↗

Excursion-Set-Mediated Genetic Algorithm

Excursion-set-mediated genetic algorithm (ESMGA) is embodiment of method of searching for and optimizing computerized mathematical models. Incorporates powerful search and optimization techniques based on concepts analogous to natural selection and laws of genetics. In comparison with other genetic algorithms, this one achieves stronger condition for implicit parallelism. Includes three stages of operations in each cycle, analogous to biological generation.

Noever, David↗

Dose optimization of an adjuvanted peptide-based personalized neoantigen melanoma vaccine

The advancements in next-generation sequencing have made it possible to effectively detect somatic mutations, which has led to the development of personalized neoantigen cancer vaccines that are tailored to the unique variants found in a patient’s cancer. These vaccines can provide significant clinical benefit by leveraging the patient’s immune response to eliminate malignant cells. However, determining the optimal vaccine dose for each patient is a challenge due to the heterogeneity of tumors. To address this challenge, we formulate a mathematical dose optimization problem based on a previous mathematical model that encompasses the immune response cascade produced by the vaccine in a patient. We propose an optimization approach to identify the optimal personalized vaccine doses, considering a fixed vaccination schedule, while simultaneously minimizing the overall number of tumor and activated T cells. To validate our approach, we perform in silico experiments on six real-world clinical trial patients with advanced melanoma. We compare the results of applying an optimal vaccine dose to those of a suboptimal dose (the dose used in the clinical trial and its deviations). Our simulations reveal that an optimal vaccine regimen of higher initial doses and lower final doses may lead to a reduction in tumor size for certain patients. Our mathematical dose optimization offers a promising approach to determining an optimal vaccine dose for each patient and improving clinical outcomes.

59 BASIC BIOLOGICAL SCIENCES↗

The ADS general-purpose optimization program

The mathematical statement of the general nonlinear optimization problem is given as follows: find the vector of design variables, X, that will minimize f(X) subject to G sub J (x) + or - 0 j=1,m H sub K hk(X) = 0 k=1,l X Lower I approx less than X sub I approx. less than X U over I i = 1,N. The vector of design variables, X, includes all those variables which may be changed by the ADS program in order to arrive at the optimum design. The objective function F(X) to be minimized may be weight, cost or some other performance measure. If the objective is to be maximized, this is accomplished by minimizing -F(X). The inequality constraints include limits on stress, deformation, aeroelastic response or controllability, as examples, and may be nonlinear implicit functions of the design variables, X. The equality constraints h sub k(X) represent conditions that must be satisfied precisely for the design to be acceptable. Equality constraints are not fully operational in version 1.0 of the ADS program, although they are available in the Augmented Lagrange Multiplier method. The side constraints given by the last equation are used to directly limit the region of search for the optimum. The ADS program will never consider a design which is not within these limits.

Vanderplaats, G. N.↗

Final Technical Report for "Applied Mathematics Research: Simulation Based Optimization and Application to Electromagnetic Inverse Problems"

The focus of research was: Developing adaptive mesh for the solution of Maxwell's equations; Developing a parallel framework for time dependent inverse Maxwell's equations; Developing multilevel methods for optimization problems with inequality constraints; A new inversion code for inverse Maxwell's equations in the 0th frequency (DC resistivity); A new inversion code for inverse Maxwell's equations in low frequency regime. Although the research concentrated on electromagnetic forward and in- verse problems the results of the research was applied to the problem of image registration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A mathematical model platform for optimizing a multiprojection breast imaging system

Multiprojection imaging is a technique in which a plurality of digital radiographic images of the same patient are acquired within a short interval of time from slightly different angles. Information from each image is combined to determine the final diagnosis. Projection data are either reconstructed into slices as in the case of tomosynthesis or analyzed directly as in the case of multiprojection correlation imaging technique, thereby avoiding reconstruction artifacts. In this study, the authors investigated the optimum geometry of acquisitions of a multiprojection breast correlation imaging system in terms of the number of projections and their total angular span that yield maximum performance in a task that models clinical decision. Twenty-five angular projections of each breast from 82 human subjects in our breast tomosynthesis database were each supplemented with a simulated 3 mm mass. An approach based on Laguerre-Gauss channelized Hotelling observer was developed to assess the detectability of the mass in terms of receiver operating characteristic (ROC) curves. Two methodologies were developed to integrate results from individual projections into one combined ROC curve as the overall figure of merit. To optimize the acquisition geometry, different components of acquisitions were changed to investigate which one of the many possible configurations maximized the area under the combined ROC curve. Optimization was investigated under two acquisition dose conditions corresponding to a fixed total dose delivered to the patient and a variable dose condition, based on the number of projections used. In either case, the detectability was dependent on the number of projections used, the total angular span of those projections, and the acquisition dose level. In the first case, the detectability approximately followed a bell curve as a function of the number of projections with the maximum between 8 and 16 projections spanning angular arcs of about 23 deg. - 45 deg., respectively. In the second case, the detectability increased with the number of projections approaching an asymptote at 11-17 projections for an angular span of about 45 deg. These results indicate the inherent information content of the multiprojection image data reflecting the relative role of quantum and anatomical noise in multiprojection breast imaging. The optimization scheme presented here may be applied to any multiprojection imaging modalities and may be extended by including reconstruction in the case of digital breast tomosynthesis and breast computed tomography.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Generalized mathematical models in design optimization

The theory of optimality conditions of extremal problems can be extended to problems continuously deformed by an input vector. The connection between the sensitivity, well-posedness, stability and approximation of optimization problems is steadily emerging. The authors believe that the important realization here is that the underlying basis of all such work is still the study of point-to-set maps and of small perturbations, yet what has been identified previously as being just related to solution procedures is now being extended to study modeling itself in its own right. Many important studies related to the theoretical issues of parametric programming and large deformation in nonlinear programming have been reported in the last few years, and the challenge now seems to be in devising effective computational tools for solving these generalized design optimization models.

Papalambros, Panos Y.↗

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

A mathematical basis for the design and design optimization of adaptive trusses in precision control

A mathematical basis for the optimal design of adaptive trusses to be used in supporting precision equipment is provided. The general theory of adaptive structures is introduced, and the global optimization problem of placing a limited number, q, of actuators, so as to maximally achieve precision control and provide prestress, is stated. Two serialized optimization problems, namely, optimal actuator placement for prestress and optimal actuator placement for precision control, are addressed. In the case of prestressing, the computation of a 'desired' prestress is discussed, the interaction between actuators and redundants in conveying the prestress is shown in its mathematical form, and a methodology for arriving at the optimal placement of actuators and additional redundants is discussed. With regard to precision control, an optimal placement scheme (for q actuators) for maximum 'authority' over the precision points is suggested. The results of the two serialized optimization problems are combined to give a suboptimal solution to the global optimization problem. A method for improving this suboptimal actuator placement scheme by iteration is presented.

Das, S. K.↗

Variational actor-critic algorithms,

We introduce a class of variational actor-critic algorithms based on a variational formulation over both the value function and the policy. The objective function of the variational formulation consists of two parts: one for maximizing the value function and the other for minimizing the Bellman residual. Besides the vanilla gradient descent with both the value function and the policy updates, we propose two variants, the clipping method and the flipping method, in order to speed up the convergence. We also prove that, when the prefactor of the Bellman residual is sufficiently large, the fixed point of the algorithm is close to the optimal policy.

97 MATHEMATICS AND COMPUTING↗

Research on an augmented Lagrangian penalty function algorithm for nonlinear programming

The augmented Lagrangian (ALAG) Penalty Function Algorithm for optimizing nonlinear mathematical models is discussed. The mathematical models of interest are deterministic in nature and finite dimensional optimization is assumed. A detailed review of penalty function techniques in general and the ALAG technique in particular is presented. Numerical experiments are conducted utilizing a number of nonlinear optimization problems to identify an efficient ALAG Penalty Function Technique for computer implementation.

Frair, L.↗

Symmetric Random Butterfly Transform (SRBT) Based Preconditioner

Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.

interior point optimization↗