Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Variational inequality”

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 OSTI2025

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗
DOE OSTI2024

A phase-field diffraction model for thermo-hydro-mechanical propagating fractures

This paper introduces a novel diffraction based thermo-hydraulic–mechanical (THM) model for fracture propagation using a phase-field fracture (PFF) approach. The key innovation of the THM-PFF model lies in its integrated treatment of four solution variables—displacements, phase-field, pressure, and temperature—each governed by a combination of conservation of momentum (mechanics problem), a variational inequality (constrained minimization problem), mass conservation (pressure problem), and energy conservation (temperature problem). This leads to a new formulation of a coupled variational inequality system. A major advancement is the development of an extended fixed-stress algorithm, where displacements, phase-field, pressures, and temperatures are solved in a staggered sequence. An important aspect of this work is the global coupling of pressures and temperatures across the domain using diffraction systems, with diffraction coefficients defined by material parameters weighted by the diffusive phase-field variable. To ensure robust local mass conservation, we employ enriched Galerkin finite elements (EG) for both pressure and temperature diffraction equations. By enriching the continuous Galerkin basis functions with discontinuous piecewise constants, EG accurately represents solution and parameter discontinuities while preserving local mass and energy conservation—crucial aspects for THM problems and realistic behavior. Moreover, the use of a predictor–corrector local mesh adaptivity scheme is employed, allowing the model to handle small phase-field length-scale parameters while maintaining high numerical accuracy and reasonable computational cost. Furthermore, these new model and algorithmic developments represent significant advances in the field and have been substantiated through rigorous numerical tests.

Diffraction systems↗
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↗
DOE OSTI2025

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗
NASA NTRS2012

High-Performance Modeling and Simulation of Anchoring in Granular Media for NEO Applications

NASA is interested in designing a spacecraft capable of visiting a near-Earth object (NEO), performing experiments, and then returning safely. Certain periods of this mission would require the spacecraft to remain stationary relative to the NEO, in an environment characterized by very low gravity levels; such situations require an anchoring mechanism that is compact, easy to deploy, and upon mission completion, easy to remove. The design philosophy used in this task relies on the simulation capability of a high-performance multibody dynamics physics engine. On Earth, it is difficult to create low-gravity conditions, and testing in low-gravity environments, whether artificial or in space, can be costly and very difficult to achieve. Through simulation, the effect of gravity can be controlled with great accuracy, making it ideally suited to analyze the problem at hand. Using Chrono::Engine, a simulation pack age capable of utilizing massively parallel Graphic Processing Unit (GPU) hardware, several validation experiments were performed. Modeling of the regolith interaction has been carried out, after which the anchor penetration tests were performed and analyzed. The regolith was modeled by a granular medium composed of very large numbers of convex three-dimensional rigid bodies, subject to microgravity levels and interacting with each other with contact, friction, and cohesional forces. The multibody dynamics simulation approach used for simulating anchors penetrating a soil uses a differential variational inequality (DVI) methodology to solve the contact problem posed as a linear complementarity method (LCP). Implemented within a GPU processing environment, collision detection is greatly accelerated compared to traditional CPU (central processing unit)- based collision detection. Hence, systems of millions of particles interacting with complex dynamic systems can be efficiently analyzed, and design recommendations can be made in a much shorter time. The figure shows an example of this capability where the Brazil Nut problem is simulated: as the container full of granular material is vibrated, the large ball slowly moves upwards. This capability was expanded to account for anchors of different shapes and penetration velocities, interacting with granular soils.

Quadrelli, Marco B.↗
DOE OSTI2025

A Regularized Variance-Reduced Modified Extragradient Method for Stochastic Hierarchical Games

We consider an N -player hierarchical game in which the i th player’s objective comprises of an expectation-valued term, parametrized by rival decisions, and a hierarchical term. Such a framework allows for capturing a broad range of stochastic hierarchical optimization problems, Stackelberg equilibrium problems, and leader-follower games. We develop an iteratively regularized and smoothed variance-reduced modified extragradient framework for iteratively approaching hierarchical equilibria in a stochastic setting. We equip our analysis with rate statements, complexity guarantees, and almost-sure convergence results. We then extend these statements to settings where the lower-level problem is solved inexactly and provide the corresponding rate and complexity statements. Our model framework encompasses many game theoretic equilibrium problems studied in the context of power markets. We present a realistic application to the study of virtual power plants, emphasizing the role of hierarchical decision making and regularization. Preliminary numerics suggest that empirical behavior compares well with theoretical guarantees.

Tikhonov regularization↗
NASA NTRS1972

Optimum configurations for bangless sonic booms.

A number of optimization problems are posed and solved for supersonic aircraft flight subject to the condition that a shock wave appears only incipiently in the sonic boom signal at a given point. The principal result is one giving the maximum effective gross weight of an aircraft of given effective length under given flight conditions. The calculus of variations with inequality constraints is used, with the novel features of a non-local isoperimetric relation and of only an upper bound on a control variable.

Hayes, W. D.↗
NASA NTRS1988

Performance limits for optimal microburst encounter

An effort has been made to ascertain the envelope-edges for uneventful aircraft penetrations of microburst windshears on the basis of optimal aircraft control strategies. Over 1100 such trajectories have been computed for contemporary airliners and general aviation aircraft, in the case of idealized microbursts, using a successive quadratic program trajectory optimization algorithm able to directly handle inequality constraints. Variations of optimal performance with microburst type, intensity, length scale, and location, define performance limits; these limits fall into short, intermediate, and long microburst length scale regimes. The ability to safely transit a microburst also varies strongly with microburst location.

Psiaki, Mark L.↗
NASA NTRS1989

Determination of design and operation parameters for upper atmospheric research instrumentation to yield optimum resolution with deconvolution, appendix 4

The power spectrum for a stationary random process can be defined with the Wiener-Khintchine Theorem, which says that the power spectrum and the auto correlation function are a Fourier transform pair. To implement this theorem for signals that are discrete and of finite length we can use the Blackman-Tukey method. Blackman and Tukey (1958) show that a function w(tau), called a lag window, can be applied to the auto correlation estimates to obtain power spectrum estimates that are statistically stable. The Fourier transform of w(r) is called a spectral window. Typical choices for spectral windows show a distinct trade-off between the main lobe width and side lobe strength. A new idea for designing windows by taking linear combinations of the standard windows to produce hybrid windows was introduced by Smith (1985). We implement Smith's idea to obtain spectral windows with narrow main lobes and smaller (compared with typical windows) near side lobes. One of the main contributions of this thesis is that we show that Smith's problem is equivalent to a Quadratic Programming (QP) problem with linear equality and inequality constraints. A computer program was written to produce hybrid windows by setting up and solving the QP problem. We also developed and solved two variations of the original problem. The two variations involved changing the inequality constraints in both cases from non negativity on the combination coefficients to non negativity on the hybrid lag window itself. For the second variation, the window functions used to construct the hybrid window were changed to a frequency-variable set of truncated cosinusoids. A series of tests was run with the three computer programs to investigate the behavior of the hybrid spectral and lag windows. Emphasis was put on obtaining spectral windows with both relatively narrow main lobes and the lowest possible (for these algorithms) near side lobes. Some success was achieved for this goal. A 10 dB peak side lobe reduction over the rectangular spectral window without significant main lobe broadening was achieved. Also, average side lobe levels of -117 dB were reached at a cost of doubling the main lobe width (at the -3 dB point).

Ioup, George E.↗
NASA NTRS1973

A result on differential inequalities and its application to higher order trajectory derivatives

A result on differential inequalities is obtained by considering the adjoint differential equation of the variational equation of the right side of the inequality. The main theorem is proved using basic results on differentiability of solutions with respect to initial conditions. The result is then applied to the problem of determining solution behavior using comparison techniques.

Gunderson, R. W.↗
NASA NTRS1984

Theoretical study of miscibility and glass-forming trends in mixtures of polystyrene spheres

A theoretical study of glass-forming trends and miscibility in mixtures of polystyrene spheres (polyballs) of different diameters, suspended in an aqueous solution, is presented. The polyballs are assumed to be charged and to interact via a Debye-Hueckel screened Coulomb potential. The Helmholtz free energy is calculated from a variational principle based on the Gibbs-Bogoliubov inequality, in which a mixture of hard spheres of different diameters is chosen as the reference system. It is found that when the charges of the two types of polyballs are sufficiently different, the variationally determined ratio of hard-sphere diameters differs substantially, leading to packing difficulties characteristic of glass formation. The experimentally observed range of glass formation corresponds to a ratio of hard-sphere diameters of 0.8 or less. Calculations of the free energy as a function of concentration indicate that the liquid polyball mixture is stable against the phase separation, even for widely different polyball charges.

Shih, W.-H.↗
NASA NTRS1965

Necessary conditions for a multistage bolza- mayer problem involving control variables and having inequality and finite equation constraints

A multiplier rule and analogues of the Weierstrass and Clebsch conditions are developed for a multistage Bolza-Meyer calculus of variations problems. The number of stages is fixed, but partition points defining state boundaries are variable. Discontinuities are allowed in variables finite equations and inequalities, as well as differential equations, all of which involve control variables. An appendix summarizes some of the results obtained by C. H. Denbow, as modified by R. W. hunt, for a generalized Bolza problem. The appendix is independent of the rest of the paper.

Differential equation↗
NASA NTRS1977

Imaginary-frequency polarizability and van der Waals force constants of two-electron atoms, with rigorous bounds

Variational functionals of Braunn and Rebane (1972) for the imagery-frequency polarizability (IFP) have been generalized by the method of Gramian inequalities to give rigorous upper and lower bounds, valid even when the true (but unknown) unperturbed wavefunction must be represented by a variational approximation. Using these formulas in conjunction with flexible variational trial functions, tight error bounds are computed for the IFP and the associated two- and three-body van der Waals interaction constants of the ground 1(1S) and metastable 2(1,3S) states of He and Li(+). These bounds generally establish the ground-state properties to within a fraction of a per cent and metastable properties to within a few per cent, permitting a comparative assessment of competing theoretical methods at this level of accuracy. Unlike previous 'error bounds' for these properties, the present results have a completely a priori theoretical character, with no empirical input data.

Glover, R. M.↗
NASA NTRS1991

Configuration optimization of space structures

The objective is to develop a computer aid for the conceptual/initial design of aerospace structures, allowing configurations and shape to be apriori design variables. The topics are presented in viewgraph form and include the following: Kikuchi's homogenization method; a classical shape design problem; homogenization method steps; a 3D mechanical component design example; forming a homogenized finite element; a 2D optimization problem; treatment of volume inequality constraint; algorithms for the volume inequality constraint; object function derivatives--taking advantage of design locality; stiffness variations; variations of potential; and schematics of the optimization problem.

Felippa, Carlos↗
DOE OSTI2025

Solar cities: A case study analysis of city-level enablers of expanded solar energy access

Rooftop solar photovoltaic (PV) adoption can benefit households by reducing electricity bills and enhancing energy resiliency. Low and moderate-income (LMI) households have been less likely to adopt PV and experience these benefits in the United States than higher-income households. Adopter income trends are often explored through quantitative analysis with limited explanatory power. Our quantitative analysis only explains around one-third of city-level variation in LMI adoption trends through socioeconomic factors such as median home values and income inequality and PV market factors such as cumulative adoption and incentives. We implement semi-structured interviews in three case studies of cities with relatively high rates of LMI PV adoption to better understand the factors that explain PV adopter income trends. The case studies partly reiterate findings from quantitative analysis, such as the role of PV incentives. The case studies reveal a broader set of LMI adoption drivers that are missed in quantitative analyses. The case studies show how city contexts can affect LMI adoption, such as the role of supportive city governments. The case studies also reveal the importance of partnerships, such as partnerships between city governments and state LMI PV program implementers. Finally, interviewees emphasized the importance of building trust among prospective LMI PV adopters. Interviewees suggested that partnerships, outreach, and consumer protection measures were crucial to building trust in PV installers among LMI households.

Adoption↗
NASA NTRS1985

On the convergence of difference approximations to scalar conservation laws

A unified treatment of explicit in time, two level, second order resolution, total variation diminishing, approximations to scalar conservation laws are presented. The schemes are assumed only to have conservation form and incremental form. A modified flux and a viscosity coefficient are introduced and results in terms of the latter are obtained. The existence of a cell entropy inequality is discussed and such an equality for all entropies is shown to imply that the scheme is an E scheme on monotone (actually more general) data, hence at most only first order accurate in general. Convergence for total variation diminishing-second order resolution schemes approximating convex or concave conservation laws is shown by enforcing a single discrete entropy inequality.

Osher, S.↗
NASA NTRS1973

Optimal control of a variable spin speed CMG system for space vehicles

Many future NASA programs require very high accurate pointing stability. These pointing requirements are well beyond anything attempted to date. This paper suggests a control system which has the capability of meeting these requirements. An optimal control law for the suggested system is specified. However, since no direct method of solution is known for this complicated system, a computation technique using successive approximations is used to develop the required solution. The method of calculus of variations is applied for estimating the changes of index of performance as well as those constraints of inequality of state variables and terminal conditions. Thus, an algorithm is obtained by the steepest descent method and/or conjugate gradient method. Numerical examples are given to show the optimal controls.

Liu, T. C.↗
NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗