Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints

A new algorithm for solving nonlinear least-squares and nonlinear equation problems is proposed which is based on approximating the nonlinear functions using the quadratic-tensor model by Schnabel and Frank. The algorithm uses a trust region defined by a box containing the current values of the unknowns. The algorithm is found to be effective for problems with linear constraints and dense Jacobian matrices.

Hanson, R. J.↗
NASA NTRS1982

Nonlinear optimization with linear constraints using a projection method

Nonlinear optimization problems that are encountered in science and industry are examined. A method of projecting the gradient vector onto a set of linear contraints is developed, and a program that uses this method is presented. The algorithm that generates this projection matrix is based on the Gram-Schmidt method and overcomes some of the objections to the Rosen projection method.

Fox, T.↗
NASA NTRS1983

A new algorithm for constrained nonlinear least-squares problems, part 1

A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.

Hanson, R. J.↗
NASA NTRS2004

Fleet Assignment Using Collective Intelligence

Product distribution theory is a new collective intelligence-based framework for analyzing and controlling distributed systems. Its usefulness in distributed stochastic optimization is illustrated here through an airline fleet assignment problem. This problem involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of linear and non-linear constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of this new stochastic optimization algorithm to a non-linear objective cold start fleet assignment problem. Results show that the optimizer can successfully solve such highly-constrained problems (130 variables, 184 constraints).

Antoine, Nicolas E.↗
NASA NTRS1991

Two Point Exponential Approximation Method for structural optimization of problems with frequency constraints

The point exponential approximation method was introduced by Fadel et al. (Fadel, 1990), and tested on structural optimization problems with stress and displacement constraints. The reports in earlier papers were promising, and the method, which consists of correcting Taylor series approximations using previous design history, is tested in this paper on optimization problems with frequency constraints. The aim of the research is to verify the robustness and speed of convergence of the two point exponential approximation method when highly non-linear constraints are used.

Fadel, G. M.↗
NASA NTRS1974

A synthesis theory for the externally excited adaptive system /EEAS/

The externally excited adaptive system (EEAS) is a two-degree-of-freedom feedback system with a nonlinearity which is saturated hard by an external periodic signal. Under certain conditions, the EEAS responds quasi-linearly to command and plant disturbance signals, permitting the development of a quantitative synthesis theory for satisfying system tolerances despite large plant uncertainty. The great advantage of the EEAS is its zero sensitivity to plant gain variations, a property it shares with the self-oscillating adaptive system (SOAS). The EEAS is, however, more flexible than the SOAS in satisfying the quasi-linearity constraints. The essential difference is that in the EEAS the loop transmission bandwidth is not rigorously tied to the 'carrier' signal, as it is in the SOAS. There is a class of problems for which the EEAS is superior to the purely linear system, which in turn is superior to the SOAS. The superiority of the EEAS over the SOAS is especially marked in the case of significant plant disturbances, which generally vitiate a SOAS design.

Horowitz, I. M.↗
NASA NTRS1973

Eleventh order resonance terms in the geopotential from the orbit of Vanguard 3

The orbit of Vanguard 3 (1959-7A) is strongly resonant with 11th order and odd degree terms in the geopotential. It affords an excellent opportunity to determine a significant linear constraint between these terms. Tracking data on this satellite (in the form of mean Kepler elements) are analyzed over a 3 1/2 year period in the early 1960's, which ends with the orbit having just passed through perfect commensurability. The eccentricity and inclination show the deep resonance variations (up to 0.0002 in e and .02 deg in i) with great clarity. Previous and current geopotential solutions fail to explain these perturbations.

Wagner, C. A.↗
NASA NTRS1974

Eleventh-order geopotential resonance on the orbit of Vanguard 3

The orbit of Vanguard 3 (1959-7A) is strongly resonant with eleventh-order and odd degree terms in the geopotential. It affords an excellent opportunity to determine a significant linear constraint between these terms. Tracking data on this satellite (in the form of mean Kepler elements) are analyzed over a 3.5-year period in the early 1960s, which ends with the orbit having just passed through perfect commensurability. The eccentricity e and inclination I show the deep resonance variations (up to .0002 in e and 0.02 deg in I) with great clarity. Previous and current geopotential solutions fail to explain these perturbations. A constraint for the deep resonant terms is determined in fully normalized harmonics.

Wagner, C. A.↗
NASA NTRS1983

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal estimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed.

Rodriguez, G.↗
NASA NTRS1983

Programming the gradient projection algorithm

The gradient projection method of numerical optimization which is applied to problems having linear constraints but nonlinear objective functions is described and analyzed. The algorithm is found to be efficient and thorough for small systems, but requires the addition of auxiliary methods and programming for large scale systems with severe nonlinearities. In order to verify the theoretical results a digital computer is used to simulate the algorithm.

Hargrove, A.↗
NASA NTRS1983

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal esimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed. While this paper focuses on theoretical developments, applications arising in the area of large structure static shape determination are contained in a closely related paper (Rodriguez and Scheid, 1982).

Rodriguez, G.↗
NASA NTRS1988

Advances in dual algorithms and convex approximation methods

A new algorithm for solving the duals of separable convex optimization problems is presented. The algorithm is based on an active set strategy in conjunction with a variable metric method. This first order algorithm is more reliable than Newton's method used in DUAL-2 because it does not break down when the Hessian matrix becomes singular or nearly singular. A perturbation technique is introduced in order to remove the nondifferentiability of the dual function which arises when linear constraints are present in the approximate problem.

Smaoui, H.↗
NASA NTRS1993

The algebra of supertraces for 2+1 super de Sitter gravity

The algebra of the observables for 2+1 super de Sitter gravity, for one genus of the spatial surface is calculated. The algebra turns out to be an infinite Lie algebra subject to non-linear constraints. The constraints are solved explicitly in terms of five independent complex supertraces. These variables are the true degrees of freedom of the system and their quantized algebra generates a new structure which is referred to as a 'central extension' of the quantum algebra SU(2)q.

Urrutia, L. F.↗