Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton 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 127 records · Page 7

Airfoil optimization with efficient gradient calculations

The viscous airfoil design analysis code XFOIL was extended to allow optimization using conformal mapping coefficients as design variables. The optimization technique used was the Steepest Descent method applied to a Penalty Function. The gradients of the aerodynamic variables with respect to the design variables were cheaply calculated as by-products of XFOIL's integral boundary layer Newton solver. The speed of the optimization process further increased by updating the Newton system boundary layer variables after each optimization step using the available gradient information. Two examples are presented.

Sorensen, Thomas↗

An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

97 MATHEMATICS AND COMPUTING↗

3-D Deep Penetration Neutron Imaging of Thick Absorgin and Diffusive Objects Using Transport Theory

A current area of research interest in national security is to effectively and efficiently determine the contents of the many shipping containers that enter ports in the United States. This interest comes as a result of the 9/11 Commission Act passed by Congress in 2007 that requires 100% of inbound cargo to be scanned by 2012. It appears that this requirement will be achieved by 2012, but as of February of 2009 eighty percent of the 11.5 million inbound cargo containers were being scanned. The systems used today in all major U.S. ports to determine the presence of radioactive material within cargo containers are Radiation Portal Monitors (RPM). These devices generally exist in the form of a gate or series of gates that the containers can be driven through and scanned. The monitors are effective for determining the presence of radiation, but offer little more information about the particular source. This simple pass-fail system leads to many false alarms as many everyday items emit radiation including smoke detectors due to the Americium-241 source contained inside, bananas, milk, cocoa powder and lean beef due to the trace amounts of Potassium-40, and fire brick and kitty litter due to their high clay content which often contains traces of uranium and thorium. In addition, if an illuminating source is imposed on the boundary of the container, the contents of the container may become activated. These materials include steel, aluminum and many agricultural products. Current portal monitors also have not proven to be that effective at identifying natural or highly enriched uranium (HEU). In fact, the best available Advanced Spectroscopic Portal Monitors (ASP) are only capable of identifying bare HEU 70-88% of the time and masked HEU and depleted uranium (DU) only 53 percent of the time. Therefore, a better algorithm that uses more information collected from better detectors about the specific material distribution within the container is desired. The work reported here explores the inverse problem of optical tomography applied to heterogeneous domains. The neutral particle transport equation was used as the forward model for how neutral particles stream through and interact within these heterogeneous domains. A constrained optimization technique that uses Newtons method served as the basis of the inverse problem. Optical tomography aims at reconstructing the material properties using (a) illuminating sources and (b) detector readings. However, accurate simulations for radiation transport require that the particle (gamma and/or neutron) energy be appropriate discretize in the multigroup approximation. This, in turns, yields optical tomography problems where the number of unknowns grows (1) about quadratically with respect to the number of energy groups, G, (notably to reconstruct the scattering matrix) and (2) linearly with respect to the number of unknown material regions. As pointed out, a promising approach could rely on algorithms to appropriately select a material type per material zone rather than G2 values. This approach, though promising, still requires further investigation: (a) when switching from cross-section values unknowns to material type indices (discrete integer unknowns), integer programming techniques are needed since derivative information is no longer available; and (b) the issue of selecting the initial material zoning remains. The work reported here proposes an approach to solve the latter item, whereby a material zoning is proposed using one-group or few-groups transport approximations. The capabilities and limitations of the presented method were explored; they are briefly summarized next and later described in fuller details in the Appendices. The major factors that influenced the ability of the optimization method to reconstruct the cross sections of these domains included the locations of the sources used to illuminate the domains, the number of separate experiments used in the reconstruction, the locations where measurements were collected, the optical thickness of the domain, the amount of signal noise and signal bias applied to the measurements and the initial guess for the cross section distribution. All of these factors were explored for problems with and without scattering. Increasing the number of source and measurement locations and experiments generally was more successful at reconstructing optically thicker domains while producing less error in the image. The maximum optical thickness that could be reconstructed with this method was ten mean free paths for pure absorber and two mean free paths for scattering problems. Applying signal noise and signal bias to the measured fluxes produced more error in the produced image. Generally, Newtons method was more successful at reconstructing domains from an initial guess for the cross sections that was greater in magnitude than their true values than from an initial guess that was lower in magnitude.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

First-principle study of quantum confinement effect on small sized silicon quantum dots using density-functional theory

Density functional theory (DFT), as a first-principle approach has successfully been implemented to study nanoscale material. Here, DFT by numerical basis-set was used to study the quantum confinement effect as well as electronic properties of silicon quantum dots (Si-QDs) in ground state condition. Selection of quantum dot models were studied intensively before choosing the right structure for simulation. Next, the computational result were used to examine and deduce the electronic properties and its density of state (DOS) for 14 spherical Si-QDs ranging in size up to ∼ 2 nm in diameter. The energy gap was also deduced from the HOMO-LUMO results. The atomistic model of each silicon QDs was constructed by repeating its crystal unit cell of face-centered cubic (FCC) structure, and reconstructed until the spherical shape obtained. The core structure shows tetrahedral (T{sub d}) symmetry structure. It was found that the model need to be passivated, and hence it was noticed that the confinement effect was more pronounced. The model was optimized using Quasi-Newton method for each size of Si-QDs to get relaxed structure before it was simulated. In this model the exchange-correlation potential (V{sub xc}) of the electrons was treated by Local Density Approximation (LDA) functional and Perdew-Zunger (PZ) functional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adjoint methods for aerodynamic wing design

A model inverse design problem is used to investigate the effect of flow discontinuities on the optimization process. The optimization involves finding the cross-sectional area distribution of a duct that produces velocities that closely match a targeted velocity distribution. Quasi-one-dimensional flow theory is used, and the target is chosen to have a shock wave in its distribution. The objective function which quantifies the difference between the targeted and calculated velocity distributions may become non-smooth due to the interaction between the shock and the discretization of the flowfield. This paper offers two techniques to resolve the resulting problems for the optimization algorithms. The first, shock-fitting, involves careful integration of the objective function through the shock wave. The second, coordinate straining with shock penalty, uses a coordinate transformation to align the calculated shock with the target and then adds a penalty proportional to the square of the distance between the shocks. The techniques are tested using several popular sensitivity and optimization methods, including finite-differences, and direct and adjoint discrete sensitivity methods. Two optimization strategies, Gauss-Newton and sequential quadratic programming (SQP), are used to drive the objective function to a minimum.

Grossman, Bernard↗

Congruence Approximations for Entrophy Endowed Hyperbolic Systems

Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.

Barth, Timothy J.↗

Aerodynamic shape optimization of arbitrary hypersonic vehicles

A new method was developed to optimize, in terms of aerodynamic wave drag minimization, arbitrary (nonaxisymmetric) hypersonic vehicles in modified Newtonian flow, while maintaining the initial volume and length of the vehicle. This new method uses either a surface fitted Fourier series to represent the vehicle's geometry or an independent point motion algorithm. In either case, the coefficients of the Fourier series or the spatial locations of the points defining each cross section were varied and a numerical optimization algorithm based on a quasi-Newton gradient search concept was used to determine the new optimal configuration. Results indicate a significant decrease in aerodynamic wave drag for simple and complex geometries at relatively low CPU costs. In the case of a cone, the results agreed well with known analytical optimum ogive shapes. The procedure is capable of accepting more complex flow field analysis codes.

Dulikravich, George S.↗

Optimized Shapes of Ocsillating Resonators for Generating High-Amplitude Pressure Waves

It is well known that the resonator geometry strongly influences the resonant frequencies of an acoustical resonator and the generated nonlinear standing pressure waveform. Maximizing the ratio of maximum to minimum gas pressure at an end of an oscillating resonator by optimizing the cavity contour is investigated numerically. A quasi-Newton type scheme is used to find optimized axisymmetric resonator shapes to achieve the maximum pressure compression ratio. The acoustical field is solved using a one-dimensional model, and the resonance frequency shift and hysteresis effects are obtained through an automation scheme based on continuation methods. Results are presented from optimizing cone, horn-cone, and cosine resonator geometries. Significant performance improvement is found in the optimized shapes over others previously published. Different optimized shapes are found when starting with different initial guesses, indicating multiple local extrema. The numerical model is validated by comparing with the experimental results of a horn-cone shaped resonator.

Li, Xiao-Fan↗

Designing stellarator coils by a modified Newton method using FOCUS

To find the optimal coils for stellarators, nonlinear optimization algorithms are applied in existing coil design codes. However, none of these codes have used the information from the second-order derivatives. In this paper, we present a modified Newton method in the recently developed code FOCUS. The Hessian matrix is calculated with analytically derived equations. Its inverse is approximated by a modified Cholesky factorization and applied in the iterative scheme of a classical Newton method. Using this method, FOCUS is able to recover the W7-X modular coils starting from a simple initial guess. Results demonstrate significant advantages.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

Automated procedure for design of wing structures to satisfy strength and flutter requirements

A pilot computer program was developed for the design of minimum mass wing structures under flutter, strength, and minimum gage constraints. The wing structure is idealized by finite elements, and second-order piston theory aerodynamics is used in the flutter calculation. Mathematical programing methods are used for the optimization. Computation times during the design process are reduced by three techniques. First, iterative analysis methods used to reduce significantly reanalysis times. Second, the number of design variables is kept small by not using a one-to-one correspondence between finite elements and design variables. Third, a technique for using approximate second derivatives with Newton's method for the optimization is incorporated. The program output is compared witH previous published results. It is found that some flutter characteristics, such as the flutter speed, can display discontinous dependence on the design variables (which are the thicknesses of the structural elements). It is concluded that it is undesirable to use such quantities in the formulation of the flutter constraint.

Haftka, R. T.↗

Approximation of the Newton Step by a Defect Correction Process

In this paper, an optimal control problem governed by a partial differential equation is considered. The Newton step for this system can be computed by solving a coupled system of equations. To do this efficiently with an iterative defect correction process, a modifying operator is introduced into the system. This operator is motivated by local mode analysis. The operator can be used also for preconditioning in Generalized Minimum Residual (GMRES). We give a detailed convergence analysis for the defect correction process and show the derivation of the modifying operator. Numerical tests are done on the small disturbance shape optimization problem in two dimensions for the defect correction process and for GMRES.

Arian, E.↗

Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method

We present the mathematical derivation, software implementation details, and computational results for a semi-smooth Newton method applied to two inverse problems governed by partial differential equations with bound constraints. The two problems share mathematical structural similarities to density-based topology optimization problems. The semi-smooth Newton method provides a mesh independent solution computation for the two test problems. A key step is that the complementarity part of the necessary optimality conditions are reformulated with the use of a complementarity functionφsuch that the complementarity conditions are satisfied if and only if a zero of a nonsmooth function has been obtained. The modular finite element package MFEM is utilized for the software implementation. In addition we constructed a matrix-free Operator to enable the use of efficient Krylov subspace IterativeSolver of MFEM for the solution of our two target problems.

97 MATHEMATICS AND COMPUTING↗