Robust feasibility of systems of quadratic equations using topological degree theory
From MaRDI portal
Publication:6151531
DOI10.1007/s11590-023-02015-7arXiv1907.12206OpenAlexW2966172824MaRDI QIDQ6151531
No author found.
Publication date: 11 March 2024
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.12206
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computability and triviality of well groups
- Quantifying transversality by measuring the robustness of intersections
- Min-max and robust polynomial optimization
- On the complexity of isolating real roots and computing with certainty the topological degree
- Robust linear optimization under general norms.
- Computing well diagrams for vector fields on \(\mathbb R^n\)
- Tractable stochastic analysis in high dimensions via robust optimization
- Proving the existence of zeros using the topological degree and interval arithmetic
- Robust solutions of uncertain linear programs
- Robust global optimization with polynomials
- Nonconvex Robust Optimization for Problems with Constraints
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Robust Satisfiability of Systems of Equations
- The Robustness of Level Sets
- The Price of Robustness
- Semidefinite Programming
- Effective topological degree computation based on interval arithmetic
- Compact Subsets of R n and Dimension of Their Projections
- Optimal Design for Multi-Item Auctions: A Robust Optimization Approach
- Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
This page was built for publication: Robust feasibility of systems of quadratic equations using topological degree theory
