Search NASA⌕ Search

SEARCH · Search NASA

Results for “variational inequality problems”

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.

10 records
All sourcesNASA NTRSDOE OSTI
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↗
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 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 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↗
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 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 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 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 NTRS1972

N-burn optimal analytic trajectories.

Derivation of N-burn analytic solutions for propellant-optimal transfer trajectories of a vehicle in a vacuum between arbitrary boundary conditions. Variational changes in the desired boundary conditions are expressed, in general, in terms of variational changes in the control vector and in the initial state vector. All coefficient matrices are computed recursively in terms of the analytic matrices established from the subarcs of the N-burn solution. The solution is applicable to shuttle ascent (exoatmospheric), rendezvous, and deorbit problems. Consideration is also given to state-variable and control-variable inequality constraints.

Jezewski, D. J.↗
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↗