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 73 records · Page 4

Newton modified barrier method in constrained optimization

In this paper, we develop and investigate the Newton method for solving constrained (non-smooth) optimization problems. This approach is based on the modified barrier functions (MBF) theory and on the global converging step-size version of the Newton method for smooth unconstrained optimization. Due to the excellent properties of the MBF near primal-dual solution, the Newton modified barrier method (NMBM) has a better rate of convergence, better complexity bound, and is much more stable in the final stage of the computational process than the methods which are based on the classical barrier functions (CBF).

Polyak, R.↗

Generalized Newton-Raphson trajectory optimization-generator 1

Computer program constructs a sequence of optimal solutions to dynamically-approximate linear equations. Specification of the number and type of subarcs in the optimal solution allows simultaneous satisfaction of all switching criteria.

Cope, D. D.↗

Real-Time Adaptive Drag Minimization Wind Tunnel Investigation of a Flexible Wing with Variable Camber Continuous Trailing Edge Flap System

This paper reports the results of a recently completed real-time adaptive drag minimization wind tunnel investigation of a highly flexible wing wind tunnel model equipped with the Variable Camber Continuous Trailing Flap (VCCTEF) technology at the University of Washington Aeronautical Laboratory (UWAL). The wind tunnel investigation is funded by NASA SBIR Phase II contract with Scientific Systems Company, Inc. (SSCI) and University of Washington (UW) as a subcontractor. The wind tunnel model is a sub-scale Common Research Model (CRM) wing constructed of foam core and fiberglass skin and is aeroelastically scaled to achieve a wing tip deflection of 10% of the wing semi-span which represents a typical wing tip deflection for a modern transport such as Boeing 787. The jig-shape twist of the CRM wing is optimized using a CART3D aero-structural model to achieve the minimum induced drag for the design cruise lift coefficient of 0.5. The wing is equipped with two chord wise cambered segments for each of the six span wise flap sections for a total of 12 individual flap segments that comprise the VCCTEF system. Each of the 12 flap segments is actively controlled by an electric servo-actuator. The real-time adaptive drag optimization strategy includes an on-board aerodynamic model identification, a model excitation, and a real-time drag optimization. The on-board aerodynamic model is constructed parametrically as a function of the angle of attack and flap positions to model the lift and drag coefficients of the wing. The lift coefficient models include a linear model and a second-order model. The drag coefficient models include a quadratic model and a higher-order up to 6th-order model to accurately model the drag coefficient at high angles of attack. The onboard aerodynamic model identification includes a recursive least-squares (RLS) algorithm and a batch least-squares (BLS) algorithm designed to estimate the model parameters. The model excitation method is designed to sample the input set that comprises the angle of attack and the flap positions. Three model excitation methods are developed: random excitation method, sweep method, and iterative angle-of-attack seeking method. The real-time drag optimization includes a generic algorithm developed by SSCI and several optimization methods developed by NASA which include a second-order gradient Newton-Raphson optimization method, an iterative gradient optimization method, a pseudo-inverse optimization method, an analytical optimization method, and an iterative refinement optimization method. The first wind tunnel test entry took place in September 2017. This test revealed major hardware issues and required further redesign of the flap servo mechanisms. The second test entry took place in April 2018. However, the test was not successful due to the issues with the onboard aerodynamic model identification RLS algorithm which incorrectly identified model parameters. This test also provides an experimental comparison study between the VCCTEF and a variable camber discrete trailing edge flap (VCDTEF) without the elastomer transition mechanisms. The experimental result confirms the benefit of the VCCTEF which produces lower drag by 5% than the VCDTEF. The third and final test entry took place in June 2018 after the issues with the RLS algorithm have been identified and corrected. Additional improvements were implemented. These include the BLS algorithm, the iterative angle-of-attack seeking method, the iterative gradient optimization method, and the pseudo-inverse optimization method. The test objectives were successfully demonstrated as the real-time drag optimization identifies several optimal solutions at off-design lift coefficients. The iterative gradient optimization method is found to achieve up to 4.7% drag reduction for the off-design lift coefficient of 0.7. The pseudo-inverse optimization method which does not require the drag coefficient model is found to be quite effective in reducing drag. Up to 9.4% drag reduction for the off-design lift coefficient of 0.7 is achieved with the pseudo-inverse optimization method. The wind tunnel investigation demonstrates the potential of real-time drag optimization technology. Several new capabilities are developed that could enable future adaptive wing technologies for flexible wings equipped with drag control devices such as the VCCTEF.

Drag Optimization↗

Aerodynamic shape optimization using control theory

Aerodynamic shape design has long persisted as a difficult scientific challenge due its highly nonlinear flow physics and daunting geometric complexity. However, with the emergence of Computational Fluid Dynamics (CFD) it has become possible to make accurate predictions of flows which are not dominated by viscous effects. It is thus worthwhile to explore the extension of CFD methods for flow analysis to the treatment of aerodynamic shape design. Two new aerodynamic shape design methods are developed which combine existing CFD technology, optimal control theory, and numerical optimization techniques. Flow analysis methods for the potential flow equation and the Euler equations form the basis of the two respective design methods. In each case, optimal control theory is used to derive the adjoint differential equations, the solution of which provides the necessary gradient information to a numerical optimization method much more efficiently then by conventional finite differencing. Each technique uses a quasi-Newton numerical optimization algorithm to drive an aerodynamic objective function toward a minimum. An analytic grid perturbation method is developed to modify body fitted meshes to accommodate shape changes during the design process. Both Hicks-Henne perturbation functions and B-spline control points are explored as suitable design variables. The new methods prove to be computationally efficient and robust, and can be used for practical airfoil design including geometric and aerodynamic constraints. Objective functions are chosen to allow both inverse design to a target pressure distribution and wave drag minimization. Several design cases are presented for each method illustrating its practicality and efficiency. These include non-lifting and lifting airfoils operating at both subsonic and transonic conditions.

Reuther, James↗

Practical design optimization of wing/body configurations using the Euler equations

The development of a practical method for the aerodynamic design of isolated wing and wing/body configurations is achieved through the coupling of existing computational fluid dynamics (CFD) analysis codes and a quasi-Newton numerical optimization method. The direct design method is generalized to treat three-dimensional aerodynamic optimization problems subject to inviscid, rotational, compressible flow conditions imposed by the Euler equations. The method couples either the FLO57 or the TEAM flow solver with a modified version of the QNMDIF numerical optimization algorithm. The method is applied, but is not limited, to supersonic design problems. A case study is presented illustrating the method's effectiveness in maximizing the lift-to-drag ratio, subject to a variety of constraints, of selected supersonic configurations at cruise conditions.

Reuther, J.↗

A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees

Abstract We describe an algorithm based on a logarithmic barrier function, Newton’s method and linear conjugate gradients that seeks an approximate minimizer of a smooth function over the non-negative orthant. We develop a bound on the complexity of the approach, stated in terms of the required accuracy and the cost of a single gradient evaluation of the objective function and/or a matrix-vector multiplication involving the Hessian of the objective. The approach can be implemented without explicit calculation or storage of the Hessian.

O’Neill, Michael↗

An optimal, parallel, fully implicit Newton-Krylov solver for three-dimensional viscoresistive magnetohydrodynamics

The conceptual development and implementation of a scalable nonlinear solver for the time-dependent three-dimensional (3D) compressible resistive magnetohydrodynamics model (MHD) is discussed. The approach is based on Jacobian-free Newton-Krylov technology, preconditioned with multigrid methods for algorithmic scalability. The key to the approach is the reformulation of the hyperbolic MHD system into a parabolic one, which is amenable to multigrid techniques. Such reformulation (parabolization) aims to render the modified system block diagonally dominant (unlike the original MHD system, which is diagonally submissive for implicit time steps {delta}t larger than the explicit Courant-Friedrichs-Lewy time step). The algorithm has been tested on a variety of 2D and 3D configurations which demonstrate its excellent algorithmic scalability properties. In particular, it is shown that, serially, the CPU time for a given simulation scales linearly with the number of unknowns, and that large CPU gains ({approx}30) are attainable with respect to an explicit approach even for moderate grids (256x256). In parallel, the algorithm features excellent scalability properties up to thousands of processors (4096) and millions of unknowns ({approx}1.3x10{sup 8})

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)

Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and the tensor elements are nonnegative count data. SparTen is a high-performance C++ library which computes a low-rank decomposition using different solvers: a first-order quasi-Newton or a second-order damped Newton method, along with the appropriate choice of runtime parameters. Since default parameters in SparTen are tuned to experimental results in prior published work on a single real-world dataset conducted using MATLAB implementations of these methods, it remains unclear if the parameter defaults in SparTen are appropriate for general tensor data. Furthermore, it is unknown how sensitive algorithm convergence is to changes in the input parameter values. This report addresses these unresolved issues with large-scale experimentation on three benchmark tensor data sets. Experiments were conducted on several different CPU architectures and replicated with many initial states to establish generalized profiles of algorithm convergence behavior.

97 MATHEMATICS AND COMPUTING↗

SCIP2 flight instrumentation specification for parameter identification: User's guide

SCIP2 which is a digital computer program that can be used to investigate the effects of instrumentation errors on the accuracy of aircraft stability and control derivatives identified from flight test data is presented. The program is based on the assumptions that the aircraft differential equations of motion are linear and consist of small perturbations about a quasisteady flight condition. It is also assumed that a Newton-Raphson optimization technique is used for identifying the estimates of the parameters. A summary of the equations which are coded in the program are included.

Taniguchi, N.↗

Flight instrumentation specification for parameter identification: Program user's guide

A set of four digital computer programs is presented which can be used to investigate the effects of instrumentation errors on the accuracy of aircraft and helicopter stability-and-control derivatives identified from flight test data. The programs assume that the differential equations of motion are linear and consist of small perturbations about a quasi-steady flight condition. It is also assumed that a Newton-Raphson optimization technique is used for identifying the estimates of the parameters. Flow charts and printouts are included.

Mohr, R. L.↗

Optimal solar sail planetocentric trajectories

The analysis of solar sail planetocentric optimal trajectory problem is described. A computer program was produced to calculate optimal trajectories for a limited performance analysis. A square sail model is included and some consideration is given to a heliogyro sail model. Orbit to a subescape point and orbit to orbit transfer are considered. Trajectories about the four inner planets can be calculated and shadowing, oblateness, and solar motion may be included. Equinoctial orbital elements are used to avoid the classical singularities, and the method of averaging is applied to increase computational speed. Solution of the two-point boundary value problem which arises from the application of optimization theory is accomplished with a Newton procedure. Time optimal trajectories are emphasized, but a penalty function has been considered to prevent trajectories which intersect a planet's surface.

Sackett, L. L.↗

Optimal control with accelerated convergence: Combining the Krotov and quasi-Newton methods

One of the most popular methods for solving numerical optimal control problems is the Krotov method, adapted for quantum control by Tannor and coworkers. The Krotov method has the following three appealing properties: (1) monotonic increase of the objective with iteration number, (2) no requirement for a line search, leading to a significant savings over gradient (first-order) methods, and (3) macrosteps at each iteration, resulting in significantly faster growth of the objective at early iterations than in gradient methods where small steps are required. The principal drawback of the Krotov method is slow convergence at later iterations, which is particularly problematic when high fidelity is desired. We show here that, near convergence, the Krotov method degenerates to a first-order gradient method. We then present a variation on the Krotov method that has all the advantages of the original Krotov method but with significantly enhanced convergence (second-order or quasi-Newton) as the optimal solution is approached. We illustrate the method by controlling the three-dimensional dynamics of the valence electron in the Na atom.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗