:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bhargav, Jayanth, Ghasemi, Mahsa, Sundaram, Shreyas
Format:	Preprint
Published:	2024
Subjects:	Systems and Control Computational Complexity Optimization and Control
Online Access:	https://arxiv.org/abs/2407.07310
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Submodular Information Selection for Hypothesis Testing with Misclassification Penalties
by: Bhargav, Jayanth, et al.
Published: (2024)

Sensor Scheduling in Intrusion Detection Games with Uncertain Payoffs
by: Bhargav, Jayanth, et al.
Published: (2025)

Robust Information Selection for Hypothesis Testing with Misclassification Penalties
by: Bhargav, Jayanth, et al.
Published: (2025)

Distributed Equilibrium-Seeking in Target Coverage Games via Self-Configurable Networks under Limited Communication
by: Bhargav, Jayanth, et al.
Published: (2026)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
by: Jin, Ruiyang, et al.
Published: (2025)

Convex Approximations of Random Constrained Markov Decision Processes
by: Varagapriya, V, et al.
Published: (2025)

On the Complexity of p-Order Cone Programs
by: Blanco, Víctor, et al.
Published: (2025)

The Complexity of Recognizing Facets for the Knapsack Polytope
by: Chen, Rui, et al.
Published: (2022)

The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
by: Lee, Jongmin, et al.
Published: (2026)

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
by: Asadi, Ali, et al.
Published: (2025)

A direct optimization algorithm for input-constrained MPC
by: Wu, Liang, et al.
Published: (2023)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
by: Tyurin, Alexander
Published: (2024)

Quantum Markov Decision Processes: General Theory, Approximations, and Classes of Policies
by: Saldi, Naci, et al.
Published: (2024)

Markov Decision Process and Approximate Dynamic Programming for a Patient Assignment Scheduling problem
by: O'Reilly, Malgorzata M., et al.
Published: (2024)

Minimal Actuator Selection
by: Ballotta, Luca, et al.
Published: (2026)

Subgradient Method for System Identification with Non-Smooth Objectives
by: Yalcin, Baturalp, et al.
Published: (2025)

Operator Splitting for Convex Constrained Markov Decision Processes
by: Grontas, Panagiotis D., et al.
Published: (2024)

Markov Decision Process Design: A Framework for Integrating Strategic and Operational Decisions
by: Brown, Seth, et al.
Published: (2023)

Quantum Markov Decision Processes: Dynamic and Semi-Definite Programs for Optimal Solutions
by: Saldi, Naci, et al.
Published: (2024)

The Complexity of Finding Local Optima in Contrastive Learning
by: Yan, Jingming, et al.
Published: (2025)

Linear Equations with Min and Max Operators: Computational Complexity
by: Chatterjee, Krishnendu, et al.
Published: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
by: Figueira, José Rui, et al.
Published: (2024)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
by: Hollender, Alexandros, et al.
Published: (2023)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
by: Ketkov, Sergey S., et al.
Published: (2024)

Avoiding Deadlocks via Weak Deadlock Sets
by: Oriolo, Gianpaolo, et al.
Published: (2024)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
by: Maitra, Sarit
Published: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
by: Jiao, Xianqi, et al.
Published: (2024)

Geometric and computational hardness of bilevel programming
by: Bolte, Jérôme, et al.
Published: (2024)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
by: Sim, Chee-Khian
Published: (2024)

A parallel framework for graphical optimal transport
by: Fan, Jiaojiao, et al.
Published: (2024)

Hardness of some optimization problems over correlation polyhedra
by: Caprara, Alberto, et al.
Published: (2026)

On the Induced Norms of Matrices and Grothendieck problems
by: Truong, Lan V., et al.
Published: (2026)

Efficient LP warmstarting for linear modifications of the constraint matrix
by: Derval, Guillaume, et al.
Published: (2025)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
by: Majumdar, Angshul
Published: (2026)

On the Degree Automatability of Sum-of-Squares Proofs
by: Bortolotti, Alex, et al.
Published: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
by: Büsing, Christina, et al.
Published: (2025)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
by: Chen, Ying, et al.
Published: (2025)

Counterfactual Explanations for Integer Optimization Problems
by: Engelhardt, Felix, et al.
Published: (2025)

A parameterized linear formulation of the integer hull
by: Eisenbrand, Friedrich, et al.
Published: (2025)