Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration

DOI10.1137/16M1110005zbMath1387.62130arXiv1701.04695OpenAlexW2578115493WikidataQ114978702 ScholiaQ114978702MaRDI QIDQ4636381

James Oreluk, Arun Hegde, Michael Frenklach, Wenyu Li, Andrew K. Packard

Publication date: 19 April 2018

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.04695

zbMATH Keywords

inverse problemconsistencymodel validationuncertainty quantificationcomputer modelsbound-to-bound data collaboration

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Applications of statistics to physics (62P35)

Related Items (1)

Representing Model Discrepancy in Bound-to-Bound Data Collaboration

Uses Software

• Matlab
• CVX
• GRI-Mech 3.0

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Galaxy formation: Bayesian history matching for the observable Universe
• Numerical approaches for collaborative data processing
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Semidefinite programming relaxation for nonconvex quadratic programs
• Semidefinite programming relaxations for semialgebraic problems
• Computer model validation with functional output
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Galaxy formation: a Bayesian uncertainty analysis
• Global Optimization with Polynomials and the Problem of Moments
• Bayesian Calibration of Computer Models
• Systems Biology
• Graph Implementations for Nonsmooth Convex Programs
• Comparison of Statistical and Deterministic Frameworks of Uncertainty Quantification
• Decoding by Linear Programming
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Model validation: a connection between robust control and identification
• Sparse Approximate Solutions to Linear Systems
• Semidefinite Programming
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution

This page was built for publication: Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration