The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

This paper proposes a Hybrid Augmented Lagrangian (HyAL) method that integrates the constraint-handling strengths of the AL framework with the exploratory power of population-based search.

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…

This paper presents a polynomial-time algorithm for recovering item values in the fractional knapsack problem using comparison queries, and provides a lower bound.

This paper derives an exact Bellman dynamic program for subset selection with a continuous integral $R_2$ indicator using an adjacent-neighbor decomposition.

The paper introduces a unified theoretical framework for gradient aggregation in multi-objective optimization, establishing convergence rates and sufficient conditions for achieving Pareto stationarit…

This paper proposes a game-theoretic framework using Shapley Effects and Pareto front sets for interpretable hyperparameter-objective interaction analysis.

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

The paper analyzes preference-shaped expected improvement criteria for Bayesian multiobjective optimization, precisely characterizing when transformations preserve key properties like exact computatio…

This paper proposes CertifiedCacheMPC, a caching system for Model Predictive Control in hierarchical quadruped controllers, ensuring primal feasibility and cost suboptimality.

The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.

The paper re-examines the Parking Permit Problem using the primal-dual scheme, obtaining simple algorithms with superior performance guarantees and providing near-matching lower bounds.

This paper constructs strictly convex quadratic problems and initial points for which the long Barzilai--Borwein method does not converge root-superlinearly.