Search NASA⌕ Search

SEARCH · Search NASA

Results for “interior point”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A fast two-stage algorithm for non-negative matrix factorization in smoothly varying data

This article reports the study of algorithms for non-negative matrix factorization (NMF) in various applications involving smoothly varying data such as time or temperature series diffraction data on a dense grid of points. Utilizing the continual nature of the data, a fast two-stage algorithm is developed for highly efficient and accurate NMF. In the first stage, an alternating non-negative least-squares framework is used in combination with the active set method with a warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. Furthermore, the results demonstrate the advantage of the algorithm in finding high-precision solutions.

interior point method↗
DOE OSTI2021

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗
NASA NTRS1982

Conservative supra-characteristics method for splitting the hyperbolic systems of gasdynamics with computed boundaries for real and perfect gases

Implicit methods developed by Beam and Warming (1978 and Briley and McDonald (1977) make it possible to overcome the hyperbolic stiffness of the conservative compressible Navier-Stokes equations in the fine wall region computational mesh for high Reynold's number flow. Certain difficulties related to the use of these methods could be overcome by employing an approach reported by Roe (1981). In the present investigation Roe's conceptual framework has been adopted for constructing globally conservative finite difference methods. A globally conservative upwind finite difference method (CSCM) consisting of both implicit interior point and boundary point equations is constructed from a new characteristics based flux difference splitting. It is found that the employed upwind eigenvector split scheme which combines fully coupled implicit interior point and boundary point approximations has the desired properties of robust stability and accuracy.

Lombard, C. K.↗
NASA NTRS1995

Modified Interior Distance Functions (Theory and Methods)

In this paper we introduced and developed the theory of Modified Interior Distance Functions (MIDF's). The MIDF is a Classical Lagrangian (CL) for a constrained optimization problem which is equivalent to the initial one and can be obtained from the latter by monotone transformation both the objective function and constraints. In contrast to the Interior Distance Functions (IDF's), which played a fundamental role in Interior Point Methods (IPM's), the MIDF's are defined on an extended feasible set and along with center, have two extra tools, which control the computational process: the barrier parameter and the vector of Lagrange multipliers. The extra tools allow to attach to the MEDF's very important properties of Augmented Lagrangeans. One can consider the MIDFs as Interior Augmented Lagrangeans. It makes MIDF's similar in spirit to Modified Barrier Functions (MBF's), although there is a fundamental difference between them both in theory and methods. Based on MIDF's theory, Modified Center Methods (MCM's) have been developed and analyzed. The MCM's find an unconstrained minimizer in primal space and update the Lagrange multipliers, while both the center and the barrier parameter can be fixed or updated at each step. The MCM's convergence was investigated, and their rate of convergence was estimated. The extension of the feasible set and the special role of the Lagrange multipliers allow to develop MCM's, which produce, in case of nondegenerate constrained optimization, a primal and dual sequences that converge to the primal-dual solutions with linear rate, even when both the center and the barrier parameter are fixed. Moreover, every Lagrange multipliers update shrinks the distance to the primal dual solution by a factor 0 less than gamma less than 1 which can be made as small as one wants by choosing a fixed interior point as a 'center' and a fixed but large enough barrier parameter. The numericai realization of MCM leads to the Newton MCM (NMCM). The approximation for the primal minimizer one finds by Newton Method followed by the Lagrange multipliers update. Due to the MCM convergence, when both the center and the barrier parameter are fixed, the condition of the MDF Hessism and the neighborhood of the primal ninimizer where Newton method is 'well' defined remains stable. It contributes to both the complexity and the numerical stability of the NMCM.

Polyak, Roman A.↗
NASA NTRS1964

Discussion of the General Electric proposal to develop a computer program to select thermal coatings for passive temperature control of satellites

The General Electric Company, Missiles and Space Division, submitted/a proposal to NASA for the development of an IBM 7094 computer program which would select the exterior surface coatings for passively controlling spacecraft temperatures. G. E. claims that the "trial and error" procedures currently used can be accomplished more rationally and can therefore be programmed for a digital computer. In the ASME paper, 63-HT-41, which was presented at the ASME-AIChE Heat Transfer Conference at Boston in August, 1963, Costello, Harper, and Cline, described the procedures that have been used at G. E. to develop a coating selection program subject to the following restrictions: 1. Steady-state conditions prevail, 2. Heat transfer occurs by radiation only, 3. Temperatures are optimized at only one interior point in the spacecraft, an d 4. Only the solar absorptance of the external coatings is varied to optimize temperature. The emittance must remain constant at initially specified values. General Electric proposes to develop a generalized program in three steps: 1. The program would vary both solar absorptance and hemispherical emittance to obtain the optimum coating patterns; 2. Temperatures would be optimized at more than one interior point; and 3. The equations would be modified to account for both conduction and radiation heat transfer. In the development of the general program, the scope would be restricted to steady-state heat transfer. Since the thermal designs of most spacecraft are based primarily on nearly equilibrium conditions, the proposed program could have wide application. An obvious extension of the proposed program would be to account for transient temperatures.

IBM 7090 COMPUTER↗
DOE OSTI2026

Data for KETCHUP: Parameterizing of Large-Scale Kinetic Models Using Multiple Datasets with Different Reference States

Repository for Kinetic Estimation Tool Capturing Heterogeneous Datasets Using Pyomo (KETCHUP), a flexible parameter estimation tool that leverages a primal-dual interior-point algorithm to solve a nonlinear programming (NLP) problem that identifies a set of parameters capable of recapitulating the steady-state fluxes and concentrations in wild-type and perturbed metabolic networks. KETCHUP can use K-FIT [2] input files. Example K-FIT input files are located in the K-FIT repository at https://github.com/maranasgroup/K-FIT.

Metabolomics↗
DOE OSTI2024

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗
DOE OSTI2024

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1975

A uniformly valid solution for motion about the interior libration point of the perturbed elliptic-restricted problem

Bounded motion about Lagrange collinear libration points is considered for a perturbed elliptic-restricted problem. A practical application is the motion of a satellite near a libration point collinear with the sun and the earth-moon barycenter. Such a system is treated here as an earth-sun-satellite elliptic restricted problem with lunar perturbations. The method of dual time scales is utilized to develop a uniformly valid three-dimensional analytical solution to the satellite's equations of motion. The analytical development applies somewhat generally to that class of four-body problems where the second primary mass is much greater than the first, and the third primary mass is much greater than the second.

Richardson, D. L.↗
NASA NTRS1994

TIGGERC: Turbomachinery Interactive Grid Generator for 2-D Grid Applications and Users Guide

A two-dimensional multi-block grid generator has been developed for a new design and analysis system for studying multiple blade-row turbomachinery problems. TIGGERC is a mouse driven, interactive grid generation program which can be used to modify boundary coordinates and grid packing and generates surface grids using a hyperbolic tangent or algebraic distribution of grid points on the block boundaries. The interior points of each block grid are distributed using a transfinite interpolation approach. TIGGERC can generate a blocked axisymmetric H-grid, C-grid, I-grid or O-grid for studying turbomachinery flow problems. TIGGERC was developed for operation on Silicon Graphics workstations. Detailed discussion of the grid generation methodology, menu options, operational features and sample grid geometries are presented.

Miller, David P.↗
DOE OSTI2023

Symmetric Random Butterfly Transform (SRBT) Based Preconditioner

Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.

interior point optimization↗
NASA NTRS1987

Delayed entry of solar protons (E/p/ over 0.3 MeV) into the earth's magnetotail

The delayed entry of solar protons into the earth's magnetotail is studied using simultaneous observations from three earth-orbiting spacecraft of a number of interplanetary proton events which exhibited abrupt and relatively large discontinuities in intensity associated with magnetic field discontinuities. It is found that such protons have immediate access to the magnetosheath and that delay times increase discontinuously from essentially zero in the magnetosheath to tens of minutes as an observing point moves inward across the magnetopause. Well-defined delay times from 30 to 160 min occur for points interior to the magnetotail. The inferred entry points lie at downstream distances of 80-500 R(E). No discernible relationship is found between the direction and sense of the interplanetary magnetic field and the entry times in the northern and southern lobes of the magnetotail or the entry tiems at various distances from its central axis. These results favor some form of an open model of the magnetotail.

Van Allen, J. A.↗
NASA NTRS1992

TIGGERC: Turbomachinery interactive grid generator energy distributor and restart code

A two dimensional multi-block grid generator was developed for a new design and analysis system for studying multi-blade row turbomachinery problems with an axisymmetric viscous/inviscid 'average passage' through flow code. TIGGERC is a mouse driven, fully interactive grid generation program which can be used to modify boundary coordinates and grid packing. TIGGERC generates grids using a hyperbolic tangent or algebraic distribution of grid points on the block boundaries and the interior points of each block grid are distributed using a transfinite interpolation approach. TIGGERC generates a blocked axisymmetric H grid, C grid, I grid, or O grid for studying turbomachinery flow problems. TIGGERC was developed for operation on small high speed graphic workstations.

Miller, David P.↗
NASA NTRS1992

Sufficient conditions for a local minimum of the Bolza problem with a variable initial point

Sufficient conditions for a weak relative minimum of a form of the Bolza problem of variational calculus are derived. The variational problem considered includes arbitrary numbers of constraints on the initial and terminal points, but assumes no control constraints or interior point constraints. Testing of the second-order conditions requires the backward integration of fewer matrix elements than in the case of previously published sets of conditions. The derivation, though lengthy, is felt to be simpler in concept than previous derivations. The application of these conditions is demonstrated in the context of a simple geometric problem.

Wood, Lincoln J.↗
DOE OSTI2020

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2007

Implementation of a Point Algorithm for Real-Time Convex Optimization

The primal-dual interior-point algorithm implemented in G-OPT is a relatively new and efficient way of solving convex optimization problems. Given a prescribed level of accuracy, the convergence to the optimal solution is guaranteed in a predetermined, finite number of iterations. G-OPT Version 1.0 is a flight software implementation written in C. Onboard application of the software enables autonomous, real-time guidance and control that explicitly incorporates mission constraints such as control authority (e.g. maximum thrust limits), hazard avoidance, and fuel limitations. This software can be used in planetary landing missions (Mars pinpoint landing and lunar landing), as well as in proximity operations around small celestial bodies (moons, asteroids, and comets). It also can be used in any spacecraft mission for thrust allocation in six-degrees-of-freedom control.

Acikmese, Behcet↗
NASA NTRS1980

The Split Coefficient Matrix method for hyperbolic systems of gasdynamic equations

The Split Coefficient Matrix (SCM) finite difference method for solving hyperbolic systems of equations is presented. This new method is based on the mathematical theory of characteristics. The development of the method from characteristic theory is presented. Boundary point calculation procedures consistent with the SCM method used at interior points are explained. The split coefficient matrices that define the method for steady supersonic and unsteady inviscid flows are given for several examples. The SCM method is used to compute several flow fields to demonstrate its accuracy and versatility. The similarities and differences between the SCM method and the lambda-scheme are discussed.

Chakravarthy, S. R.↗