Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Infinite-dimensional 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

How Much Reserve Fuel: Quantifying the Maximal Energy Cost of System Disturbances

Motivated by the design question of additional fuel needed to complete a task in an uncertain environment, this paper introduces metrics to quantify the maximal additional energy used by a control system in the presence of bounded disturbances, compared to a nominal, disturbance-free system. In particular, we consider the task of finite-time stabilization for a linear, time-invariant system. We compare the nominal energy required to achieve this task in the disturbance-free system to the worst-case energy over all feasible disturbances. Solving for the worst-case energy over all disturbances first leads to an optimal control problem with a least-squares solution, and then an infinite-dimensional optimization problem where we derive an upper bound on the solution. The comparison of energies is accomplished using additive and multiplicative metrics, for which we derive bounds. Simulation examples on an ADMIRE fighter jet model demonstrate the practicability of these metrics, and their variation with the distance of the initial condition from the origin and the task completion time.

koopman operator, resilience↗
NASA NTRS1984

Optimal quasi-static shape control for large aerospace antennae

In this paper, an on-line control approach which will adjust the steady-state shape of a large antenna arbitarily close to any achievable desired profile is proposed. The method makes use of distributed parameter system theory and allows refocusing using a limited number of control actuators and sensors. The controller gains are calculated by approximating the solution to an infinite-dimensional optimal quasi-static control problem. A very general convergence result for such quasi-static controllers is proved and applied to the antenna controller to show convergence, using any Galerkin (finite-element) approximation method.

Balas, M. J.↗
NASA NTRS1987

Suboptimal shape control for quasi-static distributed-parameter systems

An on-line control approach which will adjust the steady-state shape of a large antenna arbitrarily close to any achievable desired profile is approached. The method makes use of distributed-parameter system theory and allows refocusing using a limited number of control actuators and sensors. The controller gains are calculated by approximating the solution to an infinite-dimensional optimal quasi-static control problem. The controller gain calculation is computationally simpler than that previously proposed. The Galerkin (finite element) approximation method is used for model reduction. It is proved that both gain and state convergence can be achieved by using the proposed approximation scheme.

Balas, M. J.↗
DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗
NASA NTRS1986

Numerical approximation for the infinite-dimensional discrete-time optimal linear-quadratic regulator problem

An abstract approximation framework is developed for the finite and infinite time horizon discrete-time linear-quadratic regulator problem for systems whose state dynamics are described by a linear semigroup of operators on an infinite dimensional Hilbert space. The schemes included the framework yield finite dimensional approximations to the linear state feedback gains which determine the optimal control law. Convergence arguments are given. Examples involving hereditary and parabolic systems and the vibration of a flexible beam are considered. Spline-based finite element schemes for these classes of problems, together with numerical results, are presented and discussed.

Gibson, J. S.↗
DOE OSTI2025

Entanglement Cost for Infinite-Dimensional Physical Systems

We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state ρ ΑΒ with finite quantum entropy on at least one of the subsystems A or B. This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure—the entanglement cost—for all infinite-dimensional physical systems.

Complexity↗
NASA NTRS1988

A methodology for the synthesis of robust feedback systems

A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.

Milich, David Albert↗
NASA NTRS1987

Stochastic control of infinite dimensional systems in Hilbert space: A factorization perspective

A factorization perspective on problems of optimal causal estimation and optimal causal control of linear stochastic systems defined on an infinite-dimensional Hilbert space is presented. A separation principle is derived for the case in which the system input/output map is generated by an abstract evolution operator. The factorization formalism allows for an essentially algebraic approach to these problems.

Milman, Mark M.↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Davidon-Broyden rank-one minimization methods in Hilbert space with application to optimal control problems

The Davidon-Broyden class of rank one, quasi-Newton minimization methods is extended from Euclidean spaces to infinite-dimensional, real Hilbert spaces. For several techniques of choosing the step size, conditions are found which assure convergence of the associated iterates to the location of the minimum of a positive definite quadratic functional. For those techniques, convergence is achieved without the problem of the computation of a one-dimensional minimum at each iteration. The application of this class of minimization methods for the direct computation of the solution of an optimal control problem is outlined. The performance of various members of the class are compared by solving a sample optimal control problem. Finally, the sample problem is solved by other known gradient methods, and the results are compared with those obtained with the rank one quasi-Newton methods.

Straeter, T. A.↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
DOE OSTI2026

Nonlinear optimal recovery in Hilbert spaces

Here, this paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear optimal recovery problem, establishing its well-posedness and proving its convergence to the true solution as the number of measurements increases. However, the resulting formulation might not have a finite-dimensional solution in general. We thus present a sufficient condition for the finite dimensionality of the solution, applicable to problems with well-defined point evaluation measurements. To address the broader setting, we introduce a relaxed nonlinear optimal recovery and provide a detailed convergence analysis. An illustrative example is given to demonstrate that our formulations and theoretical findings offer a comprehensive framework for solving nonlinear problems in infinite-dimensional spaces with limited data.

convergence↗
DOE OSTI2024

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗
NASA NTRS1975

Optimum testing of multiple hypotheses in quantum detection theory

The problem of specifying the optimum quantum detector in multiple hypotheses testing is considered for application to optical communications. The quantum digital detection problem is formulated as a linear programming problem on an infinite-dimensional space. A necessary and sufficient condition is derived by the application of a general duality theorem specifying the optimum detector in terms of a set of linear operator equations and inequalities. Existence of the optimum quantum detector is also established. The optimality of commuting detection operators is discussed in some examples. The structure and performance of the optimal receiver are derived for the quantum detection of narrow-band coherent orthogonal and simplex signals. It is shown that modal photon counting is asymptotically optimum in the limit of a large signaling alphabet and that the capacity goes to infinity in the absence of a bandwidth limitation.

Yuen, H. P.↗
NASA NTRS1976

The linear quadratic optimal control problem for infinite dimensional systems over an infinite horizon - Survey and examples

Available published results are surveyed for a special class of infinite-dimensional control systems whose evolution is characterized by a semigroup of operators of class C subscript zero. Emphasis is placed on an approach that clarifies the system-theoretic relationship among controllability, stabilizability, stability, and the existence of a solution to an associated operator equation of the Riccati type. Formulation of the optimal control problem is reviewed along with the asymptotic behavior of solutions to a general system of equations and several theorems concerning L2 stability. Examples are briefly discussed which involve second-order parabolic systems, first-order hyperbolic systems, and distributed boundary control.

Bensoussan, A.↗
NASA NTRS1974

Optimal control problems with mixed control-phase variable equality and inequality constraints

In this paper, necessary conditions are obtained for optimal control problems containing equality constraints defined in terms of functions of the control and phase variables. The control system is assumed to be characterized by an ordinary differential equation, and more conventional constraints, including phase inequality constraints, are also assumed to be present. Because the first-mentioned equality constraint must be satisfied for all t (the independent variable of the differential equation) belonging to an arbitrary (prescribed) measurable set, this problem gives rise to infinite-dimensional equality constraints. To obtain the necessary conditions, which are in the form of a maximum principle, an implicit-function-type theorem in Banach spaces is derived.

Makowski, K.↗
NASA NTRS1988

A Mathematical Formulation of the SCOLE Control Problem. Part 2: Optimal Compensator Design

The study initiated in Part 1 of this report is concluded and optimal feedback control (compensator) design for stability augmentation is considered, following the mathematical formulation developed in Part 1. Co-located (rate) sensors and (force and moment) actuators are assumed, and allowing for both sensor and actuator noise, stabilization is formulated as a stochastic regulator problem. Specializing the general theory developed by the author, a complete, closed form solution (believed to be new with this report) is obtained, taking advantage of the fact that the inherent structural damping is light. In particular, it is possible to solve in closed form the associated infinite-dimensional steady-state Riccati equations. The SCOLE model involves associated partial differential equations in a single space variable, but the compensator design theory developed is far more general since it is given in the abstract wave equation formulation. The results thus hold for any multibody system so long as the basic model is linear.

Balakrishnan, A. V.↗
DOE OSTI2025

Interplay Between Time and Energy in Bosonic Noisy Quantum Metrology

Quantum entanglement and coherence often allow for protocols that outperform classical ones in estimating a system’s parameter. When using infinite-dimensional probes (such as a bosonic mode), one could, in principle, obtain infinite precision in a finite time for both classical and quantum protocols, which makes it hard to quantify potential quantum advantage. However, such a situation is unphysical, as it would require infinite resources, so one needs to impose some additional constraint: typically the average energy employed by the probe is finite. Here we treat both energy and time as a resource, showing that, in the presence of noise, there is a nontrivial interplay between the average energy and the time devoted to the estimation. Our results are valid for the most general metrological schemes (e.g., adaptive schemes, which may involve entanglement with external ancillae or any kind of continuous measurement). We apply recently derived precision bounds for all parameters characterizing the paradigmatic case of a bosonic mode, subject to Lindbladian noise. We show how the time employed in the estimation should be partitioned in order to achieve the best possible precision. In most cases, the optimal performance may be obtained without the necessity of adaptivity or entanglement with ancilla. We compare results with classical strategies. Interestingly, for temperature estimation, applying a fast-prepare-and-measure protocol with Fock states provides better scaling with the number of photons than any classical strategy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗