Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quadratic optimization”

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 937 records · Page 52

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↗

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗

An ℓ 0 ℓ 2 -norm regularized regression model for construction of robust cluster expansions in multicomponent systems

In this work we introduce ℓ 0 ℓ 2 -norm regularization and hierarchy constraints into linear regression for the construction of cluster expansions to describe configurational disorder in materials. The approach is implemented through mixed integer quadratic programming (MIQP). The ℓ 2 -norm regularization is used to suppress intrinsic data noise, while the ℓ 0 -norm is used to penalize the number of nonzero elements in the solution. The hierarchy relation between clusters imposes relevant physics and is naturally included by the MIQP paradigm. As such, sparseness and cluster hierarchy can be well optimized to obtain a robust, converged set of effective cluster interactions with improved physical meaning. We demonstrate the effectiveness of ℓ 0 ℓ 2 -norm regularization in two high-component disordered rocksalt cathode material systems, where we compare the cross-validation, convergence speed, and the reproduction of phase diagrams, voltage profiles, and Li-occupancy energies with those of the conventional ℓ 1 -norm regularized cluster expansion models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A methodology for designing robust multivariable nonlinear control systems

A new methodology is described for the design of nonlinear dynamic controllers for nonlinear multivariable systems providing guarantees of closed-loop stability, performance, and robustness. The methodology is an extension of the Linear-Quadratic-Gaussian with Loop-Transfer-Recovery (LQG/LTR) methodology for linear systems, thus hinging upon the idea of constructing an approximate inverse operator for the plant. A major feature of the methodology is a unification of both the state-space and input-output formulations. In addition, new results on stability theory, nonlinear state estimation, and optimal nonlinear regulator theory are presented, including the guaranteed global properties of the extended Kalman filter and optimal nonlinear regulators.

Grunberg, D. B.↗

Transonic Flutter Suppression Control Law Design Using Classical and Optimal Techniques with Wind-Tunnel Results

The benchmark active controls technology and wind tunnel test program at NASA Langley Research Center was started with the objective to investigate the nonlinear, unsteady aerodynamics and active flutter suppression of wings in transonic flow. The paper will present the flutter suppression control law design process, numerical nonlinear simulation and wind tunnel test results for the NACA 0012 benchmark active control wing model. The flutter suppression control law design processes using (1) classical, (2) linear quadratic Gaussian (LQG), and (3) minimax techniques are described. A unified general formulation and solution for the LQG and minimax approaches, based on the steady state differential game theory is presented. Design considerations for improving the control law robustness and digital implementation are outlined. It was shown that simple control laws when properly designed based on physical principles, can suppress flutter with limited control power even in the presence of transonic shocks and flow separation. In wind tunnel tests in air and heavy gas medium, the closed-loop flutter dynamic pressure was increased to the tunnel upper limit of 200 psf. The control law robustness and performance predictions were verified in highly nonlinear flow conditions, gain and phase perturbations, and spoiler deployment. A non-design plunge instability condition was also successfully suppressed.

Mukhopadhyay, Vivek↗

Transonic Flutter Suppression Control Law Design Using Classical and Optimal Techniques with Wind-Tunnel Results

The benchmark active controls technology and wind tunnel test program at NASA Langley Research Center was started with the objective to investigate the nonlinear, unsteady aerodynamics and active flutter suppression of wings in transonic flow. The paper will present the flutter suppression control law design process, numerical nonlinear simulation and wind tunnel test results for the NACA 0012 benchmark active control wing model. The flutter suppression control law design processes using (1) classical, (2) linear quadratic Gaussian (LQG), and (3) minimax techniques are described. A unified general formulation and solution for the LQG and minimax approaches, based on the steady state differential game theory is presented. Design considerations for improving the control law robustness and digital implementation are outlined. It was shown that simple control laws when properly designed based on physical principles, can suppress flutter with limited control power even in the presence of transonic shocks and flow separation. In wind tunnel tests in air and heavy gas medium, the closed-loop flutter dynamic pressure was increased to the tunnel upper limit of 200 psf. The control law robustness and performance predictions were verified in highly nonlinear flow conditions, gain and phase perturbations, and spoiler deployment. A non-design plunge instability condition was also successfully suppressed.

Mukhopadhyay, Vivek↗

Data-driven chaos indicator for nonlinear dynamics and applications on storage ring lattice design

A data-driven chaos indicator concept is introduced to characterize the degree of chaos for nonlinear dynamical systems. The indicator is represented by the prediction accuracy of surrogate models established purely from data. It provides a metric for the predictability of nonlinear motions in a given system. When using the indicator to implement a tune-scan for a quadratic Hénon map, the main resonances and their asymmetric stop-band widths can be identified. When applied to particle transportation in a storage ring, as particle motion becomes more chaotic, its surrogate model prediction accuracy decreases correspondingly. So, the prediction accuracy, acting as a chaos indicator, can be used directly as the objective for nonlinear beam dynamics optimization. This method provides a different perspective on nonlinear beam dynamics and an efficient method for nonlinear lattice optimization. Applications in dynamic aperture optimization are demonstrated as real world examples.

36 MATERIALS SCIENCE↗

Relaxing Direct Ptychography Sampling Requirements via Parallax Imaging Insights

Direct ptychography enables the retrieval of information encoded in the phase of an electron wave passing through a thin sample by deconvolving the interference effects of a converged probe with known aberrations. Under the weak phase object approximation, this permits the optimal transfer of information using noniterative techniques. However, the achievable resolution of the technique is traditionally limited by the probe step size—setting stringent Nyquist sampling requirements. At the same time, parallax imaging has emerged as a dose-efficient phase technique which relaxes sampling requirements and enables scan-upsampling. Here, we formulate parallax imaging as a quadratic approximation to part of the direct ptychography kernel and use this insight to enable upsampling in direct ptychography. We validate our analytical results numerically using simulated and experimental reconstructions.

direct ptychography, parallax imaging, scan Nyquis↗

Data-driven Chaos Indicator for Nonlinear Dynamics and Applications on Storage Ring Lattice Design

A data-driven chaos indicator concept is introduced to characterize the degree of chaos for nonlinear dynamical systems. The indicator is represented by the prediction accuracy of surrogate models established purely from data. It provides a metric for the predictability of nonlinear motions in a given system. When using the indicator to implement a tune-scan for a quadratic Hénon map, the main resonances and their asymmetric stop-band widths can be identified. When applied to particle transportation in a storage ring, as particle motion becomes more chaotic, its surrogate model prediction accuracy decreases correspondingly. Therefore, the prediction accuracy, acting as a chaos indicator, can be used directly as the objective for nonlinear beam dynamics optimization. This method provides a different perspective on nonlinear beam dynamics and an efficient method for nonlinear lattice optimization. Applications in dynamic aperture optimization are demonstrated as real world examples.

43 PARTICLE ACCELERATORS↗

Quantum Control Landscapes Beyond the Dipole Approximation: Controllability, Singular Controls, and Resources

We investigate the control landscapes of closed n-level quantum systems beyond the dipole approximation by including a polarizability term in the Hamiltonian. The latter term is quadratic in the control field. Theoretical analysis of singular controls is presented, which are candidates for producing landscape traps. The results for considering the presence of singular controls are compared to their counterparts in the dipole approximation (i.e., without polarizability). A numerical analysis of the existence of traps in control landscapes for generating unitary transformations beyond the dipole approximation is made upon including the polarizability term. An extensive exploration of these control landscapes is achieved by creating many random Hamiltonians which include terms linear and quadratic in a single control field. The discovered singular controls are all found not to be local optima. This result extends a great body of recent work on typical landscapes of quantum systems where the dipole approximation is made. We further investigate the relationship between the magnitude of the polarizability and the fluence of the control resulting from optimization. It is also shown that including a polarizability term in an otherwise uncontrollable dipole coupled system removes traps from the corresponding control landscape by restoring controllability. We numerically assess the effect of a polarizability term on a known example of a particular three-level Λ-system with a second order trap in its control landscape. It is found that the addition of the polarizability removes the trap from the landscape. The general practical control implications of these simulations are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $\mathbb {R}^n$

Here, we present an efficient strongly polynomial algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}^n\) . Interior point methods are the most efficient algorithm in the literature to solve this problem. While efficient in practice, the complexity of interior-point methods is bounded by a polynomial in the dimension of the problem and in the accuracy of the solution. Moreover, their efficiency is highly dependent on a series of parameters depending on the specific method chosen (especially for nonlinear problems), such as step size, barrier parameter, accuracy, among others. We propose a new method based on the KKT optimality conditions. In this method, we write the problem as a function of the Lagrangian multipliers of the hyperplanes and seek to find the pair of multipliers that corresponds to the optimal solution. We prove that the algorithm has complexity \(O(n^2 \log n)\) .

42 ENGINEERING↗

Optimal two-impulse transfer between specified terminal states of Keplerian orbits

The integrals of motion for an inverse-square force field and a necessary condition for optimality are used in a transfer orbit co-ordinate system to formulate the solution of the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits. In this co-ordinate system, the equations reveal two asymptotes that are useful in analysing the solution. It is shown that there are only two real extremals (both minimums) which are separated by an asymptote. An approximate analytic solution is also obtained by ignoring a quadratic term whose coefficient is approximately zero for a large class of orbit transfer problems.

Jezewski, D. J.↗

Experimental and Theoretical Results in Output-Trajectory Redesign for Flexible Structures

In this paper we study the optimal redesign of output trajectory for linear invertible systems. This is particularly important for tracking control of flexible structures because the input-state trajectories that achieve the required output may cause excessive vibrations in the structure. A trade-off is then required between tracking and vibrations reduction. We pose and solve this problem as the minimization of a quadratic cost function. The theory is developed and applied to the output tracking of a flexible structure and experimental results are presented.

Dewey, J. S.↗

An information matrix approach for aircraft parameter-insensitive control

The Fisher Information Matrix provides the nucleus of a design procedure for obtaining parameter-insensitive feedback gains in Linear-Quadratic-Gaussian problems. The procedure minimizes a sum of performance and closed-loop sensitivity costs, the latter being related to the information content of the system response. Analytical expressions for the appended cost functional and its gradient with respect to the feedback gains are derived. These derivatives serve as the basis of a computationally efficient iterative algorithm that finds the optimal gains. Application of the technique is made to determine low sensitivity feedback gains for a C-5A wing loading alleviation system that has 15 states and three uncertain parameters.

Kleinman, D. L.↗

A methodology for designing robust multivariable nonlinear feedback control systems

This paper presents an outline of a methodology for the design of nonlinear dynamic compensators for nonlinear multivariable systems with guarantees of closed-loop stability, robustness, and performance. The method is an extension of the Linear-Quadratic-Gaussian with Loop-Transfer-Recovery (LQG/LTR) methodology for linear systems, thus hinging upon the idea of constructing an approximate nonlinear inverse operator for the plant. A major feature of the method is a unification of both the state-space and Input-Output formulations. The major results of the paper are: (1) Properties of the solution of certain optimal control problems; (2) New results on nonlinear estimation, including a new nonlinear observer with certain guaranteed properties; (3) The Loop Operator Recovery (LOR) procedure, and (4) Inclusion of command-following and disturbance rejection with a goal of a closed-loop stable, robust system.

Grunberg, D. B.↗

Optimal orbit transfer suitable for large flexible structures

The problem of continuous low-thrust planar orbit transfer of large flexible structures is formulated as an optimal control problem with terminal state constraints. The dynamics of the spacecraft motion are treated as a point-mass central force field problem; the thrust-acceleration magnitude is treated as an additional state variable; and the rate of change of thrust-acceleration is treated as a control variable. To ensure smooth transfer, essential for flexible structures, an additional quadratic term is appended to the time cost functional. This term penalizes any abrupt change in acceleration. Numerical results are presented for the special case of a planar transfer.

Chatterjee, Alok K.↗

SU-E-T-480: Radiobiological Dose Comparison of Single Fraction SRS, Multi-Fraction SRT and Multi-Stage SRS of Large Target Volumes Using the Linear-Quadratic Formula

Purpose: To compare the radiobiological effect on large tumors and surrounding normal tissues from single fraction SRS, multi-fractionated SRT, and multi-staged SRS treatment. Methods: An anthropomorphic head phantom with a centrally located large volume target (18.2 cm{sup 3}) was scanned using a 16 slice large bore CT simulator. Scans were imported to the Multiplan treatment planning system where a total prescription dose of 20Gy was used for a single, three staged and three fractionated treatment. Cyber Knife treatment plans were inversely optimized for the target volume to achieve at least 95% coverage of the prescription dose. For the multistage plan, the target was segmented into three subtargets having similar volume and shape. Staged plans for individual subtargets were generated based on a planning technique where the beam MUs of the original plan on the total target volume are changed by weighting the MUs based on projected beam lengths within each subtarget. Dose matrices for each plan were export in DICOM format and used to calculate equivalent dose distributions in 2Gy fractions using an alpha beta ratio of 10 for the target and 3 for normal tissue. Results: Singe fraction SRS, multi-stage plan and multi-fractionated SRT plans had an average 2Gy dose equivalent to the target of 62.89Gy, 37.91Gy and 33.68Gy, respectively. The normal tissue within 12Gy physical dose region had an average 2Gy dose equivalent of 29.55Gy, 16.08Gy and 13.93Gy, respectively. Conclusion: The single fraction SRS plan had the largest predicted biological effect for the target and the surrounding normal tissue. The multi-stage treatment provided for a more potent biologically effect on target compared to the multi-fraction SRT treatments with less biological normal tissue than single-fraction SRS treatment.

60 APPLIED LIFE SCIENCES↗

Combined iterative reconstruction and image-domain decomposition for dual energy CT using total-variation regularization

Purpose: Dual-energy CT (DECT) is being increasingly used for its capability of material decomposition and energy-selective imaging. A generic problem of DECT, however, is that the decomposition process is unstable in the sense that the relative magnitude of decomposed signals is reduced due to signal cancellation while the image noise is accumulating from the two CT images of independent scans. Direct image decomposition, therefore, leads to severe degradation of signal-to-noise ratio on the resultant images. Existing noise suppression techniques are typically implemented in DECT with the procedures of reconstruction and decomposition performed independently, which do not explore the statistical properties of decomposed images during the reconstruction for noise reduction. In this work, the authors propose an iterative approach that combines the reconstruction and the signal decomposition procedures to minimize the DECT image noise without noticeable loss of resolution. Methods: The proposed algorithm is formulated as an optimization problem, which balances the data fidelity and total variation of decomposed images in one framework, and the decomposition step is carried out iteratively together with reconstruction. The noise in the CT images from the proposed algorithm becomes well correlated even though the noise of the raw projections is independent on the two CT scans. Due to this feature, the proposed algorithm avoids noise accumulation during the decomposition process. The authors evaluate the method performance on noise suppression and spatial resolution using phantom studies and compare the algorithm with conventional denoising approaches as well as combined iterative reconstruction methods with different forms of regularization. Results: On the Catphan©600 phantom, the proposed method outperforms the existing denoising methods on preserving spatial resolution at the same level of noise suppression, i.e., a reduction of noise standard deviation by one order of magnitude. This improvement is mainly attributed to the high noise correlation in the CT images reconstructed by the proposed algorithm. Iterative reconstruction using different regularization, including quadratic orq-generalized Gaussian Markov random field regularization, achieves similar noise suppression from high noise correlation. However, the proposed TV regularization obtains a better edge preserving performance. Studies of electron density measurement also show that our method reduces the average estimation error from 9.5% to 7.1%. On the anthropomorphic head phantom, the proposed method suppresses the noise standard deviation of the decomposed images by a factor of ∼14 without blurring the fine structures in the sinus area. Conclusions: The authors propose a practical method for DECT imaging reconstruction, which combines the image reconstruction and material decomposition into one optimization framework. Compared to the existing approaches, our method achieves a superior performance on DECT imaging with respect to decomposition accuracy, noise reduction, and spatial resolution.

62 RADIOLOGY AND NUCLEAR MEDICINE↗