skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Uniqueness of minimizers of weighted least gradient problems arising in hybrid inverse problems
Award ID(s):
1715850
PAR ID:
10057476
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Calculus of Variations and Partial Differential Equations
Volume:
57
Issue:
1
ISSN:
0944-2669
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. A class of nonlinear, stochastic staticization control problems (including minimization problems with smooth, convex, coercive payoffs) driven by diffusion dynamics with constant diffusion coefficient is considered. A fundamental solution form is obtained where the same solution can be used for a limited variety of terminal costs without re-solution of the problem. One may convert this fundamental solution form from a stochastic control problem form to a deterministic control problem form. This yields an equivalence between certain second-order (in space) Hamilton-Jacobi partial differential equations (HJ PDEs) and associated first-order HJ PDEs. This reformulation has substantial numerical implications. 
    more » « less
  2. Many problems in programming language theory and formal methods are undecidable, so they cannot be solved precisely. Practical techniques for dealing with undecidable problems are often based on decidable approximations. Undecidability implies that those approximations are always imprecise. Typically, practitioners use heuristics andad hocreasoning to identify imprecision issues and improve approximations, but there is a lack of computability-theoretic foundations about whether those efforts can succeed. This paper shows a surprising interplay between undecidability and decidable approximations: there exists a class of undecidable problems, such that it is computable to transform any decidable approximation to a witness input demonstrating its imprecision. We call those undecidable problemswitnessable problems. For example, if a program propertyPis witnessable, then there exists a computable functionfP, such thatfPtakes as input the code of any program analyzer targetingPand produces an input programwon which the program analyzer is imprecise. An even more surprising fact is that the class of witnessable problems includes almost all undecidable problems in programming language theory and formal methods. Specifically, we prove the diagonal halting problemKis witnessable, and the class of witnessable problems is closed under complements and many-one reductions. In particular, all “non-trivial semantic properties of programs” mentioned in Rice’s theorem are witnessable. We also explicitly construct a problem in the non-witnessable (and undecidable) class and show that both classes have cardinality 20. Our results offer a new perspective on the understanding of undecidability: for witnessable problems, although it is impossible to solve them precisely, it is always possible to improve any decidable approximation to make it closer to the precise solution. This fact formally demonstrates that research efforts on such approximations are promising and shows there exist universal ways to identify precision issues of program analyzers, program verifiers, SMT solvers, etc., because their essences are decidable approximations of witnessable problems. 
    more » « less
  3. The relationship between (a) the structure and composition of the landscape around an individual's home and (b) environmental perceptions and health outcomes has been well demonstrated (eg the value of vegetation cover to well‐being). Few studies, however, have examined how multiple landscape features (eg vegetation and water cover) relate to perceptions of multiple environmental problems (eg air or water quality) and whether those relationships hold over time. We utilized a long‐term dataset of geolocated telephone surveys in Baltimore, Maryland, to identify relationships between residents’ perceptions of environmental problems and nearby landcover. Residents of neighborhoods with more vegetation or located closer to water were less likely to perceive environmental problems. Water quality was one exception to this trend, in that people were more likely to perceive water‐quality problems when nearby water cover was greater. These trends endured over time, suggesting that these relationships are stable and therefore useful for informing policy aimed at minimizing perceived environmental problems. 
    more » « less
  4. A new optimal control based representation for stationary action trajectories is constructed by exploiting connections between semiconvexity, semiconcavity, and stationarity. This new representation is used to verify a known two-point boundary value problem characterization of stationary action. 
    more » « less
  5. A class of nonlinear, stochastic staticization control problems (including minimization problems with smooth, convex, coercive payoffs) driven by diffusion dynamics and constant diffusion coefficient is considered. Using dynamic programming and tools from static duality, a fundamental solution form is obtained where the same solution can be used for a variety of terminal costs without re-solution of the problem. Further, this fundamental solution takes the form of a deterministic control problem rather than a stochastic control problem. 
    more » « less