Search NASA⌕ Search

SEARCH · Search NASA

Results for “quadratic 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 55 records · Page 3

Optimal self-healing strategy for microgrid islanding

Renewable resource based microgrids provide reliable and cost-effective electricity with low carbon emissions. The flexibility of operating in grid-connected or islanded modes enables a microgrid to serve loads reliably. In the case of unexpected events happening to the main grid, the microgrid will isolate itself and operate in islanded mode to prevent any adversary impacts. The availability of renewable generation in the microgrid has significant impacts on the islanding strategy and different scenarios need to be considered. This study proposes a comprehensive microgrid self-healing strategy under different circumstances. The proposed strategy encompasses generation re-dispatch, network reconfiguration, and load shedding. The microgrid self-healing problem is formulated as a mixed-integer quadratic programming problem, which provides a globally optimal solution to facilitate smooth islanding of the microgrid. A modified Consortium for Electric Reliability Technology Solutions microgrid is used to conduct simulation under various scenarios. The simulation results demonstrate the efficiency of the proposed self-healing strategy in minimising costs of load shedding and generation with optimal switching actions.

optimal self-healing strategy↗

Bi-Level Volt-VAR Optimization to Coordinate Smart Inverters with Voltage Control Devices

Conservation voltage reduction (CVR) uses voltage control to reduce customer power demand and help improve the operational efficiency of the electric power distribution system. With the advent of advanced distribution management systems (ADMS), the underlying data and control-rich platform can be utilized to enable a centralized Volt-VAR optimization (VVO) scheme that includes smart inverter controls along with legacy voltage control devices such as voltage regulators and capacitor banks to ensure a maximum CVR benefit. The objective of this paper to present a VVO approach that controls system’s legacy voltage control devices and coordinates their operation with smart inverter control. An optimal power flow (OPF) formulation is proposed by developing linear and nonlinear power flow approximations for a three-phase unbalanced electric power distribution system. A bi-level VVO approach is proposed where, Level-1 optimizes the control of legacy devices and smart inverters using a linear approximate three-phase power flow. In Level-2, the control parameters for smart inverters are adjusted to obtain an optimal and feasible solution by solving the approximate nonlinear OPF model. Level-1 is modeled as a Mixed Integer Linear Program (MILP) while Level-2 as a Quadratically Constrained Quadratic Program (QCQP). The proposed approach is validated using IEEE test cases and the results demonstrate the applicability of the framework in achieving the CVR objective.

Jha, Rahul Ranjan↗

Remark on Algorithm 1012: Computing Projections with Large Datasets

In ACM TOMS Algorithm 1012, the DELAUNAYSPARSE software is given for performing Delaunay interpolation in medium to high dimensions. When extrapolating outside the convex hull of the training set, DELAUNAYSPARSE calls the nonnegative least squares solver DWNNLS to compute projections onto the convex hull. However, DWNNLS and many other available sum-of-squares optimization solvers were not intended for usage with many variable problems, which result from the large training sets that are typical in machine learning applications. Thus, a new PROJECT subroutine is given, based on the highly customizable quadratic program solver BQPD. This solution is shown to be as robust as DELAUNAYSPARSE for projection onto both synthetic and real-world datasets, where other available solvers frequently fail. Although it is intended as an update for DELAUNAYSPARSE, due to the difficulty and prevalence of the problem, this solution is likely to be of external interest as well.

97 MATHEMATICS AND COMPUTING↗

Inverse Biot–Savart Optimization for Superconducting Accelerator Magnets

Superconducting (SC) magnets for accelerator concepts are often synthesized by numerically optimizing magnetic field waveforms, a process that requires a subsequent solution of a constrained inverse problem to identify suitable SC magnet windings. When the desired field distribution is intuitive, the inverse process is facilitated by seeding preconceived coil distributions into design optimization methods for refinement. With more complex magnetic field distributions, an initial design may be unknown, and topology optimization tools are required to synthesize current distributions without a priori guidance from a subject matter expert. In this work, we develop a constrained inverse Biot-Savart topology optimization methodology that synthesizes optimal distributions of current density in racetrack-like SC coils. The problem structure is exploited through a computationally efficient quadratic programming formulation, and the method is applied to recently published magnetic field waveforms for a recirculating proton phase shifter, a proton therapy gantry, and dipole magnets with sharp field transitions. The method and results herein identify novel winding configurations that can help magnet designers bring accelerator concepts to fruition.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Distributed Load Restoration in Unbalanced Active Distribution Systems

We present that the resilience of modern power systems has been constantly threatened by various natural disasters and manmade attacks. Under those threats, fast and automatic restoration actions are critical for restoring impacted systems to normal operating conditions and preventing from additional disastrous consequences. Smart grid technologies, such as distributed energy resources (DERs) and microgrids, provide both opportunities and challenges for distribution system restoration. In this paper, distributed load restoration (DLR), in unbalanced active distribution networks is developed using the alternating direction method of multipliers (ADMM) algorithm. The step-by-step restoration actions are provided to schedule the output of DERs and distribution system control devices, as well as the power consumption from transmission system restoration. The nonlinearities from three-phase unbalanced power flow and distribution components modeling are relaxed into a convex quadratic programming model. Then, the problem is decomposed into subproblems for each node by applying ADMM-DLR; and solves through each agent by exchanging limited information with neighboring nodes in an iterative procedure. The developed models and algorithms are validated and demonstrated through testing of the IEEE 13-node and 123-node test feeders. Lastly, simulation results demonstrate the effectiveness of restoring unbalanced distribution system with the hybrid bottom-up and top-down restoration strategies.

14 SOLAR ENERGY↗

A New Proposal Generalized Predictive Control Algorithm With Polynomial Reference Tracking Applied for Sodium Fast Reactors

This paper proposes a generalized predictive control (GPC) with constraints and orthonormal Laguerre functions using the simplified model of the primary system (reactor core and intermediate heat exchanger (IHX)) of a prototypical sodium fast reactor (SFR). This paper develops a multiple-input multiple-output (MIMO) GPC with input constraints able to track polynomial references of any degree applied in coolant temperature difference across the core and fractional power. The manipulated variables of the GPC-SFR are the reactivity and the sodium flow rate of the primary and secondary pipes. Moreover, orthonormal Laguerre functions and step down condition number techniques were also applied to avoid the numerical ill-conditioning issue in quadratic programming of large systems. Thus, a GPC type-2 was designed to control fractional power, coolant temperature difference across the core and sodium tank temperature of the SFR primary system when temperature references change according to a linear ramp after reaching their steady-state operation, sustaining 100% power operation on the reactor. In order to analyze the load tracking capability of the GPC-SFR type-2, the load following from 100% fractional power (FP) to 60% FP at 0.8% FP/min rate is simulated. Constraints on the rate of coolant temperature difference across the core and reactivity were applied for the design safety. For comparison criteria, this paper compares the GPC-SFR type-2 with the GPC-SFR type-1, i.e., standard model predictive control (MPC), to verify the viability and superior performance of the proposal regarding: (a) ramp-tracking capability of temperature and load; (b) the rejections of a reactivity disturbance of -1 cent and a secondary sodium inlet temperature disturbance of +10°F; and (c) a simulation with uncertainty in reactor design. The simulations show that the GPC-SFR type-2 overcome the GPC-SFR type-1 robustness and performance.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Fused Global-Local Economic Model Predictive Control for Real-Time Eco-Optimal Control of a Heavy Duty Truck

This paper introduces a fused global-local economic model predictive control (MPC) with varying time steps for maximizing the fuel economy of a heavy-duty truck, where global MPC is performed over a long horizon using cloud-based dynamic programming (DP), and local MPC is performed on-board the vehicle using sequential quadratic programming (SQP). Because of the computational complexity of DP, an in-depth analysis of how the discretization levels, time constant, and horizon length influence the energy savings and computational complexity of online DP has been performed. The fused optimization technique has been evaluated over different route profiles, accounting for traffic, using a medium-fidelity proprietary Volvo model. Results show 4-7% fuel savings, as compared to a baseline model.

33 ADVANCED PROPULSION SYSTEMS↗

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

Optimizing HVAC Operations in Multi-unit Buildings for Grid Demand Response

The thermal inertia of buildings, along with the flexibility associated with thermostatically controlled loads (TCL) allows heating ventilation and cooling (HVAC) systems to be used for grid demand response (DR). In this work, we consider an HVAC system that serves multiple units in a residential building to meet their space heating requirements. We aim to determine the optimal power flow to each unit that minimizes the power costs incurred by the building's occupants while keeping in consideration their thermal comfort. The DR program is assumed to allow the building temperatures to deviate from the set-points up to a maximum limit. Despite the complex, non-linear structure of the problem, we show how the optimal solutions can be obtained efficiently using quadratic programming. Since HVAC systems can run on either electricity or natural gas, we study the efficacy of the DR regime for both hourly electricity prices and flat gas prices over the course of 24 hours. Finally, we run simulations to determine the optimal thermal power and the evolution of unit temperatures for various energy pricing schemes.

Naqvi, Syed A.↗

Multilane Automated Driving With Optimal Control and Mixed-Integer Programming

Road vehicle lane changes often initiate traffic disturbances and can therefore impact road networks’ energy and time efficiency. Furthermore, unexpected changes in traffic conditions may also render lane changes counterproductive for the lane-changing vehicle. Vehicle-to-vehicle connectivity combined with anticipative control could address these challenges via improved lane change decisions by automated vehicles. In a move toward this objective, receding horizon control cast as a mixed-integer quadratic program is used to plan lane changing and acceleration in a coupled optimization. A long-term pacing module, based on Pontryagin’s minimum principle from optimal control theory, sets terminal and input references for receding horizon control to target a user’s expected travel time. To remove nonlinear vehicle dynamics from the receding horizon controller, lane change commands are passed to a pure pursuit steering module whose response is approximated by a second-order linear model. Here, comparison against a rule-based reactive algorithm in arterial and highway scenarios shows an 8.9%–13.7% reduction in energy consumption and a 5.2%–10.3% reduction in the travel time, along with navigational improvements.

33 ADVANCED PROPULSION SYSTEMS↗

An augmented Lagrangian filter method

Here, we introduce a filter mechanism to enforce convergence for augmented Lagrangian methods for nonlinear programming. In contrast to traditional augmented Lagrangian methods, our approach does not require the use of forcing sequences that drive the first-order error to zero. Instead, we employ a filter to drive the optimality measures to zero. Our algorithm is flexible in the sense that it allows for equality-constrained quadratic programming steps to accelerate local convergence. We also include a feasibility restoration phase that allows fast detection of infeasible problems. We provide a convergence proof that shows that our algorithm converges to first-order stationary points. We provide preliminary numerical results that demonstrate the effectiveness of our proposed method.

97 MATHEMATICS AND COMPUTING↗

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.

97 MATHEMATICS AND COMPUTING↗

A Bi-Level Formulation And Solution Method For The Integration Of Process Design And Scheduling

Design and operation decisions of manufacturing plants can often be expressed within a hierarchical structure, where optimal decisions at lower operating level provide constraints for the decision raking at a higher decision level. In this work, we are addressing the case of a hierarchical design and scheduling optimization problem. The integration of design and scheduling decisions can play a big role in designing economically profitable plants and improving their operational performance. This problem can be expressed as a bi-level problem, where design related decisions occur at the upper level and operational scheduling decisions at the lower level. Since discrete decisions are involved in both optimization levels, the resulting formulation typically corresponds to bi-level mixed-integer programming problems (B-MIP). The solution of B-MIP problems is very challenging, and typically requires the use of global optimization techniques, with many algorithms not able to guarantee feasibility. To overcome the challenges in solving this class of problems we propose the use of a multi-parametric based algorithm for the solution of bi-level mixed-integer linear and quadratic programming problems, capable of providing the exact and global solution. The main idea of this approach is to treat the lower scheduling problem as a multi-parametric programming problem in which the design decisions are considered as parameters. Here, the resulting parametric solutions can then be substituted into the upper level design problem, which can be solved as a set of single-level deterministic programming problems. Through the developed formulation and algorithm we are able to supply the decision makers with the exact solution of the integrated design and scheduling problem.

42 ENGINEERING↗

Predictively Coordinated Vehicle Acceleration and Lane Selection Using Mixed Integer Programming

Autonomous vehicle technology provides the means to optimize motion planning beyond human capacity. In particular, the problem of navigating multi-lane traffic optimally for trip time, energy efficiency, and collision avoidance presents challenges beyond those of single-lane roadways. For example, the host vehicle must simultaneously track multiple obstacles, the drivable region is non-convex, and automated vehicles must obey social expectations. Furthermore, reactive decision-making may result in becoming stuck in an undesirable traffic position. This paper presents a fundamental approach to these problems using model predictive control with a mixed integer quadratic program at its core. Lateral and longitudinal movements are coordinated to avoid collisions, track a velocity and lane, and minimize acceleration. Vehicle-to-vehicle connectivity provides a preview of surrounding vehicles’ motion. Simulation results show a 79% reduction in congestion-induced travel time and an 80% decrease in congestion-induced fuel consumption compared to a rule-based approach.

Dollar, Robert Austin↗

A nonsmooth nonconvex optimization algorithm for two-stage optimization problems

An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems include (1) the problems lack the popular lower-type properties such as prox-regularity assumed in many nonsmooth nonconvex optimization algorithms, (2) the objective can not be analytically expressed and (3) the evaluation of function values and subgradients are computationally expensive. To address these challenges, this report first examines the properties that exist in many two-stage problems, specifically upper-C 2 objectives. Then, we show that quadratic penalty method for securityconstrained alternating current optimal power flow (SCACOPF) contingency problems can make the contingency solution functions upper-C 2 . Based on these observations, a simplified bundle algorithm that bears similarity to sequential quadratic programming (SQP) method is proposed. It is more efficient in implementation and computation compared to conventional bundle methods. Global convergence analysis of the algorithm is presented under novel and reasonable assumptions. The proposed algorithm therefore fills the gap of theoretical convergence for smoothed SCACOPF problems. The inconsistency that might arise in our treatment of the constraints are addressed through a penalty algorithm whose convergence analysis is also provided. Finally, theoretical capabilities and numerical performance of the algorithm are demonstrated through numerical examples.

97 MATHEMATICS AND COMPUTING↗

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

Explicit model predictive control through robust optimization

A strategy that calculates an explicit state feedback policy to regulate constrained uncertain discrete‐time uncertain linear systems is presented. We consider uncertain processes, affected by box‐bounded multiplicative uncertainty as well as bounded additive uncertainty with linear state and inputs constraints. The proposed method includes (i) the calculation of a terminal set constraint and (ii) the robust reformulation of state constraints in the prediction horizon. These features allow the derivation of the desired policy by solving a single multiparametric quadratic programming problem that guarantees feasible operation in the presence of uncertainty. Additionally, we employ variable and constraint elimination approaches to enhance the computational performance of the strategy. We demonstrate the steps and benefits of these developments with a numerical example and a chemical engineering case study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗