BB-CVXOPT: Basic Block Execution Count Estimation and Extrapolation using Constrained Convex Optimization
Explore the source record for details and available documents.
Basic Block, Convex Optimization, Performance Pred↗
SEARCH · Engineering Papers
Results for “constrained 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.
Security Constrained Economic Optimization of Photovoltaic and Other Distributed Assets
The rapid growth of distributed energy resources (DERs), especially photovoltaic (PV) systems, has introduced new complexities in maintaining grid reliability, stability, and cost-effective operation. This project addresses these challenges by developing and demonstrating a scalable GridOS Distributed Energy Resource Management System (DERMS) that enables secure, real-time optimization and control of DERs at the distribution feeder level.
14 SOLAR ENERGY↗
srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications.
Abstract not provided.
Tran, Anh↗
Load Shedding for Voltage Regulation With Probabilistic Agent Compliance
With the increased observability and controllability of distribution systems, the share of behind-the-meter systems is trending upwards rapidly. As a consequence, the impact of human behaviors on system performance can no longer be ignored and should be reflected in the energy management system models. In this paper, we discuss the problem of distribution system voltage control by active power curtailment where the agent compliance of the load curtailment signal is probabilistic. We discuss the modeling of the optimal voltage control problem with probabilistic agent compliance as a chance-constrained optimization problem, its tractable safe approximation using convex restriction, and a scenario-based mixed-integer reformulation as well as the associated solution method based on augmented Lagrangian method. The numerical simulation on IEEE test system validates the effectiveness of the proposed approach in obtaining high-quality feasible load curtailment signal with low computational cost, which makes it a viable tool for real time decision making.
augmented Lagrangian method↗
Apparatus and method for optimizing quantifiable behavior in configurable devices and systems
An apparatus and method are provided to perform constrained optimization of a constrained property of an apparatus, which is complex due to having several components, and these components are configurable in real-time. The optimization is achieved by detecting values of the constrained property and a plurality of other properties of the apparatus when the apparatus is configured in a first subset of the plurality of configurations. A model is learned using the detected values of the constrained property. The model represents the constrained property and can also represent other properties as a function of the configurations. The model can also include estimated uncertainties of the constrained property in the model. Then, using the d model and the estimated uncertainties, the optimal configuration can be selected to minimize an error value (e.g., the difference between a desired value and an observed value of the at least one constrained property).
Hoffmann, Henry↗
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.
97 MATHEMATICS AND COMPUTING↗
Large Scale Bilevel Optimization for N-K SCOPF Using Adversarial Robustness
Ensuring a secure dispatch against multiple simultaneous outages has long been desired to maintain grid security in the presence of severe events, such as extreme weather phenomena. Traditionally denoted as N-k security constrained optimal power flow (N-k SCOPF), this problem is intractable to solve due to its size being combinatorial in the number of simultaneous outages and due to the non-convex nature of the AC network constraints. This hinders the use of N-k SCOPF for operating realistic-scale systems. In this paper, we introduce a methodology to scalably solve an AC-feasible dispatch that improves security over k simultaneous outages. Our methodology poses N-k SCOPF as a bilevel optimization problem and solves it using an adversarial robustness approach. We develop new efficient methods to solve each level of the bilevel optimization by employing knowledge of the physics of the underlying system. This yields significant improvements in speed and convergence that enable us to address the N-k SCOPF problem at scale. We demonstrate the effectiveness of our method by conducting a comprehensive analysis of an N-3 SCOPF for a 500-bus network. Furthermore, we emphasize the ability of our physics-driven techniques to handle larger systems by successfully scaling up to 12,000 buses.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Optimal design of chemoepitaxial guideposts for the directed self-assembly of block copolymer systems using an inexact Newton algorithm
Directed self-assembly (DSA) of block copolymers (BCPs) is one of the most promising developments in the cost-effective production of nanoscale devices. The process makes use of the natural tendency for BCP melts to form nanoscale structures upon phase separation. The phase separation can be directed through the use of chemically patterned substrates to promote the formation of morphologies that are essential to the production of semiconductor devices. Moreover, the design of substrate pattern can be formulated as an optimization problem for which we seek optimal substrate designs that effectively produce given target morphologies. In this paper, we adopt a phase field model given by a nonlocal Cahn–Hilliard partial differential equation (PDE) based on the minimization of the Ohta–Kawasaki free energy, and present an efficient PDE-constrained optimization framework for the optimal design problem. The design variables are the locations of circular- or strip-shaped guiding posts that are used to model the substrate chemical pattern. To solve the ensuing optimization problem, we propose a variant of an inexact Newton conjugate gradient algorithm tailored to this problem. Additionally, we demonstrate the effectiveness of our computational strategy on numerical examples that span a range of target morphologies. Owing to our second-order optimizer and fast state solver, the numerical results demonstrate five orders of magnitude reduction in computational cost over previous work. The efficiency of our framework and the fast convergence of our optimization algorithm enable us to rapidly solve the optimal design problem in not only two, but also three spatial dimensions.
97 MATHEMATICS AND COMPUTING↗
Development and Analysis of Optimal Multilevel Solvers on Advanced Computers. Final Report
Constrained optimization in the context of time dependent, partial differential equations (PDE) leads to a symmetric, block-tridiagonal system of nonlinear equations that must be solved repeatedly in an iterative solution strategy. The blocks represent spatial discretization, while the connection between the blocks represents a forward and backward integration in time. The focus of this project is to apply a parallel-in-time (PiT) solution technique to the large block-triangular system.
97 MATHEMATICS AND COMPUTING↗
Optimal Orbital Selection for Full Configuration Interaction (OptOrbFCI): Pursuing the Basis Set Limit under a Budget
Full configuration interaction (FCI) solvers are limited to small basis sets due to their expensive computational costs. An optimal orbital selection for FCI (OptOrbFCI) is proposed to boost the power of existing FCI solvers to pursue the basis set limit under a computational budget. The optimization problem coincides with that of the complete active space SCF method (CASSCF), while OptOrbFCI is algorithmically quite different. OptOrbFCI effectively finds an optimal rotation matrix via solving a constrained optimization problem directly to compress the orbitals of large basis sets to one with a manageable size, conducts FCI calculations only on rotated orbital sets, and produces a variational ground-state energy and its wave function. Coupled with coordinate descent full configuration interaction (CDFCI), we demonstrate the efficiency and accuracy of the method on the carbon dimer and nitrogen dimer under basis sets up to cc-pV5Z. We also benchmark the binding curve of the nitrogen dimer under the cc-pVQZ basis set with 28 selected orbitals, which provide consistently lower ground-state energies than the FCI results under the cc-pVDZ basis set. Furthermore, the dissociation energy in this case is found to be of higher accuracy.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization
In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.
97 MATHEMATICS AND COMPUTING↗
Risk-averse optimal control of semilinear elliptic PDEs
In this paper, we consider the optimal control of semilinear elliptic PDEs with random inputs. These problems are often nonconvex, infinite-dimensional stochastic optimization problems for which we employ risk measures to quantify the implicit uncertainty in the objective function. In contrast to previous works in uncertainty quantification and stochastic optimization, we provide a rigorous mathematical analysis demonstrating higher solution regularity (in stochastic state space), continuity and differentiability of the control-to-state map, and existence, regularity and continuity properties of the control-to-adjoint map. Our proofs make use of existing techniques from PDE-constrained optimization as well as concepts from the theory of measurable multifunctions. We illustrate our theoretical results with two numerical examples motivated by the optimal doping of semiconductor devices.
97 MATHEMATICS AND COMPUTING↗
An error-in-constitutive equations strategy for topology optimization for frequency-domain dynamics
This paper presents a topology optimization formulation for frequency-domain dynamics to reduce solution dependence upon initial guess and considered loading conditions. Due to resonance phenomena in undamped steady-state dynamics, objectives measuring dynamic response possess many local minima that may represent poor solutions to a design problem, an issue exacerbated for design with respect to multiple frequencies. In this work, we propose an extension of the modified error-in-constitutive-equations (MECE) method, used previously in material identification inverse problems, as a new approach for frequency-domain dynamics topology optimization to mitigate these issues. The main idea of the proposed framework is to incorporate an additional penalty-like term in the objective function that measures the discrepancy in the constitutive relations between stresses and strains and between inertial forces and displacements. Then, the design problem is cast within a PDE-constrained optimization formulation in which we seek displacements, stresses, inertial forces, and a density-field solution that minimize our new objective subject to conservation of linear momentum plus some additional constraints. We show that this approach yields superior designs to conventional gradient-based optimization approaches that solely use a functional of displacements as the objective, while strictly enforcing the constitutive equations. The MECE strategy integrates into a density-based topology optimization scheme for void–solid or two-phase material structural design. We highlight the merits of our approach in a variety of scenarios for direct frequency response design, considering multiple frequency load cases and structural objectives.
42 ENGINEERING↗
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↗
Proactive Posturing of Large Power Grid for Mitigating Hurricane Impacts
In the past decade, natural disasters such as hurricanes have challenged the operation and control of U.S. power grid more. It is crucial to develop proactive strategies to assist grid operators for better emergency response and minimized electricity service interruptions. In this paper, we propose a proactive posturing methodology of power system elements, and formulated a Security-Constrained Optimal Power Flow (SCOPF) that informed by cross-domain hurricane modeling and its potential impacts on the grid elements. Simulation results based on real-world power grid and historical hurricane event validated the applicability of the proposed optimization formulation, and show potential to enable grid operators and planners with interactive cross-domain data analytics in mitigating hurricane impacts.
power system emergency response, security constrai↗
Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs
We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.
97 MATHEMATICS AND COMPUTING↗
Deep Sigma Point Processes-Assisted Chance-Constrained Power System Transient Stability Preventive Control
Here this paper proposes a deep sigma point processes (DSPP)-assisted chance-constrained power system transient stability preventive control method to deal with uncertain renewable energy and loads-induced stability risk. The traditional transient stability-constrained preventive control is reformulated as a chance-constrained optimization problem. To deal with the computational bottleneck of the time-domain simulation-based probabilistic transient stability assessment, the DSPP is developed. DSPP is a parametric Bayesian approach that allows us to predict system transient stability with high computational efficiency while accurately quantifying the confidence intervals of the predictions that can be used to inform system instability risk. To this end, with a given preset confidence probability, we embed DSPP into the primal dual interior point method to help solve the chance-constrained preventive control problem, where the corresponding Jacobian and Hessian matrices are derived. Comparison results with other existing methods show that the proposed method can significantly speed up preventive control while maintaining high accuracy and convergence
97 MATHEMATICS AND COMPUTING↗
Moment preserving constrained resampling with applications to particle-in-cell methods
The Moment Preserving Constrained Resampling (MPCR) algorithm for particle resampling is introduced and applied to particle-in-cell (PIC) methods to increase simulation accuracy, reduce compute cost, and/or avoid numerical instabilities. The general algorithm partitions the system space into smaller subsets and resamples the distribution within each subset. Further, the algorithm is designed to conserve any number of particle and grid moments with a high degree of accuracy (i.e. machine accuracy). The effectiveness of MPCR is demonstrated with several numerical tests, including a use-case study in gyrokinetic fusion plasma simulations. Finally, the computational cost of MPCR is negligible compared to the cost of particle evolution in PIC methods, and the tests demonstrate that periodic particle resampling yields a significant improvement in the accuracy and stability of the results.
63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗