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 253 records · Page 14

Human motion planning based on recursive dynamics and optimal control techniques

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Non-NASA Center↗

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗

Calculation of optimum airfoils using direct solutions of the Navier-Stokes equations

A method has been developed which calculates the optimum airfoil shape at a specified operating condition. The Reynolds-averaged Navier-Stokes equations with a turbulence model are used as the governing equations for the fluid flow, and are explicitly introduced into the optimization analysis as constraint equations. The locations of all grid points which define the surface of the airfoil are design variables, eliminating the need for shape functions to describe changes in the airfoil geometry. A generalized reduced-gradient method is used to find the optimum airfoil shape. The use of a direct solution technique (Newton's method) to solve the Navier-Stokes equations allows for the efficient solution of the problem. This paper describes the optimization method and presents sample results.

Felker, Fort F.↗

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim. 16(4):1110-1136, 2006). The main iteration of the algorithm consists of a feasibility step and several centrality steps. We introduce a kernel function in the algorithm to induce the feasibility step. For parameter p element of [0,1], the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods, that is, O(nlog n/{epsilon})

97 MATHEMATICS AND COMPUTING↗

A non-linearly stable implicit finite element algorithm for hypersonic aerodynamics

A generalized curvilinear coordinate Taylor weak statement implicit finite element algorithm is developed for the two-dimensional and axisymmetric compressible Navier-Stokes equations for ideal and reacting gases. For accurate hypersonic simulation, air is modeled as a mixture of five perfect gases, i.e., molecular and atomic oxygen and nitrogen as well as nitric oxide. The associated pressure is then determined via Newton solution of the classical chemical equilibrium equation system. The directional semidiscretization is achieved using an optimal metric data Galerkin finite element weak statement, on a developed 'companion conservation law system', permitting classical test and trial space definitions. Utilizing an implicit Runge-Kutta scheme, the terminal algorithm is then nonlinearly stable, and second-order accurate in space and time on arbitrary curvilinear coordinates. Subsequently, a matrix tensor product factorization procedure permits an efficient numerical linear algebra handling for large Courant numbers. For ideal- and real-gas hypersonic flows, the algorithm generates essentially nonoscillatory numerical solutions in the presence of strong detached shocks and boundary layer-inviscid flow interactions.

Iannelli, G. S.↗

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Programs for analysis and resizing of complex structures

The paper describes the PARS (Programs for Analysis and Resizing of Structures) system. PARS is a user oriented system of programs for the minimum weight design of structures modeled by finite elements and subject to stress, displacement, flutter and thermal constraints. The system is built around SPAR - an efficient and modular general purpose finite element program, and consists of a series of processors that communicate through the use of a data base. An efficient optimizer based on the Sequence of Unconstrained Minimization Technique (SUMT) with an extended interior penalty function and Newton's method is used. Several problems are presented for demonstration of the system capabilities.

Haftka, R. T.↗

Optimization of self-acting herringbone journal bearings for maximum stability

The stability of herringbone grooved journal bearings was increased by optimizing the groove depth, width, length, and angle. Optimization was performed on the basis of a small-eccentricity infinite-groove analysis in combination with a previously developed Newton-Raphson procedure for bearings with the smooth member rotating or with the grooved member rotating at low compressibility numbers. A newly-developed vector technique for bearings with the grooved member rotating at high compressibility numbers also was used in the analysis. The design curves obtained are suitable for choosing the optimum bearing for a wide range of operating conditions (compressibility numbers from 0 to 80, length to diameter ratios from 1/4 to 2, and smooth or grooved member rotating). Compared to bearings optimized for maximum load, bearings optimized for maximum stability are shown to provide a drastic increase in bearing-supported mass. Bearings with grooved member rotating are substantially more stable than bearing with smooth member rotating, particularly at high compressibility numbers.

Fleming, D. P.↗

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Nash, Stephen G.↗

On options for interdisciplinary analysis and design optimization

The interdisciplinary optimization of engineering systems is discussed from the standpoint of the computational alternatives available to the designer. The analysis of such systems typically requires the solution of coupled systems of nonlinear algebraic equations. The solution procedure is necessarily iterative in nature. It is shown that the system can be solved by fixed point iteration, by Newton's method, or by a combination of the two. However, the need for sensitivity analysis may affect the choice of analysis solution method. Similarly, the optimization of the system can be formulated in several ways that are discussed in the paper. It is shown that the effect of the topology of the interaction between disciplines is a key factor in the choice of analysis, sensitivity and optimization methods. Several examples are presented to illustrate the discussion.

Haftka, R. T.↗

A modified secant method for unconstrained minimization

A gradient-secant algorithm for unconstrained optimization problems is presented. The algorithm uses Armijo gradient method iterations until it reaches a region where the Newton method is more efficient, and then switches over to a secant form of operation. It is concluded that an efficient method for unconstrained minimization has been developed, and that any convergent minimization method can be substituted for the Armijo gradient method.

Polak, E.↗

A study of equation solvers for linear and non-linear finite element analysis on parallel processing computers

Concurrent computing environments provide the means to achieve very high performance for finite element analysis of systems, provided the algorithms take advantage of multiple processors. The authors have examined several algorithms for both linear and nonlinear finite element analysis. The performance of these algorithms on an Alliant FX/80 parallel supercomputer has been studied. For single load case linear analysis, the optimal solution algorithm is strongly problem dependent. For multiple load cases or nonlinear analysis through a modified Newton-Raphson method, decomposition algorithms are shown to have a decided advantage over element-by-element preconditioned conjugate gradient algorithms.

Watson, Brian C.↗

The effect of parking orbit constraints on the optimization of ballistic planetary trajectories

The optimization of ballistic planetary trajectories is developed which includes constraints on departure parking orbit inclination and node. This problem is formulated to result in a minimum total Delta V where the entire constrained injection Delta V is included in the optimization. An additional Delta V is also defined to allow for possible optimization of parking orbit inclination when the launch vehicle orbit capability varies as a function of parking orbit inclination. The optimization problem is formulated using primer vector theory to derive partial derivatives of total Delta V with respect to possible free parameters. Minimization of total Delta V is accomplished using a quasi-Newton gradient search routine. The analysis is applied to an Eros rendezvous mission whose transfer trajectories are characterized by high values of launch asymptote declination during particular launch opportunities. Comparisons in performance are made between trajectories where parking orbit constraints are included in the optimization and trajectories where the constraints are not included.

Sauer, C. G., Jr.↗

Mass-driver reaction engine as Shuttle upper-stage

Optimization has been carried out on the design of a mass-driver intended for upgrading the Shuttle to geosynchronous and lunar-orbit capability. The machine accelerates 2,100 tons/yr of external tankage, in 14-gram segments, to exhaust velocities of 8,000-10,000 m/s. The resulting reaction force raises 1,700 tons/yr. of Shuttle payloads to high orbit, in two round trips. Exhaust velocity and thrust can be optimized for each mission segment. For a mission requiring an exhaust velocity of 8,000 m/sec, thrust is 560 newtons, power is 2.9 megawatts, and efficiency is 75%. Total electrical component mass including power supplies and waste-heat radiators is 89 tons. To insure that reaction mass does not constitute a hazard, segments may be in the form of powder, electrostatically dispersed after acceleration, and/or thrust may be vectored.

Oneill, G. K.↗

Preliminary design of composite wing-box structures for global damage tolerance

A procedure is presented that incorporates the influence of potential global damage conditions into the design process for minimum-mass wing-box structures. The procedure is based on mathematical-programming optimization techniques. Material-strength, minimum-gage, and panel-buckling constraints are introduced by penalty functions, and Newton's method with approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. A potential global damage condition is represented by a structural model with the damaged components removed. Example minimum-mass designs are obtained that simultaneously satisfy the constraints of the damaged and undamaged configurations of both graphite-epoxy and aluminum wing-box structural models. These examples are designed with and without the influence of potential damage conditions, and results indicate that for equal mass cases the residual strength of a damaged structure is higher when the influence of potential damage is properly included in the design from the outset. Results of these examples also identify the minimum structural mass increase required to increase residual strength levels.

Starnes, J. H., Jr.↗

ACCESS 3. Approximation concepts code for efficient structural synthesis: User's guide

A user's guide is presented for ACCESS-3, a research oriented program which combines dual methods and a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and dual algorithms of mathematical programming are applied in the design optimization procedure. This program retains all of the ACCESS-2 capabilities and the data preparation formats are fully compatible. Four distinct optimizer options were added: interior point penalty function method (NEWSUMT); second order primal projection method (PRIMAL2); second order Newton-type dual method (DUAL2); and first order gradient projection-type dual method (DUAL1). A pure discrete and mixed continuous-discrete design variable capability, and zero order approximation of the stress constraints are also included.

Fleury, C.↗