Solving equations and optimization problems with uncertainty

DOI10.1007/s41468-017-0009-6zbMath1416.65141arXiv1607.06344OpenAlexW2963493846MaRDI QIDQ1616393

R. Smith

Publication date: 6 November 2018

Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)

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

zbMATH Keywords

uncertaintyobstructionscomputational homotopy theory

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Simplicial sets and complexes in algebraic topology (55U10)

Related Items (1)

Filling random cycles

Uses Software

• Gudhi
• PHAT
• TopDeg

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey article: an elementary illustrated introduction to simplicial sets
• Kernel characterization of an interval function
• Computing well diagrams for vector fields on \(\mathbb R^n\)
• Robust optimization - a comprehensive survey
• On the existence theorems of Kantorovich, Miranda and Borsuk
• Robust optimization-methodology and applications
• Topological persistence and simplification
• Loop detection of mobile robots using interval analysis
• Homology and robustness of level and interlevel sets
• Quasi-decidability of a fragment of the first-order theory of real numbers
• The shifted number system for fast linear algebra on integer matrices
• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
• Polynomial-time homology for simplicial Eilenberg-MacLane spaces
• Extendability of continuous maps is undecidable
• Simplification techniques for maps in simplicial topology
• Cohomology operations, and obstructions to extending continuous functions
• Products of cocycles and extensions of mappings
• Computation of Cubical Steenrod Squares
• PHAT – Persistent Homology Algorithms Toolbox
• The Gudhi Library: Simplicial Complexes and Persistent Homology
• Verification methods: Rigorous results using floating-point arithmetic
• Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
• Fast simulation of Gaussian random fields
• Theory and Applications of Robust Optimization
• Computing All Maps into a Sphere
• Inner and Outer Approximations of Existentially Quantified Equality Constraints
• The Robustness of Level Sets
• Introduction to Numerical Continuation Methods
• The Undecidability of the Existence of Zeros of Real Elementary Functions
• Existence verification for singular and nonsmooth zeros of real nonlinear systems
• Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
• Effective topological degree computation based on interval arithmetic
• On Computability and Triviality of Well Groups
• Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
• On Products of Complexes

This page was built for publication: Solving equations and optimization problems with uncertainty