Search NASA⌕ Search

SEARCH · Search NASA

Results for “Interior point methods”

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 55 records · Page 3

Data Driven Optimization Framework for Volt-age Regulation in Distribution Systems

This letter proposes a data-driven optimization framework for voltage regulation problems to address the challenge of model inaccuracy and parameter varying. To achieve online voltage optimization, the recursive kernel regression and interior point methods are integrated. The IEEE 123-Bus system and EPRI Ckt5 feeder are selected to validate the effectiveness of the proposed data-driven optimization framework. The proposed method is also compared with a linear function based method.

Hong, Tianqi↗

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

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↗

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.↗

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme

A constraint-reduced Mehrotra-predictor-corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality constraints in constructing the search direction, resulting in CPU savings.) The proposed algorithm makes use of a regularization scheme to cater to cases where the reduced constraint matrix is rank deficient. Global and local convergence properties are established under arbitrary working-set selection rules subject to satisfaction of a general condition. A modified active-set identification scheme that fulfills this condition is introduced. Numerical tests show great promise for the proposed algorithm, in particular for its active-set identification scheme. While the focus of the present paper is on dense systems, application of the main ideas to large sparse systems is briefly discussed.

97 MATHEMATICS AND COMPUTING↗

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↗

The computation of steady nozzle flow by a time-dependent method

The steady flow in two-dimensional and axisymmetric nozzles was computed using a time-dependent method. In this method the interior mesh points were computed using the MacCormack finite-difference scheme, while a characteristic scheme was used to calculate the boundary mesh points. No explicit artificial viscosity term was included. The fluid was assumed to be a perfect gas. This method was used to compute the flow in a 45 deg - 15 deg conical, converging-diverging nozzle, a 15 deg conical, converging nozzle, and a 10 deg conical, plug nozzle. Good agreement between the numerical solution and experimental data was found. In contrast to previous time-dependent methods, the computational times were less than one minute on a CDC 6600 computer.

Cline, M. C.↗

ACCESS 3. Approximation concepts code for efficient structural synthesis: User's guide

A user's guide is presented for ACCESS-3, a research oriented program which combines dual methods and a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and dual algorithms of mathematical programming are applied in the design optimization procedure. This program retains all of the ACCESS-2 capabilities and the data preparation formats are fully compatible. Four distinct optimizer options were added: interior point penalty function method (NEWSUMT); second order primal projection method (PRIMAL2); second order Newton-type dual method (DUAL2); and first order gradient projection-type dual method (DUAL1). A pure discrete and mixed continuous-discrete design variable capability, and zero order approximation of the stress constraints are also included.

Fleury, C.↗

A modified homotopy method for solving the principal-agent bilevel programming problem

In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.

97 MATHEMATICS AND COMPUTING↗

Continued Development of the Discontinuous Galerkin Method for Computational Aeroacoustic Applications

The formulation and the implementation of boundary conditions within the context of the quadrature-free form of the discontinuous Galerkin method are presented for several types of boundary conditions for the Euler equations. An important feature of the discontinuous Galerkin method is that the interior point algorithm is well behaved in the neighborhood of the boundary and requires no modifications. This feature leads to a simple and accurate treatment for wall boundary conditions and simple inflow and outflow boundary conditions. Curved walls are accurately treated with only minor changes to the implementation described in earlier work. The 'perfectly matched layer' approach to nonreflecting boundary conditions is easily applied to the discontinuous Galerkin. The compactness of the discontinuous Galerkin method makes it better suited for buffer-zone-type methods than high-order finite-difference methods. Results are presented for wall, characteristic inflow and outflow, and nonreflecting boundary conditions.

Atkins, H. L.↗

Curvature continuity in arbitrary bicubic Bezier patches

Two methods are outlined for imposing interpatch curvature continuity in existing Bezier bicubic patch surfaces. Each method assumes that coordinates of the corners of the patches can not be altered but the interior Bezier control point can. Each method also preserves outer edge slope and outer corner twist derivatives. Neither method requires intersection or C0 continuity nor slope or C1 continuity at the start. A computer program for each method is given in the appendices.

Roach, Robert L.↗

Navier-Stokes flowfield computation of wing/rotor interaction for a tilt rotor aircraft in hover

The download on the wing produced by the rotor-induced downwash of a tilt rotor aircraft in hover is of major concern because of its severe impact on payload-carrying capability. A method has been developed to help gain a better understanding of the fundamental fluid dynamics that causes this download, and to help find ways to reduce it. In particular, the method is employed in this work to analyze the effect of a tangential leading edge circulation-control jet on download reduction. Because of the complexities associated with modeling the complete configuration, this work focuses specifically on the wing/rotor interaction of a tilt rotor aircraft in hover. The three-dimensional, unsteady, thin-layer compressible Navier-Stokes equations are solved using a time-accurate, implicit, finite difference scheme that employs LU-ADI factorization. The rotor is modeled as an actuator disk which imparts both a radical and an azimuthal distribution of pressure rise and swirl to the flowfield. A momentum theory blade element analysis of the rotor is incorporated into the Navier-Stokes solution method. Solution blanking at interior points of the mesh has been shown here to be an effective technique in introducing the effects of the rotor and tangential leading edge jet. Results are presented both for a rotor alone and for wing/rotor interaction. The overall mean characteristics of the rotor flowfield are computed including the flow acceleration through the rotor disk, the axial and swirl velocities in the rotor downwash, and the slipstream contraction. Many of the complex tilt rotor flow features are captured including the highly three-dimensional flow over the wing, the recirculation fountain at the plane of symmetry, wing leading and trailing edge separation, and the large region of separated flow beneath the wing. Mean wing surface pressures compare fairly well with available experimental data, but the time-averaged download/thrust ratio is 20-30 percent higher than the measured value. The discrepancy is due to a combination of factors that are discussed. Leading edge tangential blowing, of constant strength along the wing span, is shown to be effective in reducing download. The jet serves primarily to reduce the pressure on the wing upper surface. The computation clearly shows that, because of the three-dimensionality of the flowfield, optimum blowing would involve a spanwise variation in blowing strength.

Fejtek, Ian G.↗

A New Method for the Accurate Calculation of Derivatives at Structured Multiblock Grid Singularities

The new Structured Mapping At Reduced dimension Topology elements (SMART) method for the accurate calculation of derivatives at multiblock structured grid block interfaces is presented. In the SMART method, a ’local’ curvilinear mapping is defined at each interface point, giving a consistent multidimensional definition of the derivatives. The resulting system of equations is overdetermined, and a least squares method is used to determine the value of the derivatives in the local coordinate system. In the special case of a nonsingular interface point, the SMART method automatically recovers the spatial differencing stencils used at the interior points in the neighboring grid blocks.

Computational Aeroacoustics↗

A new measurement method for separating airborne and structureborne aircraft interior noise

It is pointed out that interior noise levels of propeller driven aircraft are substantially higher than levels measured for other types of CTOL aircraft. Reduction of interior noise of such aircraft requires a knowledge of the relative importance of the acoustic and structural noise transmission paths. Noise entering the aircraft interior via an acoustic path is the noise radiated by an external noise source (propellers, exhaust noise), which propagates through the acoustic medium (air) and is then transmitted through the aircraft fuselage. This type of incoming noise is referred to as airborne noise. Noise entering the aircraft interior via a structural path is the noise which has its source in the vibrational energy which has been transmitted through the structure from a remote vibrational energy source (engines, wind flutter). This type of incoming noise is referred to as structureborne noise. A new method for separating airborne and structureborne noise is presented. It is based on two-microphone cross spectral acoustic intensity measurements.

Mcgary, M. C.↗

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.↗

Patched-grid calculations with the Euler and Navier-Stokes equations: Theory and application

The Rai (1984,85) patch-boundary scheme for the Euler equations is described. The integration methods used to update the interior grid points are are discussed. Stability of patch-boundary schemes and the use of these schemes in Navier-Stokes calculations are mentioned. Results for inviscid, supersonic flow over a cylinder, blast wave diffraction by ramp, and the motion of a vortex in a freestream are presented. These test cases demonstrate the quality of solutions possible with the scheme.

Rai, M. M.↗