Imagen de Portada

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Prakash, Rudra, Janardhanan, S., Sen, Shaunak
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Systems and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
por: Van Over, Brandon, et al.
Publicado: (2024)

Adaptive control of dynamic networks
por: Pan, Chunyu, et al.
Publicado: (2023)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
por: Li, Bowen, et al.
Publicado: (2024)

Computational Complexity of the Interval Ordering Problem
por: Pawlowski, Simeon, et al.
Publicado: (2026)

Platoon Forming Algorithms for Intelligent Street Intersections
por: Timmerman, R. W., et al.
Publicado: (2019)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
por: Bach, Eleon, et al.
Publicado: (2025)

Solving the Probabilistic Profitable Tour Problem on a Tree
por: Angelelli, Enrico, et al.
Publicado: (2022)

Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021)

Competitive Online Optimization under Inventory Constraints
por: Lin, Qiulin, et al.
Publicado: (2019)

Computing the Center of Uncertain Points on Cactus Graphs
por: Hu, Ran, et al.
Publicado: (2024)

Online Smoothed Demand Management
por: Lechowicz, Adam, et al.
Publicado: (2025)

Warehouse storage and retrieval optimization via clustering, dynamical systems modeling, and GPU-accelerated routing
por: Bengtsson, Magnus, et al.
Publicado: (2025)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
por: Ardizzoni, Stefano, et al.
Publicado: (2021)

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
por: Kadam, Sachin, et al.
Publicado: (2021)

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon
por: Huang, Yu-Han, et al.
Publicado: (2024)

Robust Dynamic Staffing with Predictions
por: Feng, Yiding, et al.
Publicado: (2025)

Computing All Restricted Skyline Probabilities on Uncertain Datasets
por: Gao, Xiangyu, et al.
Publicado: (2023)

On the Complexity of Bilevel Independent Set Problem
por: Muluk, Komal
Publicado: (2026)

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
por: Zorzenon, Davide, et al.
Publicado: (2021)

Polynomial Logical Zonotope: A Set Representation for Reachability Analysis of Logical Systems
por: Alanwar, Amr, et al.
Publicado: (2023)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Near-Optimal Sample Complexity for MDPs via Anchoring
por: Lee, Jongmin, et al.
Publicado: (2025)

DNA Probe Computing System for Solving NP-Complete Problems
por: Xu, Jin, et al.
Publicado: (2025)

Labeling Methods for Partially Ordered Paths
por: Euler, Ricardo, et al.
Publicado: (2023)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026)

Radial Isotropic Position via an Implicit Newton's Method
por: Jambulapati, Arun, et al.
Publicado: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
por: Kasperski, Adam, et al.
Publicado: (2024)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
por: Cole, Richard, et al.
Publicado: (2023)

Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
por: Dereziński, Michał, et al.
Publicado: (2024)

Solving Matrix Games with Near-Optimal Matvec Complexity
por: Karmarkar, Ishani, et al.
Publicado: (2026)

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
por: Vladu, Adrian
Publicado: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
por: Xu, Pan
Publicado: (2025)

Solving convex QPs with structured sparsity under indicator conditions
por: Bienstock, Daniel, et al.
Publicado: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
por: Tarzanagh, Davoud Ataee, et al.
Publicado: (2022)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
por: Gao, Xuan-Zhao, et al.
Publicado: (2024)

On Solving Linear Systems in Sublinear Time
por: Andoni, Alexandr, et al.
Publicado: (2018)

Finding the Balance Rate of Uncertain Signed Graphs
por: Wang, Zeyu, et al.
Publicado: (2026)

The k-Center Problem of Uncertain Points on Graphs
por: Xu, Haitao, et al.
Publicado: (2025)

The Two-Center Problem of Uncertain Points on Trees
por: Xu, Haitao, et al.
Publicado: (2024)

Interval Selection with Binary Predictions
por: Karavasilis, Christodoulos
Publicado: (2025)