Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonsmooth”

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 91 records · Page 5

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↗

Scalable Plug-and-Play ADMM with Convergence Guarantees

Plug-and-play priors (PnP) is a broadly applicable methodology for solving inverse problems by exploiting statistical priors specified as denoisers. Recent work has reported the state-of-the-art performance of PnP algorithms using pre-trained deep neural nets as denoisers in a number of imaging applications. However, current PnP algorithms are impractical in large-scale settings due to their heavy computational and memory requirements. This work addresses this issue by proposing an incremental variant of the widely used PnP-ADMM algorithm, making it scalable to problems involving a large number measurements. Here, we theoretically analyze the convergence of the algorithm under a set of explicit assumptions, extending recent theoretical results in the area. Additionally, we show the effectiveness of our algorithm with nonsmooth data-fidelity terms and deep neural net priors, its fast convergence compared to existing PnP algorithms, and its scalability in terms of speed and memory.

97 MATHEMATICS AND COMPUTING↗

Toward Accelerating Discovery via Physics-Driven and Interactive Multifidelity Bayesian Optimization

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and often nondifferentiable parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, processing spaces, and molecular embedding spaces. Often these systems are expensive or time consuming to evaluate a single instance, and hence classical approaches based on exhaustive grid or random search are too data intensive. This resulted in strong interest toward active learning methods such as Bayesian optimization (BO) where the adaptive exploration occurs based on human learning (discovery) objective. However, classical BO is based on a predefined optimization target, and policies balancing exploration and exploitation are purely data driven. In practical settings, the domain expert can pose prior knowledge of the system in the form of partially known physics laws and exploration policies often vary during the experiment. Here, we propose an interactive workflow building on multifidelity BO (MFBO), starting with classical (data-driven) MFBO, then expand to a proposed structured (physics-driven) structured MFBO (sMFBO), and finally extend it to allow human-in-the-loop interactive interactive MFBO (iMFBO) workflows for adaptive and domain expert aligned exploration. These approaches are demonstrated over highly nonsmooth multifidelity simulation data generated from an Ising model, considering spin–spin interaction as parameter space, lattice sizes as fidelity spaces, and the objective as maximizing heat capacity. Detailed analysis and comparison show the impact of physics knowledge injection and real-time human decisions for improved exploration with increased alignment to ground truth. Here, the associated notebooks allow to reproduce the reported analyses and apply them to other systems.

97 MATHEMATICS AND COMPUTING↗

A Three-Dimensional, Unsplit Godunov Method for Scalar Conservation Laws

Linear advection of a scalar quantity by a specified velocity field arises in a number of different applications. Of particular interest here is the transport of species and energy in low Mach number models for combustion, atmospheric flows, and astrophysics, as well as contaminant transport in Darcy models of saturated subsurface flow. An important characteristic of these problems is that the velocity field is not known analytically. Instead, an auxiliary equation is solved to compute averages of the velocities over faces in a finite volume discretization. In this paper, we present a customized three-dimensional finite volume advection scheme for this class of problems that provides accurate resolution for smooth problems while avoiding undershoot and overshoot for nonsmooth profiles. The method is an extension of an algorithm by Bell, Dawson, and Shubin (BDS), which was developed for a class of scalar conservation laws arising in porous media flows in two dimensions. The original BDS algorithm is a variant of unsplit, higher-order Godunov methods based on construction of a limited bilinear profile within each computational cell. Here we present a three-dimensional extension of the original BDS algorithm that is based on a limited trilinear profile within each cell. We compare this new method to several other unsplit approaches, including piecewise linear methods, piecewise parabolic methods, and wave propagation schemes.

Mathematics↗

Epi-Regularization of Risk Measures

Uncertainty pervades virtually every branch of science and engineering, and in many disciplines, the underlying phenomena can be modeled by partial differential equations (PDEs) with uncertain or random inputs. This work is motivated by risk-averse stochastic programming problems constrained by PDEs. These problems are posed in infinite dimensions, which leads to a significant increase in the scale of the (discretized) problem. In order to handle the inherent nonsmoothness of, for example, coherent risk measures and to exploit existing solution techniques for smooth, PDE-constrained optimization problems, we propose a variational smoothing technique called epigraphical (epi-)regularization. Here, we investigate the effects of epi-regularization on the axioms of coherency and prove differentiability of the smoothed risk measures. In addition, we demonstrate variational convergence of the epi-regularized risk measures and prove the consistency of minimizers and first-order stationary points for the approximate risk-averse optimization problem. We conclude with numerical experiments confirming our theoretical results.

97 MATHEMATICS AND COMPUTING↗

Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements

In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.

Lei, Jinlong↗

A fourth-order Cartesian grid embeddedboundary method for Poisson’s equation

In this paper, we present a fourth-order algorithm to solve Poisson's equation in two and three dimensions. We use a Cartesian grid, embedded boundary method to resolve complex boundaries. We use a weighted least squares algorithm to solve for our stencils. We use convergence tests to demonstrate accuracy and we show the eigenvalues of the operator to demonstrate stability. We compare accuracy and performance with an established second-order algorithm. We also discuss in depth strategies for retaining higher-order accuracy in the presence of nonsmooth geometries.

97 MATHEMATICS AND COMPUTING↗

PyRAT (Python Radiography Analysis Tool): Overview [Slides]

PyRAT was developed as a quantitative tool for robustly characterizing objects from radiographs to solve problems such as the hybrid nonlinear inverse problem. The optimization software library that was used is the nonsmooth optimization by MADS algorithm (NOMAD). Some of PyRAT's features are: (1) hybrid nonlinear inverse problem with calculated x-ray spectrum and detector response; (2) optimization based inversion approach with goal of identifying unknown object configurations - MVO problem; (3) using functionalities of Python libraries for radiographic image processing and analysis; (4) using the Tikhonov regularization method of linear inverse problem to recover partial information of object configurations; (5) using a priori knowledge of problem solutions to define feasible region and discrete neighbor for the MVO problem - initial data analysis + material library $\Rightarrow$ a priori knowledge; and (6) using the NOMAD (C++ version) software in the object.

99 GENERAL AND MISCELLANEOUS↗

Fast, Dynamic, and Scalable Algorithms for Large-Scale Constrained Optimization

Scientists and engineers constantly aim to optimize an objective subject to physical, environmental, and/or resource constraints. The technique of using mathematical models to formulate and find real solutions of such problems is known as mathematical optimization, a process that has become invaluable for design and discovery in numerous scientific fields. This project has focused on the design, analysis, and implementation of high-performance computing algorithms for solving cutting-edge optimization problems. These include problems that involve (1) data uncertainties, such as those in the future supply, demand, and capacity of a given power system, (2) extreme numbers of alternatives, such as in the design of electrical power grids to avoid network vulnerabilities, and (3) real-time decisions, such as in the control of chemical reactors. The key features of the new algorithms are that they are fast, dynamic, and scalable to meet the computational requirements of scientists and researchers working to optimize large-scale, complex systems. The algorithms that have been designed, analyzed, and tested as part of the project can be characterized based on the types of optimization problems they have been designed to solve. Much of the work has focused on algorithms for solving large-scale constrained optimization problems. Contributions have also been made in the design of algorithms for unconstrained optimization, with some specialized methods for solving problems that have inherent nonsmoothness. Contributions have also been made in areas that have grown to prominence in the field over the five-year award period. These include the design of algorithms for solving large-scale stochastic optimization problems, such as those that arise in large-scale machine learning, and in complexity analyses for solving nonconvex problems, which has been a focal point of much recent work in continuous optimization. Overall, the project has supported work that has led to almost 30 articles that have been published or accepted to top journals in the field of mathematical optimization.

97 MATHEMATICS AND COMPUTING↗

Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method

We present the mathematical derivation, software implementation details, and computational results for a semi-smooth Newton method applied to two inverse problems governed by partial differential equations with bound constraints. The two problems share mathematical structural similarities to density-based topology optimization problems. The semi-smooth Newton method provides a mesh independent solution computation for the two test problems. A key step is that the complementarity part of the necessary optimality conditions are reformulated with the use of a complementarity functionφsuch that the complementarity conditions are satisfied if and only if a zero of a nonsmooth function has been obtained. The modular finite element package MFEM is utilized for the software implementation. In addition we constructed a matrix-free Operator to enable the use of efficient Krylov subspace IterativeSolver of MFEM for the solution of our two target problems.

97 MATHEMATICS AND COMPUTING↗

A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints

This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.

97 MATHEMATICS AND COMPUTING↗

On backscatter from spatially varying surfaces

The theory of radar backscatter from rough (spatially varying) surfaces is discussed. An integral equation developed to describe the radar backscatter from a perfectly conducting surface is applied to nonsmooth surfaces. The results are compared with those obtained by Beckmann as well as those obtained by Wright. Differences between the three solutions are discussed.

Grody, N. C.↗

Production of polydisperse sprays.

A device which produces a spray with a controllable drop size distribution is described. This system is especially well suited for generating nonsmooth (e.g., bimodal) distributions, although smooth distributions can also be produced. Droplets of uniform size result from the rapid growth of an oscillatory disturbance in a free liquid jet. Simultaneous generation of droplets of various diameters by this method produces the polydisperse spray. The range of drop diameters is approximately 300-3000 microns.

Pierce, T. H.↗

A new consistent spatial differencing scheme for the transonic full-potential equation

A new spatial differencing scheme for the transonic full-potential equation in conservative form has been developed. This scheme guarantees zero truncation error on any curvilinear mesh for freestream flows in either two- or three-space dimensions. Solutions obtained with this new differencing scheme, away from freestream regions, exhibit greatly improved accuracy, especially for nonsmooth or singular meshes.

Flores, J.↗

Non-oscillatory spectral Fourier methods for shock wave calculations

A non-oscillatory spectral Fourier method is presented for the solution of hyperbolic partial differential equations. The method is based on adding a nonsmooth function to the trigonometric polynomials which are the usual basis functions for the Fourier method. The high accuracy away from the shock is enhanced by using filters. Numerical results confirm that no oscillations develop in the solution. Also, the accuracy of the spectral solution of the inviscid Burgers equation is shown to be higher than a fixed order.

Cai, Wei↗

Optimization-based design of control systems for flexible structures

The purpose of this presentation is to show that it is possible to use nonsmooth optimization algorithms to design both closed-loop finite dimensional compensators and open-loop optimal controls for flexible structures modeled by partial differential equations. An important feature of our approach is that it does not require modal decomposition and hence is immune to instabilities caused by spillover effects. Furthermore, it can be used to design control systems for structures that are modeled by mixed systems of coupled ordinary and partial differential equations.

Polak, E.↗

Essentially nonoscillatory spectral Fourier methods for shock wave calculations

An essentially nonoscillatory spectral Fourier method for the solution of hyperbolic partial differential equations is presented. The method is based on adding a nonsmooth function to the trigonometric polynomials which are the usual basis functions for the Fourier method. The high accuracy away from the shock is enhanced by using filters. Numerical results confirm that essentially no oscillations develop in the solution.

Cai, Wei↗

Supercomputer optimizations for stochastic optimal control applications

Supercomputer optimizations for a computational method of solving stochastic, multibody, dynamic programming problems are presented. The computational method is valid for a general class of optimal control problems that are nonlinear, multibody dynamical systems, perturbed by general Markov noise in continuous time, i.e., nonsmooth Gaussian as well as jump Poisson random white noise. Optimization techniques for vector multiprocessors or vectorizing supercomputers include advanced data structures, loop restructuring, loop collapsing, blocking, and compiler directives. These advanced computing techniques and superconducting hardware help alleviate Bellman's curse of dimensionality in dynamic programming computations, by permitting the solution of large multibody problems. Possible applications include lumped flight dynamics models for uncertain environments, such as large scale and background random aerospace fluctuations.

Chung, Siu-Leung↗