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 145 records · Page 8

Cybersecurity Enhancement for Multi-Infeed High-Voltage DC Systems

Composed of multiple two-terminal high-voltage DC (HVDC) transmission systems, a multi-infeed HVDC (MIDC) system exchanges massive power among multiple asynchronous AC systems. However, as an intrinsically cyber-physical system, an MIDC system could suffer from cyber-attacks, leading to massive power mismatches in multiple AC systems, and resulting in catastrophic consequences. Since the sequential responses of an MIDC system and interconnected AC systems are in different timescales, this paper first establishes a two-timescale model to evaluate the sequential impacts caused by cyber-attacks. Then, an event-triggered cyber-defense strategy is proposed to enhance the cybersecurity of an MIDC system by mitigating multiple non-simultaneous cyber-attacks. Whenever new cyber-attack events occur, the proposed cyber-defense strategy, which is mathematically modeled as a mixed-integer quadratic programming problem, is executed on-line and updated in an event-triggered manner. Here, simulation results on an MIDC system demonstrate that the low-cost and almost blind cyber-attacks can cause severe frequency deviations, and the proposed strategy can mitigate multi-cyber-attacks effectively.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Nonlinear Multiobjective MPC-Based Optimal Operation of a High Consistency Refining System in Papermaking

As one of the most important unit in the papermaking industry, the high consistency (HC) refining system is confronted with challenges such as improving pulp quality, energy saving, and emissions reduction in its operation processes. Here in this correspondence, an optimal operation of HC refining system is presented using nonlinear multiobjective model predictive control strategies that aim at set-point tracking objective of pulp quality, economic objective, and specific energy (SE) consumption objective, respectively. First, a set of input and output data at different times are employed to construct the subprocess model of the state process model for the HC refining system, and then the Wiener-type model can be obtained through combining the mechanism model of Canadian Standard Freeness and the state process model that determines their structures based on Akaike information criterion. Second, the multiobjective optimization strategy that optimizes both the set-point tracking objective of pulp quality and SE consumption is proposed simultaneously, which uses NSGA-II approach to obtain the Pareto optimal set. Furthermore, targeting at the set-point tracking objective of pulp quality, economic objective, and SE consumption objective, the sequential quadratic programming method is utilized to produce the optimal predictive controllers. In conclusion, the simulation results demonstrate that the proposed methods can make the HC refining system provide a better performance of set-point tracking of pulp quality when these predictive controllers are employed. In addition, while the optimal predictive controllers orienting with comprehensive economic objective and SE consumption objective, it has been shown that they have significantly reduced the energy consumption.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Control of Three Degrees-of-Freedom Wave Energy Converters Using Pseudo-Spectral Methods

This study presents a solution to the optimal control problem of a three degrees-of-freedom (3DOF) wave energy converter (WEC). The three modes are the heave, pitch, and surge. The dynamic model is characterized by a coupling between the pitch and surge modes, while the heave is decoupled. The heave, however, excites the pitch motion through nonlinear parametric excitation in the pitch mode. This paper uses Fourier series (FS) as basis functions to approximate the states and the control. A simplified model is first used where the parametric excitation term is neglected and a closed-form solution for the optimal control is developed. For the parametrically excited case, a sequential quadratic programming approach is implemented to solve for the optimal control numerically. Numerical results show that the harvested energy from three modes is greater than three times the harvested energy from the heave mode alone. Moreover, the harvested energy using a control that accounts for the parametric excitation is significantly higher than the energy harvested when neglecting this nonlinear parametric excitation term.

16 TIDAL AND WAVE POWER↗

An on-line replanning method for head and neck adaptive radiotherapy

Daily setup for head and neck (HN) radiotherapy (RT) can vary randomly due to neck rotation and anatomy change. These differences cannot be totally corrected by the current practice of image guided RT with translational repositioning. The authors present a novel rapid correction scheme that can be used on-line to correct both interfractional setup variation and anatomy change for HN RT. The scheme consists of two major steps: (1) Segment aperture morphing (SAM) and (2) segment weight optimization (SWO). SAM is accomplished by applying the spatial relationship between the apertures and the contours of the planning target and organs at risk (OARs) to the new target and OAR contours. The new target contours are transferred from planning target contours to the CT of the day by means of deformable registration (MIMVISTA). The dose distribution for each new aperture was generated using a planning system with a fast dose engine and hardware and was input into a newly developed SWO package using fast sequential quadratic programming. The entire scheme was tested based on the daily CT images acquired for representative HN IMRT cases treated with a linac and CT-on-Rails combo. It was found that the target coverage and/or OAR sparing was degraded based on the CT of the day with the current standard repositioning from rigid registration. This degradation can be corrected by the SAM/SWO scheme. The target coverage and OAR sparing for the SAM/SWO plans were found to be equivalent to the original plan. The SAM/SWO process took 5-8 min for the head and neck cases studied. The proposed aperture morphing with weight optimization is an effective on-line approach for correcting interfractional patient setup and anatomic changes for head and neck cancer radiotherapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Two-dimensional inverse planning and delivery with a preclinical image guided microirradiator

Purpose: Recent advances in preclinical radiotherapy systems have provided the foundation for scaling many of the elements of clinical radiation therapy practice to the dimensions and energy demanded in small animal studies. Such systems support the technical capabilities to accurately deliver highly complex dose distributions, but methods to optimize and deliver such distributions remain in their infancy. This study developed an optimization method based on empirically measured two-dimensional dose kernel measurements to deliver arbitrary planar dose distributions on a recently developed small animal radiotherapy platform.Methods: A two-dimensional dose kernel was measured with repeated radiochromic film measurements for the circular 1 mm diameter fixed collimator of the small animal radiotherapy system at 1 cm depth in a solid water phantom. This kernel was utilized in a sequential quadratic programming optimization framework to determine optimal beam positions and weights to deliver an arbitrary desired dose distribution. The positions and weights were then translated to a set of stage motions to automatically deliver the optimized dose distribution. End-to-end efficacy of the framework was quantified through five repeated deliveries of two dosimetric challenges: (1) a 5 mm radius bullseye distribution, and (2) a “sock” distribution contained within a 9 × 13 mm bounding box incorporating rectangular, semicircular, and exponentially decaying geometric constructs and a rectangular linear dose gradient region. These two challenges were designed to gauge targeting, geometric, and dosimetric fidelity.Results: Optimization of the bullseye and sock distributions required 2.1 and 5.9 min and utilized 50 and 77 individual beams for delivery, respectively. Automated delivery of the resulting optimized distributions, validated using radiochromic film measurements, revealed an average targeting accuracy of 0.32 mm, and a dosimetric delivery error along four line profiles taken through the sock distribution of 3.9%. Mean absolute delivery error across the 0–1 Gy linear dose gradient over 7.5 mm was 0.01 Gy.Conclusions: The work presented here demonstrates the potential for complex dose distributions to be planned and automatically delivered with millimeter scale heterogeneity at submillimeter accuracy. This capability establishes the technical foundation for preclinical validation of biologically guided radiotherapy investigations and development of unique radiobiological experiments.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-I-76: Matching Primary and Scattered X-Ray Spectra for Use in Calculating the Diagnostic Radiation Index of Protection

Purpose: Lightweight lead-free or lead-composite protective garments exploit k-edge interactions to attenuate scattered X-rays. Manufacturers specify the protective value of garments in terms of lead equivalence at a single kVp. This is inadequate, as the protection provided by such garments varies with radiation quality in different use conditions. We present a method for matching scattered X-ray spectra to primary X-ray spectra. The resulting primary spectra can be used to measure penetration through protective garments, and such measurements can be weighted and summed to determine a Diagnostic Radiation Index for Protection (DRIP). Methods: Scattered X-ray spectra from fluoroscopic procedures were modeled using Monte Carlo techniques in MCNP-X 2.7. Data on imaging geometry, operator position, patient size, and primary beam spectra were gathered from clinical fluoroscopy procedures. These data were used to generate scattered X-ray spectra resulting from procedural conditions. Technical factors, including kV and added filtration, that yielded primary X-ray spectra that optimally matched the generated scattered X-ray spectra were identified through numerical optimization using a sequential quadratic programming (SQP) algorithm. Results: The primary spectra generated with shape functions matched the relative flux in each bin of the scattered spectra within 5%, and half and quarter-value layers matched within 0.1%. The DRIP for protective garments can be determined by measuring the penetration through protective garments using the matched primary spectra, then calculating a weighted average according to the expected clinical use of the garment. The matched primary spectra are specified in terms of first and second half-value layers in aluminum and acrylic. Conclusion: Lead equivalence is inadequate for completely specifying the protective value of garments. Measuring penetration through a garment using full scatter conditions is very difficult. The primary spectra determined in this work allow for practical primary penetration measurements to be made with equipment readily available to clinical medical physicists.

61 RADIATION PROTECTION AND DOSIMETRY↗

TH-E-17A-05: Optimizing Four Dimensional Cone Beam Computed Tomography Projection Allocation to Respiratory Bins

Purpose: Four dimensional cone beam computed tomography (4DCBCT) is an emerging image guidance strategy but it can suffer from poor image quality. To avoid repeating scans it is beneficial to make the best use of the imaging data obtained. For conventional 4DCBCT the location and size of respiratory bins is fixed and projections are allocated to the respiratory bin within which it falls. Strictly adhering to this rule is unnecessary and can compromise image quality. In this study we optimize the size and location of respiratory bins and allow projections to be sourced from adjacent phases of the respiratory cycle. Methods: A mathematical optimization framework using mixed integer quadratic programming has been developed that determines when to source projections from adjacent respiratory bins and optimizes the size and location of the bins. The method, which we will call projection sharing, runs in under 2 seconds of CPU time. Five 4DCBCT datasets of stage III-IV lung cancer patients were used to test the algorithm. The standard deviation of the angular separation between projections (SD-A) and the standard deviation in the volume of the reconstructed fiducial gold coil (SD-V) were used as proxies to measure streaking artefacts and motion blur respectively. Results: The SD-A using displacement binning and projection sharing was 30%–50% smaller than conventional phase based binning and 59%–76% smaller than conventional displacement binning indicating more uniformly spaced projections and fewer streaking artefacts. The SD-V was 20–90% smaller when using projection sharing than using conventional phase based binning suggesting more uniform marker segmentation and less motion blur. Conclusion: Image quality was visibly and significantly improved with projection sharing. Projection sharing does not require any modifications to existing hardware and offers a more robust replacement to phase based binning, or, an option if phase based reconstruction is not of a suitable quality. This project is supported by an NHMRC Australia Fellowship and NHMRC project grant number 1034060.

60 APPLIED LIFE SCIENCES↗

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗

Joint Optimization Scheme for the Planning and Operations of Shared Autonomous Electric Vehicle Fleets Serving Mobility on Demand

As the transportation sector undergoes three major transformations—electrification, shared/on-demand mobility, and automation—there are new challenges to analyzing the impacts of these trends on both the transportation system and the power sector. Most models that analyze the requirements of fleets of shared autonomous electric vehicles (SAEVs) operate at the scale of an urban region, or smaller. A quadratically constrained, quadratic programming problem is formulated, designed to model the requirements of SAEVs at a national scale. The size of the SAEV fleet, the necessary charging infrastructure, the fleet charging schedule, and the dispatch required to serve demand for trips in a region are treated as decision variables. By minimizing both the amortized cost of the fleet and chargers as well as the operational costs of charging, it is possible to explore the coupled interactions between system design and operation. To apply the model at a national scale, key complications about fleet operations are simplified; but a detailed agent-based regional simulation model to parameterize those simplifications is leveraged. Preliminary results are presented, finding that all mobility in the United States (U.S.) currently served by 276 million personally owned vehicles could be served by 12.5 million SAEVs at a cost of $\$ 0.27$/vehicle-mile or $ 0.18/passenger-mile. In conclusion, the energy requirements for this fleet would be 1142 GWh/day (8.5% of 2017 U.S. electricity demand) and the peak charging load 76.7 GW (11% of U.S. power peak). Several model sensitivities are explored, and it is found that sharing is a key factor in the analysis.

33 ADVANCED PROPULSION SYSTEMS↗

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗

E-PVT: enhanced position-velocity-time scheduler for computer-controlled optical finishing with comprehensive considerations of dynamics constraints, continuity and efficiency

Deterministic computer-controlled optical finishing is an essential approach for achieving high-quality optical surfaces. Its determinism and convergence rely heavily on precise and smooth motion control to guide the machine tool over an optical surface to correct residual errors. One widely supported and smooth motion control model is position-velocity-time (PVT), which employs piecewise cubic polynomials to describe positions. Our prior research introduced a PVT-based velocity scheduling method, demonstrating sub-nanometer level convergence in ion beam figuring (IBF) processes. However, three challenges remained. Firstly, this method relies on quadratic programming, resulting in computational intensiveness for dense tool paths. Secondly, the dynamics constraints and velocity and acceleration continuities are not comprehensively considered, limiting the full potential of PVT-based control. Thirdly, no compensation mechanism existed when dynamics constraints are exceeded. In this study, in response to these challenges, we proposed the Enhanced PVT (E-PVT) method, reducing the time complexity from O ( n 3 ) to O ( n ) while fully addressing dynamics constraints and continuities. A novel compensation method utilizing particle swarm optimization was proposed to address situations where dynamics constraints might be exceeded while maintaining the overall processing efficiency. Validation through simulation and experimentation confirmed the improved performance of E-PVT.

36 MATERIALS SCIENCE↗

Numerical study of a matrix-free trust-region SQP method for equality constrained optimization

This is a companion publication to the paper 'A Matrix-Free Trust-Region SQP Algorithm for Equality Constrained Optimization' in which we develop and analyze a trust-region sequential quadratic programming (SQP) method that supports the matrix-free (iterative, in-exact) solution of linear systems. In this report, we document the numerical behavior of the algorithm applied to a variety of equality constrained optimization problems, with constraints given by partial differential equations (PDEs).

99 GENERAL AND MISCELLANEOUS↗

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

Transient Efficiency Flexibility and Reliability Optimization of Coal-Fired Power Plants: Model-Predictive Control Library Development (Report)

This document pertains to the reporting requirements of DOE contract FE-0031767. The document covers the development of a model predictive control (MPC) library for implementing MPC for a general dynamic system. The library is implemented in a standardized manner in Matlab/Simulink, where core functions on model prediction, linearization and formulation and solution of a quadratic programming (QP) optimization problem is done in the core library - independent of the specific application. The user can provide the application-specific dynamic model in continuous and discrete time, to rapidly implement and test the MPC performance in a desktop simulation. The MPC optimization objective and constraints are also easily configured via an Excel file to allow iterative refinement as needed. Finally, the MPC library enables a rapid deployment to a target environment through auto C-code generation and containerization. The MPC library works seamlessly with the model based estimation (MBE) library to obtain the overall output feedback control solution. In this program, the reduced order model (ROM) of a coal-fired power plant (CFPP) is used to implement and test the MPC solution.

01 COAL, LIGNITE, AND PEAT↗

Koopman Model Predictive Control for Eco-Driving of Automated Vehicles

In this paper, we develop a data-driven process for building a model predictive control (MPC) for eco-driving of automated vehicles. The process involves performing system identification in which the non-linear vehicle dynamics model is approximated by the Koopman operator, a linear predictor of higher state-dimension, in a data-driven framework. This approach allows us to formulate the eco-driving problem in a constrained quadratic program that leads to a computationally fast MPC. The MPC is then implemented as a closed-loop control of an electric vehicle in numerical simulations for demonstration.

autonomous vehicle↗

On optimizing the sensor spacing for pressure measurements on wind turbine airfoils

This research article presents a robust approach to optimizing the layout of pressure sensors around an airfoil. A genetic algorithm and a sequential quadratic programming algorithm are employed to derive a sensor layout best suited to represent the expected pressure distribution and, thus, the lift force. The fact that both optimization routines converge to almost identical sensor layouts suggests that an optimum exists and is reached. By comparing against a cosine-spaced sensor layout, it is demonstrated that the underlying pressure distribution can be captured more accurately with the presented layout optimization approach. Conversely, a 39 %–55 % reduction in the number of sensors compared to cosine spacing is achievable without loss in lift prediction accuracy. Given these benefits, an optimized sensor layout improves the data quality, reduces unnecessary equipment and saves cost in experimental setups. While the optimization routine is demonstrated based on the generic example of the IEA 15 MW reference wind turbine, it is suitable for a wide range of applications requiring pressure measurements around airfoils.

17 WIND ENERGY↗

Convex profiles from asteroid lightcurves

A lightcurve inversion method that yields a two-dimensional convex profile is introduced. The number of parameters that characterize the profile is limited only by the number of Fourier harmonics used to represent the parent lightcurve. The implementation of the method is outlined by a recursive quadratic programming algorithm, and its application to photoelectric lightcurves and radar measurements is discussed. Special properties of the lightcurves of geometrically scattering ellipsoids are pointed out, and those properties are used to test the inversion method and obtain a criterion for judging whether any lightcurve could actually be due to such an object. Convex profiles for several asteroids are shown, and the method's validity is discussed from a physical as well as purely statistical point of view.

Ostro, S. J.↗