Search NASA⌕ Search

SEARCH · Search NASA

Results for “convex programs”

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

Multi Objective Controller Design for Linear System via Optimal Interpolation

We propose a methodology for the design of a controller which satisfies a set of closed-loop objectives simultaneously. The set of objectives consists of: (1) pole placement, (2) decoupled command tracking of step inputs at steady-state, and (3) minimization of step response transients with respect to envelope specifications. We first obtain a characterization of all controllers placing the closed-loop poles in a prescribed region of the complex plane. In this characterization, the free parameter matrix Q(s) is to be determined to attain objectives (2) and (3). Objective (2) is expressed as determining a Pareto optimal solution to a vector valued optimization problem. The solution of this problem is obtained by transforming it to a scalar convex optimization problem. This solution determines Q(O) and the remaining freedom in choosing Q(s) is used to satisfy objective (3). We write Q(s) = (l/v(s))bar-Q(s) for a prescribed polynomial v(s). Bar-Q(s) is a polynomial matrix which is arbitrary except that Q(O) and the order of bar-Q(s) are fixed. Obeying these constraints bar-Q(s) is now to be 'shaped' to minimize the step response characteristics of specific input/output pairs according to the maximum envelope violations. This problem is expressed as a vector valued optimization problem using the concept of Pareto optimality. We then investigate a scalar optimization problem associated with this vector valued problem and show that it is convex. The organization of the report is as follows. The next section includes some definitions and preliminary lemmas. We then give the problem statement which is followed by a section including a detailed development of the design procedure. We then consider an aircraft control example. The last section gives some concluding remarks. The Appendix includes the proofs of technical lemmas, printouts of computer programs, and figures.

Ozbay, Hitay↗

Integrating UniTree with the data migration API

The Data Migration Application Programming Interface (DMAPI) has the potential to allow developers of open systems Hierarchical Storage Management (HSM) products to virtualize native file systems without the requirement to make changes to the underlying operating system. This paper describes advantages of virtualizing native file systems in hierarchical storage management systems, the DMAPI at a high level, what the goals are for the interface, and the integration of the Convex UniTree+HSM with DMAPI along with some of the benefits derived in the resulting product.

Schrodel, David G.↗

Computerized Generation and Simulation of Meshing and Contact of New Type of Novikov-Wildhaber Helical Gears

In this report, we propose a new geometry for low-noise, increased-strength helical gears of the Novikov-Wildhaber type. Contact stresses are reduced as a result of their convex-concave gear tooth surfaces. The gear tooth surfaces are crowned in the profile direction to localize bearing contact and in the longitudinal direction to obtain a parabolic function of transmission errors. Such a function results in the reduction of noise and vibrations. Methods for the generation of the proposed gear tooth surfaces by grinding and hobbing are considered, and a tooth contact analysis (TCA) computer program to simulate meshing and contact is applied. The report also investigates the influence of misalignment on transmission errors and shift of bearing contact. Numerical examples to illustrate the developed approaches are proposed. The proposed geometry was patented by Ford/UIC (Serial Number 09-340-824, pending) on June 28, 1999.

Litvin, Faydor L.↗

Computer subroutines for the estimation of nuclear reaction effects in proton-tissue-dose calculations

Calculational methods for estimation of dose from external proton exposure of arbitrary convex bodies are briefly reviewed. All the necessary information for the estimation of dose in soft tissue is presented. Special emphasis is placed on retaining the effects of nuclear reaction, especially in relation to the dose equivalent. Computer subroutines to evaluate all of the relevant functions are discussed. Nuclear reaction contributions for standard space radiations are in most cases found to be significant. Many of the existing computer programs for estimating dose in which nuclear reaction effects are neglected can be readily converted to include nuclear reaction effects by use of the subroutines described herein.

Wilson, J. W.↗

Greenberger-Horne-Zeilinger and W entanglement witnesses for the noninteracting Fermi gas

The existence and nature of tripartite entanglement of a noninteracting Fermi gas (NIFG) is investigated. Three classes of parametrized entanglement witnesses (EWs) are introduced with the aim of detecting genuine tripartite entanglement in the three-body reduced density matrix and discriminating between the presence of the two types of genuine tripartite entanglement, W/B and GHZ/W (the convex set of B states is comprised of mixed states of product and biseparable states; that of W states is comprised of mixed states of B states and W-type pure entangled states; and the GHZ (Greenberger-Horne-Zeilinger) set contains generic mixtures of any kind for a tripartite system). By choosing appropriate EW operators, the problem of finding GHZ and W EWs is reduced to linear programming. Specifically, we devise W EWs based on a spin-chain model with periodic boundary conditions, and we construct a class of parametrized GHZ EWs by linearly combining projection operators corresponding to all the different state-vector types arising for a three-fermion system. A third class of EWs is provided by a GHZ stabilizer operator capable of distinguishing W/B from GHZ/B entanglement, which is not possible with W EWs. Implementing these classes of EWs, it is found that all states containing genuine tripartite entanglement are of W type, and hence states containing GHZ/W genuine tripartite entanglement do not arise. Some genuine tripartite entangled states that have a positive partial transpose (PPT) with respect to some bipartition are detected. Finally, it is demonstrated that a NIFG does not exhibit 'pure'W/B genuine tripartite entanglement: three-party entanglement without any separable or biseparable admixture does not occur.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Knots and entanglement

We extend the entanglement bootstrap program to (3+1)-dimensions. We study knotted excitations of (3+1)-dimensional liquid topological orders and exotic fusion processes of loops. As in previous work in (2+1)-dimensions [Ann. Phys. 418, 168164 (2020), Phys. Rev. B 103, 115150 (2021)], we define a variety of superselection sectors and fusion spaces from two axioms on the ground state entanglement entropy. In particular, we identify fusion spaces associated with knots. We generalize the information convex set to a new class of regions called immersed regions, promoting various theorems to this new context. Examples from solvable models are provided; for instance, a concrete calculation of knot multiplicity shows that the knot complement of a trefoil knot can store quantum information. We define spiral maps that allow us to understand consistency relations for torus knots as well as spiral fusions of fluxes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗

Minimax approach problem with incomplete information for the two-level hierarchical discrete-time dynamical system

We consider a discrete-time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector linear or convex discrete-time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using certification trails to achieve software fault tolerance

A conceptually novel and powerful technique to achieve fault tolerance in hardware and software systems is introduced. When used for software fault tolerance, this new technique uses time and software redundancy and can be outlined as follows. In the initial phase, a program is run to solve a problem and store the result. In addition, this program leaves behind a trail of data called a certification trail. In the second phase, another program is run which solves the original problem again. This program, however, has access to the certification trail left by the first program. Because of the availability of the certification trail, the second phase can be performed by a less complex program and can execute more quickly. In the final phase, the two results are accepted as correct; otherwise an error is indicated. An essential aspect of this approach is that the second program must always generate either an error indication or a correct output even when the certification trail it receives from the first program is incorrect. The certification trail approach to fault tolerance was formalized and it was illustrated by applying it to the fundamental problem of finding a minimum spanning tree. Cases in which the second phase can be run concorrectly with the first and act as a monitor are discussed. The certification trail approach was compared to other approaches to fault tolerance. Because of space limitations we have omitted examples of our technique applied to the Huffman tree, and convex hull problems. These can be found in the full version of this paper.

Sullivan, Gregory F.↗

Minimum Landing Error Powered-Descent Guidance for Planetary Missions

An algorithm improves the accuracy with which a lander can be delivered to the surface of Mars. The main idea behind this innovation is the use of a lossless convexification, which converts an otherwise non-convex constraint related to thruster throttling to a convex constraint, enabling convex optimization to be used. The convexification leads directly to an algorithm that guarantees finding the global optimum of the original nonconvex optimization problem with a deterministic upper bound on the number of iterations required for convergence. In this innovation, previous work in powered-descent guidance using convex optimization is extended to handle the case where the lander must get as close as possible to the target given the available fuel, but is not required to arrive exactly at the target. The new algorithm calculates the minimum-fuel trajectory to the target, if one exists, and calculates the trajectory that minimizes the distance to the target if no solution to the target exists. This approach poses the problem as two Second-Order Cone Programs, which can be solved to global optimality with deterministic bounds on the number of iterations required.

Blackmore, Lars↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

LARCRIM user's guide, version 1.0

LARCRIM is a relational database management system (RDBMS) which performs the conventional duties of an RDBMS with the added feature that it can store attributes which consist of arrays or matrices. This makes it particularly valuable for scientific data management. It is accessible as a stand-alone system and through an application program interface. The stand-alone system may be executed in two modes: menu or command. The menu mode prompts the user for the input required to create, update, and/or query the database. The command mode requires the direct input of LARCRIM commands. Although LARCRIM is an update of an old database family, its performance on modern computers is quite satisfactory. LARCRIM is written in FORTRAN 77 and runs under the UNIX operating system. Versions have been released for the following computers: SUN (3 & 4), Convex, IRIS, Hewlett-Packard, CRAY 2 & Y-MP.

Davis, John S.↗

A Comparative Assessment of Economic Model Predictive Control Strategies for Fuel Economy Optimization of Heavy-Duty Trucks

This paper provides a comparative assessment of three control strategies that fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC) in an effort to minimize fuel consumption for a heavy-duty truck. The online MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. Three candidate economic MPC formulations are evaluated: a time-based formulation that directly penalizes predicted fuel consumption, a simplified time-based formulation that penalizes braking effort in place of fuel consumption, and a distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity based on DP. The performance of each approach is presented for three representative route profiles, using a medium-fidelity proprietary Volvo model of the heavy-duty truck’s longitudinal dynamics. Results demonstrate 4-7% fuel economy improvement across all three formulations, when compared to a baseline strategy. Furthermore, we present a detailed analysis of energy usage by “type” (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control approach.

33 ADVANCED PROPULSION SYSTEMS↗

Collaborative Decision Approach for Electricity Pricing-demand Response Stackelberg Game

Demand response programs are considered as a valuable resource in smart grids that provide several advantages of load shifting, peak load reduction, mediating intermittency of renewable energy integration, etc. Flexible price-based incentives have been recognized as a critical strategy in motivating and compensating consumers' load adjustment actions for successful implementation of demand response. Game theoretical approaches, especially Stackelberg games are popularly adopted to model the relationship between electricity price and customers' demand response and solved by the classical centralized backward induction (BI) method. However, the BI method generally requires convexity of the follower's model for necessary optimality conditions, and the computational time of any centralized approach increases sharply with larger problem instances. In this paper, the Stackelberg game of electricity pricing-demand response between a distribution system operator (DSO) and load aggregators (LAs) is decomposed based on a collaborative optimization (CO) framework, where each LA is treated as a discipline with its own domain constraints (e.g. building temperature control), while the DSO at the system level tries to reduce the solution discrepancy and guide the searching towards optimality. Several groups of comparison experiments have demonstrated the effectiveness of the proposed collaborative decision approach in solving the demand response game.

Chen, Yang↗

Formulations and Valid Inequalities for Optimal Black Start Allocation in Power Systems

The restoration of a power system after a blackout starts around units with enhanced technical capabilities, referred to as black start units (BSUs). We examine the planning problem of optimally allocating these units on the grid subject to a budget constraint. We present a mixed integer programming model based on current literature in power systems. Binary variables are associated with the allocation of BSUs and with the energization state of buses, branches, and generators of the power system over a time horizon. We extract a substructure of the feasible region which imposes the requirement that each island that appears during the restoration process must have at least one operational generator. We discuss three equivalent reformulations for this requirement. We introduce a family of exponentially many, polynomially separable, valid inequalities to strengthen the formulation. Under simplifying assumptions, we show that the convex hull of the feasible region is a full-dimensional polyhedron, and prove that some of the constraints we introduced are facet-defining. We perform experiments to examine the difference in strength between the formulations as well as the computational times to solve the problem to near optimality for synthetic instances of the IEEE-39, IEEE-118, Illinois-200, WECC-225, IEEE-300, South Carolina-500, and Texas-2000 power systems. We illustrate a use case of the model. We conclude by suggesting extensions of the current work for future research.

Black Start Allocation↗

Iterative packing for demand matching and sparse packing.

The main result we will present is a 2k-approximation algorithm for the following 'k-hypergraph demand matching' problem: given a set system with sets of size <=k, where sets have profits & demands and vertices have capacities, find a max-profit subsystem whose demands do not exceed the capacities. The main tool is an iterative way to explicitly build a decomposition of the fractional optimum as 2k times a convex combination of integral solutions. If time permits we'll also show how the approach can be extended to a 3-approximation for 2-column sparse packing. The second result is tight w.r.t the integrality gap, and the first is near-tight as a gap lower bound of 2(k-1+1/k) is known.

99 GENERAL AND MISCELLANEOUS↗

Volume serving and media management in a networked, distributed client/server environment

The E-Systems Modular Automated Storage System (EMASS) is a family of hierarchical mass storage systems providing complete storage/'file space' management. The EMASS volume server provides the flexibility to work with different clients (file servers), different platforms, and different archives with a 'mix and match' capability. The EMASS design considers all file management programs as clients of the volume server system. System storage capacities are tailored to customer needs ranging from small data centers to large central libraries serving multiple users simultaneously. All EMASS hardware is commercial off the shelf (COTS), selected to provide the performance and reliability needed in current and future mass storage solutions. All interfaces use standard commercial protocols and networks suitable to service multiple hosts. EMASS is designed to efficiently store and retrieve in excess of 10,000 terabytes of data. Current clients include CRAY's YMP Model E based Data Migration Facility (DMF), IBM's RS/6000 based Unitree, and CONVEX based EMASS File Server software. The VolSer software provides the capability to accept client or graphical user interface (GUI) commands from the operator's console and translate them to the commands needed to control any configured archive. The VolSer system offers advanced features to enhance media handling and particularly media mounting such as: automated media migration, preferred media placement, drive load leveling, registered MediaClass groupings, and drive pooling.

Herring, Ralph H.↗

A survey of the small RNA population during far-red light-induced apical hook opening

Photomorphogenesis is a mechanism employed by plants to regulate their architecture and developmental program in response to light conditions. As they emerge into light for the first time, dark-grown seedlings employ a rapid and finely-controlled photomorphogenic signaling network. Small RNAs have increasingly been revealed to play an important role in regulating multiple aspects of plant development, by modulating the stability of mRNAs. The rapid alteration of the mRNA transcriptome is a known hallmark of the de-etiolation response, thus we investigated the small RNA transcriptome during this process in specific seedling tissues. Here we describe a survey of the small RNA expression profile in four tissues of etiolated soybean seedlings, the cotyledons, hypocotyl and the convex and concave sides of the apical hook. We also investigate how this profile responds to a 1-h far-red light treatment. Our data suggests that miRNAs show a different global profile between these tissues and treatments, suggesting a possible role for tissue- and treatment-specific expression in the differential morphology of the seedling on de-etiolation. Further evidence for the role of miRNA in light-regulated development is given by the de-etiolation responses of a hypomorphic ago1 mutant, which displays reduced and delayed photomorphogenic responses in apical hook and cotyledon angle to far-red light.

59 BASIC BIOLOGICAL SCIENCES↗