Search NASA⌕ Search

SEARCH · Search NASA

Results for “Exact penalty”

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

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗

Miniature, Low-Power, Waveguide Based Infrared Fourier Transform Spectrometer for Spacecraft Remote Sensing

Fourier transform spectrometers have a venerable heritage as flight instruments. However, obtaining an accurate spectrum exacts a penalty in instrument mass and power requirements. Recent advances in a broad class of non-scanning Fourier transform spectrometer (FTS) devices, generally called spatial heterodyne spectrometers, offer distinct advantages as flight optimized systems. We are developing a miniaturized system that employs photonics lightwave circuit principles and functions as an FTS operating in the 7-14 micrometer spectral region. The inteferogram is constructed from an ensemble of Mach-Zehnder interferometers with path length differences calibrated to mimic scan mirror sample positions of a classic Michelson type FTS. One potential long-term application of this technology in low cost planetary missions is the concept of a self-contained sensor system. We are developing a systems architecture concept for wide area in situ and remote monitoring of characteristic properties that are of scientific interest. The system will be based on wavelength- and resolution-independent spectroscopic sensors for studying atmospheric and surface chemistry, physics, and mineralogy. The self-contained sensor network is based on our concept of an Addressable Photonics Cube (APC) which has real-time flexibility and broad science applications. It is envisaged that a spatially distributed autonomous sensor web concept that integrates multiple APCs will be reactive and dynamically driven. The network is designed to respond in an event- or model-driven manner or reconfigured as needed.

Hewagama, TIlak↗

Two methods to study inelastic neutron-scattering measurements based on ω n (q) versus S(q, ω) applied to the magnetic open honeycomb lattice Tb 2 Ir 3 Ga 9

This work describes two methods to fit the inelastic neutron-scattering spectrum S(q, ω) with wavevector q and frequency ω. The common and well-established method extracts the experimental spin-wave branches ω n (q) from the measured spectra S(q, ω) and then minimizes the difference between the observed and predicted frequencies. When n branches of frequencies are predicted but the measured frequencies overlap to produce only m < n branches, the weighted average of the predicted frequencies must be compared to the observed frequencies. A penalty is then exacted when the width of the predicted frequencies exceeds the width of the observed frequencies. The second method directly compares the measured and predicted intensities S(q, ω) over a grid {q i , ω j } in wavevector and frequency space. After subtracting background noise from the observed intensities, the theoretical intensities are scaled by a simple wavevector-dependent function that reflects the instrumental resolution. Furthermore, the advantages and disadvantages of each approach are demonstrated by studying the open honeycomb material Tb 2 Ir 3 Ga 9 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Guidelines for developing vectorizable computer programs

Some fundamental principles for developing computer programs which are compatible with array-oriented computers are presented. The emphasis is on basic techniques for structuring computer codes which are applicable in FORTRAN and do not require a special programming language or exact a significant penalty on a scalar computer. Researchers who are using numerical techniques to solve problems in engineering can apply these basic principles and thus develop transportable computer programs (in FORTRAN) which contain much vectorizable code. The vector architecture of the ASC is discussed so that the requirements of array processing can be better appreciated. The "vectorization" of a finite-difference viscous shock-layer code is used as an example to illustrate the benefits and some of the difficulties involved. Increases in computing speed with vectorization are illustrated with results from the viscous shock-layer code and from a finite-element shock tube code. The applicability of these principles was substantiated through running programs on other computers with array-associated computing characteristics, such as the Hewlett-Packard (H-P) 1000-F.

Miner, E. W.↗

Alkali metal carbon dioxide electrochemical system for energy storage and/or conversion of carbon dioxide to oxygen

An alkali metal, such as lithium, is the anodic reactant; carbon dioxide or a mixture of carbon dioxide and carbon monoxide is the cathodic reactant; and carbonate of the alkali metal is the electrolyte in an electrochemical cell for the storage and delivery of electrical energy. Additionally, alkali metal-carbon dioxide battery systems include a plurality of such electrochemical cells. Gold is a preferred catalyst for reducing the carbon dioxide at the cathode. The fuel cell of the invention produces electrochemical energy through the use of an anodic reactant which is extremely energetic and light, and a cathodic reactant which can be extracted from its environment and therefore exacts no transportation penalty. The invention is, therefore, especially useful in extraterrestrial environments.

Hagedorn, Norman H.↗

Prop Rotor Acoustics for Conceptual Design

The report describes a methodology for the simple prediction of noise generated by a tilt-rotor aircraft in hover and forward flight. In order to avoid the computational penalties associated with exact noise calculations, simplifications to the loading noise calculation and the blade-vortex interaction noise calculation have been introduced. The loading noise computation utilizes a constant chordwise loading assumption, while the BVI noise level is estimated through use of a dimensionless parameter, here termed 'BVI number.' The acoustic computation code, designed as a module for use with VASCOMP, has two modes of operation, one as a quick estimator of acoustic amplitude produced by a tilt rotor with a typical rotor design and the other as a tool for rotor parametric design studies.

Wells, Valana L.↗

Prop Rotor Acoustics for Conceptual Design

The report describes a methodology for the simple prediction of noise generated by a tilt-rotor aircraft in hover and forward flight. In order to avoid the computational penalties associated with exact noise calculations, simplifications to the loading noise calculation and the blade-vortex interaction noise calculation have been introduced. The loading noise computation utilizes a constant chordwise loading assumption, while the BVI noise level is estimated through use of a dimensionless parameter, here termed 'BVI number.' The acoustic computation code, designed as a module for use with VASCOMP, has two modes of operation, one as a quick estimator of acoustic amplitude produced by a tilt rotor with a typical rotor design and the other as a tool for rotor parametric design studies.

Wells, Valana L.↗

Nonparametric maximum likelihood estimation of probability densities by penalty function methods

When it is known a priori exactly to which finite dimensional manifold the probability density function gives rise to a set of samples, the parametric maximum likelihood estimation procedure leads to poor estimates and is unstable; while the nonparametric maximum likelihood procedure is undefined. A very general theory of maximum penalized likelihood estimation which should avoid many of these difficulties is presented. It is demonstrated that each reproducing kernel Hilbert space leads, in a very natural way, to a maximum penalized likelihood estimator and that a well-known class of reproducing kernel Hilbert spaces gives polynomial splines as the nonparametric maximum penalized likelihood estimates.

Demontricher, G. F.↗

Optimal digital control of multirate systems

Many digitally controlled aerospace systems have widely separated time constants and thus can benefit from the use of two or more sample rates. In this paper, the analysis and synthesis of multirate systems is accomplished by creating an equivalent single rate system and applying existing techniques. The optimal steady state solution of the single rate system is obtained by eigenvector decomposition and then used to compute the periodic solution to the Riccati equation of the original multirate system. An example shows when multirate analysis is necessary and the penalty of various levels of approximations to the exact multirate solution.

Amit, N.↗

Employing Earned Value Management in Government Research and Design - Lessons Learned from the Trenches

To effectively manage a project, the project manager must have a plan, understand the current conditions, and be able to take action to correct the course when challenges arise. Research and design projects face technical, schedule, and budget challenges that make it difficult to utilize project management tools developed for projects based on previously demonstrated technologies. Projects developing new technologies by their inherent nature are trying something new and thus have little to no data to support estimates for schedule and cost, let alone the technical outcome. Projects with a vision for the outcome but little confidence in the exact tasks to accomplish in order to achieve the vision incur cost and schedule penalties when conceptual solutions require unexpected iterations or even a reinvention of the plan. This presentation will share the project management methodology and tools developed through trial and error for a NASA research and design project combining industry, academia, and NASA inhouse work in which Earned Value Management principles were employed but adapted for the reality of the government financial system and the reality of challenging technology development. The priorities of the presented methodology are flexibility, accountability, and simplicity to give the manager tools to help deliver to the customer while not using up valuable time and resources on extensive planning and analysis. This presentation will share the methodology, tools, and work through failed and successful examples from the three years of process evolution.

Simon, Tom↗

Aerodynamic Effects Caused by Icing of an Unswept NACA 65A004 Airfoil

The effects of ice formations on the section lift, drag, and pitching-moment coefficients of an unswept NACA 65A004 airfoil section of 6-foot chord were studied.. The magnitude of the aerodynamic penalties was primarily a function of the shape and size of the ice formation near the leading edge of the airfoil. The exact size and shape of the ice formations were determined photographically and found to be complex functions of the operating and icing conditions. In general, icing of the airfoil at angles of attack less than 40 caused large increases in section drag coefficients (as much as 350 percent in 8 minutes of heavy glaze icing), reductions in section lift coefficients (up to 13 percent), and changes in the pitching-moment coefficient from diving toward climbing moments. At angles of attack greater than 40 the aerodynamic characteristics depended mainly on the ice type. The section drag coefficients generally were reduced by the addition of rime ice (by as much as 45 percent in 8 minutes of icing). In glaze icing, however, the drag increased at these angles of attack. The section lift coefficients were variably affected by rime-ice formations; however, in glaze icing, lift increases at high angles of attack amounted to as much as 9 percent for an icing time of 8 minutes. Pitching-moment-coefficient changes in icing conditions were somewhat erratic and depended on the icing condition. Rotation of the iced airfoil to angles of attack other than that at which icing occurred caused sufficiently large changes in the pitching-moment coefficient that, in flight, rapid corrections in trim might be required in order to avoid a hazardous situation.

Gray, Vernon H.↗

An Exact Algorithm for the Linear Tape Scheduling Problem

Magnetic tapes are often considered as an outdated storage technology, yet they are still used to store huge amounts of data. Their main interests are a large capacity and a low price per gigabyte, which come at the cost of a much larger file access time than on disks. With tapes, finding the right ordering of multiple file accesses is thus key to performance. Moving the reading head back and forth along a kilometer long tape has a non-negligible cost and unnecessary movements thus have to be avoided. However, the optimization of tape request ordering has rarely been studied in the scheduling literature, much less than I/O scheduling on disks. For instance, minimizing the average service time for several read requests on a linear tape remains an open question. Therefore, in this paper, we aim at improving the quality of service experienced by users of tape storage systems, and not only the peak performance of such systems. To this end, we propose a reasonable polynomial-time exact algorithm while this problem and simpler variants have been conjectured NP-hard. We also refine the proposed model by considering U-turn penalty costs accounting for inherent mechanical accelerations. Then, we propose a low-cost variant of our optimal algorithm by restricting the solution space, yet still yielding an accurate suboptimal solution. Finally, we compare our algorithms to existing solutions from the literature on logs of the mass storage management system of a major datacenter. This allows us to assess the quality of previous solutions and the improvement achieved by our low-cost algorithm. Aiming for reproducibility, we make available the complete implementation of the algorithms used in our evaluation, alongside the dataset of tape requests that is, to the best of our knowledge, the first of its kind to be publicly released.

Honoré, Valentin↗

A LEAST ABSOLUTE SHRINKAGE AND SELECTION OPERATOR (LASSO) FOR NONLINEAR SYSTEM IDENTIFICATION

Identification of parametric nonlinear models involves estimating unknown parameters and detecting its underlying structure. Structure computation is concerned with selecting a subset of parameters to give a parsimonious description of the system which may afford greater insight into the functionality of the system or a simpler controller design. In this study, a least absolute shrinkage and selection operator (LASSO) technique is investigated for computing efficient model descriptions of nonlinear systems. The LASSO minimises the residual sum of squares by the addition of a 1 penalty term on the parameter vector of the traditional 2 minimisation problem. Its use for structure detection is a natural extension of this constrained minimisation approach to pseudolinear regression problems which produces some model parameters that are exactly zero and, therefore, yields a parsimonious system description. The performance of this LASSO structure detection method was evaluated by using it to estimate the structure of a nonlinear polynomial model. Applicability of the method to more complex systems such as those encountered in aerospace applications was shown by identifying a parsimonious system description of the F/A-18 Active Aeroelastic Wing using flight test data.

Kukreja, Sunil L.↗

Aeroelastic Model Structure Computation for Envelope Expansion

Structure detection is a procedure for selecting a subset of candidate terms, from a full model description, that best describes the observed output. This is a necessary procedure to compute an efficient system description which may afford greater insight into the functionality of the system or a simpler controller design. Structure computation as a tool for black-box modelling may be of critical importance in the development of robust, parsimonious models for the flight-test community. Moreover, this approach may lead to efficient strategies for rapid envelope expansion which may save significant development time and costs. In this study, a least absolute shrinkage and selection operator (LASSO) technique is investigated for computing efficient model descriptions of nonlinear aeroelastic systems. The LASSO minimises the residual sum of squares by the addition of an l(sub 1) penalty term on the parameter vector of the traditional 2 minimisation problem. Its use for structure detection is a natural extension of this constrained minimisation approach to pseudolinear regression problems which produces some model parameters that are exactly zero and, therefore, yields a parsimonious system description. Applicability of this technique for model structure computation for the F/A-18 Active Aeroelastic Wing using flight test data is shown for several flight conditions (Mach numbers) by identifying a parsimonious system description with a high percent fit for cross-validated data.

Kukreja, Sunil L.↗

Large-angle maneuvers of flexible spacecraft using a closed form solution for the terminal tracking problem

The problem of maneuvering a flexible spacecraft through a large-angle while requiring a sub-vector of the terminal state to exactly satisfy a set of terminal constraints is considered. The necessary conditions for this problem lead to three coupled nonlinear Riccati-like differential equations, which are solved in closed form. Example maneuvers are presented where control-rate penalties have been included in the performance index, in order to smooth the closed-loop control commands. Furthermore, example maneuvers are presented for both fixed and free and condition problem.

Juan, J.-N.↗

A new approach to mixed H2/H infinity controller synthesis using gradient-based parameter optimization methods

In the past few years, the mixed H(sub 2)/H-infinity control problem has been the object of much research interest since it allows the incorporation of robust stability into the LQG framework. The general mixed H(sub 2)/H-infinity design problem has yet to be solved analytically. Numerous schemes have considered upper bounds for the H(sub 2)-performance criterion and/or imposed restrictive constraints on the class of systems under investigation. Furthermore, many modern control applications rely on dynamic models obtained from finite-element analysis and thus involve high-order plant models. Hence the capability to design low-order (fixed-order) controllers is of great importance. In this research a new design method was developed that optimizes the exact H(sub 2)-norm of a certain subsystem subject to robust stability in terms of H-infinity constraints and a minimal number of system assumptions. The derived algorithm is based on a differentiable scalar time-domain penalty function to represent the H-infinity constraints in the overall optimization. The scheme is capable of handling multiple plant conditions and hence multiple performance criteria and H-infinity constraints and incorporates additional constraints such as fixed-order and/or fixed structure controllers. The defined penalty function is applicable to any constraint that is expressible in form of a real symmetric matrix-inequity.

Ly, Uy-Loi↗

Aeroelastic Model Structure Computation for Envelope Expansion

Structure detection is a procedure for selecting a subset of candidate terms, from a full model description, that best describes the observed output. This is a necessary procedure to compute an efficient system description which may afford greater insight into the functionality of the system or a simpler controller design. Structure computation as a tool for black-box modeling may be of critical importance in the development of robust, parsimonious models for the flight-test community. Moreover, this approach may lead to efficient strategies for rapid envelope expansion that may save significant development time and costs. In this study, a least absolute shrinkage and selection operator (LASSO) technique is investigated for computing efficient model descriptions of non-linear aeroelastic systems. The LASSO minimises the residual sum of squares with the addition of an l(Sub 1) penalty term on the parameter vector of the traditional l(sub 2) minimisation problem. Its use for structure detection is a natural extension of this constrained minimisation approach to pseudo-linear regression problems which produces some model parameters that are exactly zero and, therefore, yields a parsimonious system description. Applicability of this technique for model structure computation for the F/A-18 (McDonnell Douglas, now The Boeing Company, Chicago, Illinois) Active Aeroelastic Wing project using flight test data is shown for several flight conditions (Mach numbers) by identifying a parsimonious system description with a high percent fit for cross-validated data.

Kukreja, Sunil L.↗