Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear programming problem”

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 73 records · Page 4

Numerical Experiments with a Continuous L{sub 2}-exponential Merit Function for Semi-Infinite Programming

Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L{sub 2}-exponential merit function. The proposed merit function is continuous for SIP and improves the algorithm efficiency when compared with other previously tested merit functions. A comparison with other reduction methods is also included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model reduction in integrated controls-structures design

It is the objective of this paper to present a model reduction technique developed for the integrated controls-structures design of flexible structures. Integrated controls-structures design problems are typically posed as nonlinear mathematical programming problems, where the design variables consist of both structural and control parameters. In the solution process, both structural and control design variables are constantly changing; therefore, the dynamic characteristics of the structure are also changing. This presents a problem in obtaining a reduced-order model for active control design and analysis which will be valid for all design points within the design space. In other words, the frequency and number of the significant modes of the structure (modes that should be included) may vary considerably throughout the design process. This is also true as the locations and/or masses of the sensors and actuators change. Moreover, since the number of design evaluations in the integrated design process could easily run into thousands, any feasible order-reduction method should not require model reduction analysis at every design iteration. In this paper a novel and efficient technique for model reduction in the integrated controls-structures design process, which addresses these issues, is presented.

Maghami, Peiman G.↗

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↗

Control design variable linking for optimization of structural/control systems

A method is presented to integrate the design space of structural/control system optimization problems in the case of linear state feedback control. Conventional structural sizing variables and elements of the feedback gain matrix are both treated as strictly independent design variables in optimization by extending design variable linking concepts to the control gains. Several approximation concepts including new control design variable linking schemes are used to formulate the integrated structural/control optimization problem as a sequence of explicit nonlinear mathematical programming problems. Examples which involve a variety of behavior constraints, including constraints on dynamic stability, damped frequencies, control effort, peak transient displacement, acceleration, and control force limits, are effectively solved by using the method presented.

Jin, Ik Min↗

Optimal finite-thrust spacecraft trajectories using collocation and nonlinear programming

A new method is described for the determination of optimal spacecraft trajectories in an inverse-square field using finite, fixed thrust. The method employs a recently developed optimization technique which uses a piecewise polynomial representation for the state and controls, and collocation, thus converting the optimal control problem into a nonlinear programming problem, which is solved numerically. This technique has been modified to provide efficient handling of those portions of the trajectory which can be determined analytically, i.e., the coast arcs. Among the problems that have been solved using this method are optimal rendezvous and transfer (including multirevolution cases) and optimal multiburn orbit insertion from hyperbolic approach.

Enright, Paul J.↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Direct Method Transcription for a Human-Class Translunar Injection Trajectory Optimization

This paper presents a new trajectory optimization software package developed in the framework of a low-to-high fidelity 3 degrees-of-freedom (DOF)/6-DOF vehicle simulation program named Mission Analysis Simulation Tool in Fortran (MASTIF) and its application to a translunar trajectory optimization problem. The functionality of the developed optimization package is implemented as a new "mode" in generalized settings to make it applicable for a general trajectory optimization problem. In doing so, a direct optimization method using collocation is employed for solving the problem. Trajectory optimization problems in MASTIF are transcribed to a constrained nonlinear programming (NLP) problem and solved with SNOPT, a commercially available NLP solver. A detailed description of the optimization software developed is provided as well as the transcription specifics for the translunar injection (TLI) problem. The analysis includes a 3-DOF trajectory TLI optimization and a 3-DOF vehicle TLI simulation using closed-loop guidance.

Witzberger, Kevin E.↗

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem that requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.

47 OTHER INSTRUMENTATION↗

Solution of transient optimization problems by using an algorithm based on nonlinear programming

An algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine.

Teren, F.↗

A VSM-Based DER Dispatch MINLP for Volt-VAR Control in Unbalanced Power Distribution Systems

This paper presents an optimal dispatch algorithm to coordinate customer-owned controllable loads and smart solar inverters with utility-owned voltage regulators and capacitors to meet voltage control objectives. The optimization problem is formulated as a mixed-integer nonlinear programming (MINLP) problem. A voltage sensitivity matrix (VSM) is used to linearize the effect of control actions on the voltage at customer nodes when solving the MINLP. The VSM is recalculated at each time step to improve the computational accuracy. Both discrete switching actions of the capacitor and VRs and the continuous adjustment of real and reactive power from load and smart inverters are considered in the MINLP volt-var problem formulation. The objective function minimizes the cost of all control actions and the magnitude of voltage fluctuations from the previous time period. Constraints ensure that the voltage at each node is maintained within ANSI limits and the feeder power factor is controlled within the desired range. The algorithm is tested using an actual 3-phase unbalanced distribution feeder model. Simulation results demonstrate that the proposed algorithm is computationally feasible on real circuits and improves voltage control while minimizing operational costs.

McEntee, Catie↗

Prediction of Natural Frequency and Buckling Load Variability due to Uncertainty in Material Properties by Convex Modeling

Composite materials are widely used in various types of engineering structures. To a large extent, the properties of composite materials are dependent on the fabrication process. But even the composite materials manufactured by the same process may demonstrate differences in their elastic properties. For design purposes, one should be aware of the potential variations in load-carrying capacity and dynamic behavior of such structures that can arise due to the uncertainty in elastic moduli. A more realistic analysis of composite structures should be performed with the variations of the elastic moduli being taken into consideration at the same time. The present paper is a generalization of a study where the influence of uncertainty in elastic moduli on the axial buckling load was discussed. Here, we consider another case of buckling, shells under uniform external pressure. In addition, this paper deals with the variability of natural frequencies by use of convex modeling, which is apparently the first study of this kind in the literature. A numerical approach to the uncertainty problem is nonlinear programming, which we apply to solve the same problem to generate a set of comparable numerical data. The results from both methods show good agreement throughout. Thus, the effectiveness of the analytic convex modeling is clearly demonstrated. The bounds of he natural frequency and the buckling load provide the designer with a better view of the vibrational behavior and the actual load carrying capacities possessed by the composite structure.

Li, Y. W.↗

Solution of transient optimization problems by using an algorithm based on nonlinear programming

A new algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine.

Teren, F.↗

Mathematical programming formulations for satellite synthesis

The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.

Bhasin, Puneet↗

Optimization strategies for the vulnerability analysis of the electric power grid.

Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerability analysis can be studied as a mixed integer nonlinear programming (minlp) problem. Our analysis reveals a special structure in the formulation that can be exploited to avoid nonlinearity and approximate the original problem as a pure combinatorial problem. The key new observation behind our analysis is the correspondence between the Jacobian matrix (a representation of the feasibility boundary of the equations that describe the flow of power in the network) and the Laplacian matrix in spectral graph theory (a representation of the graph of the power grid). The reduced combinatorial problem is known as the network inhibition problem, for which we present a mixed integer linear programming formulation. Our experiments on benchmark power grids show that the reduced combinatorial model provides an accurate approximation, to enable vulnerability analyses of real-sized problems with more than 10,000 power lines.

99 GENERAL AND MISCELLANEOUS↗

Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints

Here, we propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current (AC) model of the transmission network, which is a nonconvex mixed-integer nonlinear programming (MINLP) problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with AC power flow constraints (UC-AC) and leverage second-order cone relaxations, piecewise outer approximations, and optimization-based bounds tightening to guarantee a globally optimal solution at convergence. Numerical results on four benchmark problems illustrate the effectiveness of our algorithm, both in terms of convergence rate and solution quality.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Constrained optimization for image restoration using nonlinear programming

The constrained optimization problem for image restoration, utilizing incomplete information and partial constraints, is formulated using nonlinear proramming techniques. This method restores a distorted image by optimizing a chosen object function subject to available constraints. The penalty function method of nonlinear programming is used. Both linear or nonlinear object function, and linear or nonlinear constraint functions can be incorporated in the formulation. This formulation provides a generalized approach to solve constrained optimization problems for image restoration. Experiments using this scheme have been performed. The results are compared with those obtained from other restoration methods and the comparative study is presented.

Yeh, C.-L.↗

Grid Optimization Lawrence Livermore Nonlinear Programming

Modelling and solution library for security-constrained AC optimal power flow problems that uses nonlinear programming methods (interior-point methods) and solvers (Ipopt, HiOp). The code is written in C++ and provides parallel computing capabilities in the form of task parallelism (solving contingency problems in parallel). Code can run on a variety of commodity high-performance computing.

Petra, CosminG↗