SEARCH · Search NASA

Results for “Quadratic convergence”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1974

Violation of the Vogt-Russell theorem for homogeneous nondegenerate stars

A systematic study is made of the number and types of solutions of the equilibrium equations of stellar structure, in the case of homogeneous stars of Population I over the mass range 2-1000 solar masses, with four different opacity representations. A variant of the usual fitting method permits the simultaneous investigation of convergence and tendency toward multiplicity of the solutions. Quadratic interpolation and extrapolation of Carson's new opacity tables produces a very large opacity at low temperatures that greatly affects the loose outer layers of massive stars, while leaving the cores practically unaffected. As a result, over a small mass range, well above 100 solar masses, triple solutions exist, always near an effective temperature of log Te = 4.73. A simple classification of the known exceptions to the Vogt-Russell theorem on the uniqueness of stellar structure is given.

Stothers, R.↗

NASA NTRS2020

Squash-Box Feasibility Driven Differential Dynamic Programming

Recently, Differential Dynamic Programming (DDP) and other similar algorithms have become the solvers of choice when performing non-linear Model Predictive Control (nMPC) with modern robotic devices. The reason is that they have a lower computational cost per iteration when compared with off-the-shelf Non-Linear Programming (NLP) solvers, which enables its online operation. However, they cannot handle constraints, and are known to have poor convergence capabilities. In this paper, we propose a method to solve the optimal control problem with control bounds through a squashing function (i.e., a sigmoid, which is bounded by construction). It has been shown that a naive use of squashing functions damage the convergence rate. To tackle this, we first propose to add a quadratic barrier that avoids the difficulty of the plateau produced by the sigmoid. Second, we add an outer loop that adapts both the sigmoid and the barrier; it makes the optimal control problem with the squashing function converge to the original control-bounded problem. To validate our method, we present simulation results for different types of platforms including a multi-rotor, a biped, a quadruped and a humanoid robot.

Navarro, Angel Santamaria↗

NASA NTRS1987

Strong convergence and convergence rates of approximating solutions for algebraic Riccati equations in Hilbert spaces

The linear quadratic optimal control problem on infinite time interval for linear time-invariant systems defined on Hilbert spaces is considered. The optimal control is given by a feedback form in terms of solution pi to the associated algebraic Riccati equation (ARE). A Ritz type approximation is used to obtain a sequence pi sup N of finite dimensional approximations of the solution to ARE. A sufficient condition that shows pi sup N converges strongly to pi is obtained. Under this condition, a formula is derived which can be used to obtain a rate of convergence of pi sup N to pi. The results of the Galerkin approximation is demonstrated and applied for parabolic systems and the averaging approximation for hereditary differential systems.

Ito, Kazufumi↗

NASA NTRS1992

A new algorithm for L2 optimal model reduction

In this paper the quadratically optimal model reduction problem for single-input, single-output systems is considered. The reduced order model is determined by minimizing the integral of the magnitude-squared of the transfer function error. It is shown that the numerator coefficients of the optimal approximant satisfy a weighted least squares problem and, on this basis, a two-step iterative algorithm is developed combining a least squares solver with a gradient minimizer. Convergence of the proposed algorithm to stationary values of the quadratic cost function is proved. The formulation is extended to handle the frequency-weighted optimal model reduction problem. Three examples demonstrate the optimization algorithm.

Spanos, J. T.↗

DOE OSTI2023

Adaptive Path-Following Control for Ground Vehicles Using a Switching Non-Quadratic Lyapunov Function

The application of adaptive control techniques in the development of control systems for intelligent vehicles, especially for ground vehicle path-following controllers, has gained popularity due to their ability to handle large-scale parametric uncertainties. However, the use of a standard quadratic Lyapunov function in existing adaptive control-based path-following controllers can lead to poor transient performance, such as slow convergence and/or large overshoot. To address this limitation, this study proposes the use of a switching non-quadratic Lyapunov function to design a model reference adaptive path-following controller that aims to provide superior transient performance. The stability and signal convergence of the closed-loop system are demonstrated through a Lyapunov-like analysis. Through dSPACE ASM simulation, the effectiveness of the proposed controller is illustrated, which confirms improved tracking performance over a baseline solution.

Zhou, Xingyu↗

DOE OSTI2022

Atomic isotropic hyperfine properties for first row elements (B–F) revisited

Benchmark quality isotropic hyperfine properties have been obtained for first row elements (B–F) using a systematic composite approach consisting of a sequence of core/valence correlation consistent basis sets, up through aug-cc-pCV8Z, along with configuration interaction and coupled cluster theory methods. The best nonrelativistic final values (in MHz) are 10.64 (B), 20.22 (C), 10.59 (N), –31.74 (O), and 318.30 (F) and are in very good agreement with available experimental values for these difficult-to-describe properties. Agreement is especially close in the case of N, which has the most accurate experimental value. The spin densities derived from the best composite level of theory were found to closely follow a simple quadratic scaling with the atomic number, Z. Finally, observed convergence rates in the 1-particle and n-particle expansions obtained here may be useful in judging likely accuracy that can be expected in studies of molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1975

Phase correction for a Michelson interferometer with misaligned mirrors

The phase correction for a Michelson interferometer with misaligned mirrors in converging light is shown to give rise to a quadratic phase shift. In general, the calculation of a spectrum from the measured interferogram needs phase correction. Phase corrections have been well worked out for the cases of a linear phase shift and a phase that is slowly varying. The standard procedures for correcting calculated spectra need to be modified, however, to remove any phase errors resulting from misaligned mirrors.

Goorvitch, D.↗

NASA NTRS1984

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

Ito, K.↗

NASA NTRS1987

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

Ito, Kazufumi↗

NASA NTRS1988

Calculations of transonic flows with shocks using Newton's method and direct solver. II - Solution of Euler equations

Transonic flows with shocks are simulated using steady Euler equations and by simultaneously solving the resulting nonlinear algebraic equations using Newton's method. At each iteration, a direct solver computes the corrections and the process is repeated until convergence is achieved. The corrections and errors are reduced quadratically with the present method, allowing solutions of machine accuracy to be obtained in a few steps. Nonunique inviscid solutions and nonunique solutions of the Navier Stokes equations for quasi-one-dimensional flows in nozzles are presented. Calculations are also presented for steady two-dimensional inviscid flows around a cylinder in the transonic regime.

Hafez, M.↗

DOE OSTI2022

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1987

An approximate semi-analytical method for prediction of interlaminar shear stresses in an arbitrarily laminated thick plate

An approximate semianalytical method for determination of interlaminar shear stress distribution through the thickness of an arbitrarily laminated thick plate has been presented. The method is based on the assumptions of transverse inextensibility and layerwise constant shear angle theory (LCST) and utilizes an assumed quadratic displacement potential energy based finite element method (FEM). Centroid of the triangular surface has been proved from a rigorous mathematical point of view (Aubin-Nitsche theory), to be the point of exceptional accuracy for the interlaminar shear stresses. Numerical results indicate close agreement with the available three-dimensional elasticity theory solutions. A comparison between the present theory and that due to an assumed stress hybrid FEM suggest that the (normal) traction-free-edge condition is not satisfied in the latter approach. Furthermore, the present paper is the first to present the results for interlaminar shear stresses in a two-layer thick square plate of balanced unsymmetric angle-ply construction. A comparison with the recently proposed Equilibrium Method (EM) indicates the superiority of the present method, because the latter assures faster convergence as well as simultaneous vanishing of the transverse shear stresses on both of the exposed surfaces of the laminate. Superiority of the present method over the EM, in the case of a symmetric laminate, is limited to faster convergence alone. It has also been demonstrated that the combination of the present method and the reduced (quadratic order) numerical integration scheme yields convergence of the interlaminar shear stresses almost as rapidly as that of the nodal displacements, in the case of a thin plate.

Chaudhuri, Reaz A.↗

NASA NTRS1988

Optimal discrete-time LQR problems for parabolic systems with unbounded input: Approximation and convergence

An abstract approximation and convergence theory for the closed-loop solution of discrete-time linear-quadratic regulator problems for parabolic systems with unbounded input is developed. Under relatively mild stabilizability and detectability assumptions, functional analytic, operator techniques are used to demonstrate the norm convergence of Galerkin-based approximations to the optimal feedback control gains. The application of the general theory to a class of abstract boundary control systems is considered. Two examples, one involving the Neumann boundary control of a one-dimensional heat equation, and the other, the vibration control of a cantilevered viscoelastic beam via shear input at the free end, are discussed.

Rosen, I. G.↗

NASA NTRS1981

Accuracy and convergence of a finite element algorithm for turbulent boundary layer flow

The Galerkin-Weighted Residuals formulation is employed to derive an implicit finite element solution algorithm for the nonlinear parabolic partial differential equation system governing turbulent boundary layer flow. Solution accuracy and convergence with discretization refinement are quantized in several error norms using linear and quadratic basis functions. Richardson extrapolation is used to isolate integration truncation error in all norms, and Newton iteration is employed for all equation solutions performed in double-precision. The mathematical theory supporting accuracy and convergence concepts for linear elliptic equations appears extensible to the nonlinear equations characteristic of turbulent boundary layer flow.

Soliman, M. O.↗

DOE OSTI2022

Automated extraction of physical parameters from experimentally obtained thermal profiles using a machine learning approach

Explore the source record for details and available documents.

99 GENERAL AND MISCELLANEOUS↗

NASA NTRS1971

A contracting-interval program for the Danilewski method

The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.

Harris, J. D.↗