Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convex 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 361 records · Page 20

A Stochastic Maximum Principle for General Mean-Field Systems

In this paper we study the optimal control problem for a class of general mean-field stochastic differential equations, in which the coefficients depend, nonlinearly, on both the state process as well as of its law. In particular, we assume that the control set is a general open set that is not necessary convex, and the coefficients are only continuous on the control variable without any further regularity or convexity. We validate the approach of Peng (SIAM J Control Optim 2(4):966–979, 1990) by considering the second order variational equations and the corresponding second order adjoint process in this setting, and we extend the Stochastic Maximum Principle of Buckdahn et al. (Appl Math Optim 64(2):197–216, 2011) to this general case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗

Ultrafast treatment plan optimization for volumetric modulated arc therapy (VMAT)

Purpose: To develop a novel aperture-based algorithm for volumetric modulated arc therapy (VMAT) treatment plan optimization with high quality and high efficiency. Methods: The VMAT optimization problem is formulated as a large-scale convex programming problem solved by a column generation approach. The authors consider a cost function consisting two terms, the first enforcing a desired dose distribution and the second guaranteeing a smooth dose rate variation between successive gantry angles. A gantry rotation is discretized into 180 beam angles and for each beam angle, only one MLC aperture is allowed. The apertures are generated one by one in a sequential way. At each iteration of the column generation method, a deliverable MLC aperture is generated for one of the unoccupied beam angles by solving a subproblem with the consideration of MLC mechanic constraints. A subsequent master problem is then solved to determine the dose rate at all currently generated apertures by minimizing the cost function. When all 180 beam angles are occupied, the optimization completes, yielding a set of deliverable apertures and associated dose rates that produce a high quality plan. Results: The algorithm was preliminarily tested on five prostate and five head-and-neck clinical cases, each with one full gantry rotation without any couch/collimator rotations. High quality VMAT plans have been generated for all ten cases with extremely high efficiency. It takes only 5-8 min on CPU (MATLAB code on an Intel Xeon 2.27 GHz CPU) and 18-31 s on GPU (CUDA code on an NVIDIA Tesla C1060 GPU card) to generate such plans. Conclusions: The authors have developed an aperture-based VMAT optimization algorithm which can generate clinically deliverable high quality treatment plans at very high efficiency.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-T-549: A Combinatorial Optimization Approach to Treatment Planning with Non-Uniform Fractions in Intensity Modulated Proton Therapy

Purpose: Non-uniform fractionation, i.e. delivering distinct dose distributions in two subsequent fractions, can potentially improve outcomes by increasing biological dose to the target without increasing dose to healthy tissues. This is possible if both fractions deliver a similar dose to normal tissues (exploit the fractionation effect) but high single fraction doses to subvolumes of the target (hypofractionation). Optimization of such treatment plans can be formulated using biological equivalent dose (BED), but leads to intractable nonconvex optimization problems. We introduce a novel optimization approach to address this challenge. Methods: We first optimize a reference IMPT plan using standard techniques that delivers a homogeneous target dose in both fractions. The method then divides the pencil beams into two sets, which are assigned to either fraction one or fraction two. The total intensity of each pencil beam, and therefore the physical dose, remains unchanged compared to the reference plan. The objectives are to maximize the mean BED in the target and to minimize the mean BED in normal tissues, which is a quadratic function of the pencil beam weights. The optimal reassignment of pencil beams to one of the two fractions is formulated as a binary quadratic optimization problem. A near-optimal solution to this problem can be obtained by convex relaxation and randomized rounding. Results: The method is demonstrated for a large arteriovenous malformation (AVM) case treated in two fractions. The algorithm yields a treatment plan, which delivers a high dose to parts of the AVM in one of the fractions, but similar doses in both fractions to the normal brain tissue adjacent to the AVM. Using the approach, the mean BED in the target was increased by approximately 10% compared to what would have been possible with a uniform reference plan for the same normal tissue mean BED.

61 RADIATION PROTECTION AND DOSIMETRY↗

A QCQP Approach for OPF in Multiphase Radial Networks with Wye and Delta Connections: Preprint

This paper examines the AC Optimal Power Flow (OPF) problem for multiphase distribution networks featuring renewable energy resources (RESs). We start by outlining a power flow model for radial multiphase systems that accommodates wye-connected and delta-connected RESs and non-controllable energy assets. We then formalize an AC OPF problem that accounts for both types of connections. Similar to various AC OPF renditions, the resultant problem is a non convex quadratically-constrained quadratic program. However, the so-called Feasible Point Pursuit-Successive Convex Approximation algorithm is leveraged to obtain a feasible and yet locally-optimal solution. The merits of the proposed solution approach are demonstrated using two unbalanced multiphase distribution feeders with both wye and delta connections.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Next-Generation Optimization under Uncertainty: Structure-Oriented Algorithms

With the advent of the smart grid, renewable technologies, and carbon emission programs, a key concern is the coordination of national infrastructures such as the electricity, natural gas, and water supply network systems. Anticipating and mitigating uncertainty of weather, demands, and contingencies in a more integrated environment is necessary to maximize resource efficiency and prevent cascading failures that can ultimately lead to catastrophic shortages of supplies. This project developed scalable algorithms for stochastic optimization capable of addressing extreme-scale problems (motivated by challenges in the design and operation of national infrastructures). Specifically, the project developed a new family of algorithms to solve continuous stochastic problems to local and global optimality as well as algorithms to solve mixed-integer convex and nonconvex stochastic programs. We developed supporting local and global convergence theory for these algorithms and implemented the algorithms in open-source software packages that can leverage high-performance computing architectures.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Random search optimization based on genetic algorithm and discriminant function

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

Kiciman, M. O.↗

A hybrid architecture for volt-var control in active distribution grids

Modern active distribution grids are characterized by the increasing penetration of distributed energy resources (DERs). The proper coordination and scheduling of a large numbers of these small-scale and spatially distributed DERs is necessary, and warrants the use of novel distributed approaches. In this paper, we propose a hybrid volt-var control architecture for the distribution grid, which leverages existing centralized and local approaches to planning, decision making, and control, and augments it with distributed optimization and distributed control for DER management. First, we propose a convex model to describe the power physics of distribution grids of meshed topology and unbalanced structure, based on current injection and McCormick Envelopes. Second, we employ the distributed proximal atomic coordination (PAC) algorithm to coordinate DERs to provide voltage support. We implement volt-var optimization by optimally coordinating DERs including PV smart inverters and demand response. We present results using the IEEE-34 bus network, using real data from a distribution feeder in Hawaii, to model load and PV generation. Different levels of DER penetration and objective functions are simulated. Finally, our results show the need for the coordination of DERs to improve voltage profiles, even in networks with existing voltage control devices. Further, we show the need for flexible reactive power capabilities to achieve desired grid performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global optimization methods for engineering design

The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

Arora, Jasbir S.↗

On the marginal value of electricity storage

We investigate the problem of characterizing the economic value of energy storage capacity to a wind power producer (WPP) that sells its energy in a conventional two-settlement electricity market. The WPP can offer a forward contract to supply power in the day-ahead market, subject to financial penalties for imbalances between the contracted power and the power that is delivered in real-time. We consider the setting in which the WPP has access to a co-located energy storage system, and can thus reshape its wind power production subject to its storage capacity constraints. Modeling wind power as a random process, we show that the problem of determining optimal forward contract offerings—given recourse with storage—is convex. We further establish that the maximum expected profit is concave and non-decreasing in the energy storage capacity, which reveals that the greatest marginal benefit from energy storage is derived from initial investment in small storage capacity. We provide a characterization of the marginal value of small energy storage capacity to the WPP. The formulae we derive shed light on the relationship between the value of storage and certain statistical measures of variability in the underlying wind power process.

25 ENERGY STORAGE↗

Best recovery of the Laplace operator of a function from incomplete spectral data

This paper is concerned with the problem of best recovery for a fractional power of the Laplacian of a smooth function on R{sup d} from an exact or approximate Fourier transform for it, which is known on some convex subset of R{sup d}. A series of optimal recovery methods is constructed. Information about the Fourier transform outside some ball centred at the origin proves redundant--it is not used by the optimal methods. These optimal methods differ in the way they 'process' key information. Bibliography: 12 titles.

97 MATHEMATICS AND COMPUTING↗

Optimizing for minimum weight when two different finite element models and analyses are required

The Finite Element Structural Optimization Program's (FESOP) ability to perform minimum weight optimization using two different finite element analyses and models is discussed. FESOP uses the ADS optimizer developed by Dr. Garret Vanderplaats to solve the nonlinear constrained optimization problem. The design optimization problem requires a response spectrum analysis and model to evaluate the stress and displacement constraints. However, the problem needs a frequency analysis and model to calculate the natural frequencies used to evaluate the frequency range constraints. The results of both the successful and unsuccessful approaches used to solve this difficult weight minimization problem are summarized. The results show that no one ADS optimization algorithm worked in all cases. However, the Sequential Convex Programming and Modified Method of Feasible Directions algorithms were the most successful.

Hall, Jeffrey C.↗

Bi-Level Integrated System Synthesis (BLISS) for Concurrent and Distributed Processing

The paper introduces a new version of the Bi-Level Integrated System Synthesis (BLISS) methods intended for optimization of engineering systems conducted by distributed specialty groups working concurrently and using a multiprocessor computing environment. The method decomposes the overall optimization task into subtasks associated with disciplines or subsystems where the local design variables are numerous and a single, system-level optimization whose design variables are relatively few. The subtasks are fully autonomous as to their inner operations and decision making. Their purpose is to eliminate the local design variables and generate a wide spectrum of feasible designs whose behavior is represented by Response Surfaces to be accessed by a system-level optimization. It is shown that, if the problem is convex, the solution of the decomposed problem is the same as that obtained without decomposition. A simplified example of an aircraft design shows the method working as intended. The paper includes a discussion of the method merits and demerits and recommendations for further research.

Sobieszczanski-Sobieski, Jaroslaw↗

Random Predictor Models for Rigorous Uncertainty Quantification: Part 2

This and a companion paper propose techniques for constructing parametric mathematical models describing key features of the distribution of an output variable given input-output data. By contrast to standard models, which yield a single output value at each value of the input, Random Predictors Models (RPMs) yield a random variable at each value of the input. Optimization-based strategies for calculating RPMs having a polynomial dependency on the input and a linear dependency on the parameters are proposed. These formulations yield RPMs having various levels of fidelity in which the mean, the variance, and the range of the model's parameter, thus of the output, are prescribed. As such they encompass all RPMs conforming to these prescriptions. The RPMs are optimal in the sense that they yield the tightest predictions for which all (or, depending on the formulation, most) of the observations are less than a fixed number of standard deviations from the mean prediction. When the data satisfies mild stochastic assumptions, and the optimization problem(s) used to calculate the RPM is convex (or, when its solution coincides with the solution to an auxiliary convex problem), the model's reliability, which is the probability that a future observation would be within the predicted ranges, is bounded rigorously.

Crespo, Luis G.↗

Random Predictor Models for Rigorous Uncertainty Quantification: Part 1

This and a companion paper propose techniques for constructing parametric mathematical models describing key features of the distribution of an output variable given input-output data. By contrast to standard models, which yield a single output value at each value of the input, Random Predictors Models (RPMs) yield a random variable at each value of the input. Optimization-based strategies for calculating RPMs having a polynomial dependency on the input and a linear dependency on the parameters are proposed. These formulations yield RPMs having various levels of fidelity in which the mean and the variance of the model's parameters, thus of the predicted output, are prescribed. As such they encompass all RPMs conforming to these prescriptions. The RPMs are optimal in the sense that they yield the tightest predictions for which all (or, depending on the formulation, most) of the observations are less than a fixed number of standard deviations from the mean prediction. When the data satisfies mild stochastic assumptions, and the optimization problem(s) used to calculate the RPM is convex (or, when its solution coincides with the solution to an auxiliary convex problem), the model's reliability, which is the probability that a future observation would be within the predicted ranges, can be bounded tightly and rigorously.

Crespo, Luis G.↗

Model Predictive Control in the Three-body Problem Using Invariant Funnels As Terminal Sets

This paper describes a method for augmenting Model Predictive Control techniques using invariant funnels computed in the Circular Restricted Three-Body Problem. We use ellipsoids that roughly approximate the boundary of the invariant funnel as convex terminal sets for a short look-ahead optimization problem at each time step. We apply this method to a hypothetical low-thrust mission to land on Jupiter’s mooon Europa and show that including the invariant funnels as terminal sets reduces the amount of control effort required by almost an order of magnitude.

Close, Sigrid↗

Relaxed Multibang Regularization for the Combinatorial Integral Approximation

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. In this work, we consider a class of polyhedral functions that arise particularly as convex lower envelopes of multibang regularizers and show that they have beneficial properties with respect to regularization of relaxations of integer optimal control problems. We extend the algorithmic framework of the combinatorial integral approximation such that a subsequence of the computed discrete-valued controls converges to the infimum of the regularized integer control problem.

97 MATHEMATICS AND COMPUTING↗