In this work, we revisit binary polynomial optimization (BPO) problems with limited treewidth of the associated graph. We provide alternate proofs of the exactness of a reformulated linear program (LP) with O(n.2^d) variables, n being the number of variables and d being the treewidth of the associated graph. The first proof relies on expressing any … Read more
The representation of a function in a higher-dimensional space, often referred to as lifting, can be used to reduce complexity. We investigate how lifting affects the convergence properties of Newton-type methods. For the first time, we conduct a systematic comparison of several lifting strategies on a set of 40 optimal control problems. In addition, we … Read more
This paper proposes a context-aware multi-uncertainty-set distributionally robust chanceconstrained DC optimal power flow model. Meteorological features are projected to partition the non-convex error support into a context-dependent decomposition of conditional local ambiguity sets, with conditional weights inferred via kernel regression. The minimax problem is reformulated into a finite-dimensional second-order cone program with proven asymptotic consistency. … Read more
We study time-of-use pump scheduling to deliver a required volume using a finite set of pump combinations with empirical flow–power performance, subject to per-shift caps on pump switches. We prove a structural theorem: partitioning the horizon into maximal intervals with constant tariff and shift (atoms), there always exists an optimal schedule with at most one … Read more
In this paper, we develop a stochastic set-valued optimization (SVO) framework tailored for robust machine learning. In the SVO setting, each decision variable is mapped to a set of objective values, and optimality is defined via set relations. We focus on SVO problems with hyperbox sets, which can be reformulated as multi-objective optimization (MOO) problems … Read more
Stochastic minimax problems with decision-dependent distributions (SMDD) have emerged as a crucial framework for modeling complex systems where data distributions drift in response to decision variables. Most existing methods for SMDD rely on an explicit functional relationship between the decision variables and the probability distribution. In this paper, we propose two sample-based zeroth-order algorithms, namely … Read more
We prove the NP-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the n×n rank-one matrices over {0, 1}. The problems are: membership, rank of the decomposition, and a “relaxed rank” obtained from relaxing the zero-norm expression for the rank to an ℓ1 norm. … Read more
In this paper, we propose two Bregman regularized proximal point methods that provide flexibility to compute projected solutions for quasi-equilibrium problems. Each method has one Bregman projection onto the feasible set and the regularized equilibrium problem. Under standard assumptions, we prove that the methods are well-defined and that the sequences they generate converge to a … Read more
Electric power infrastructure faces increasing risk of damage and disruption due to wildfire. Operators of power grids in wildfire-prone regions must consider the potential impacts of unpredictable fires. However, traditional wildfire models do not effectively describe worst-case, or even high-impact, fire behavior. To address this issue, we propose a mixed-integer conic program to characterize an … Read more
We study the tactical problem of determining a last-mile delivery fleet size while accounting for day-to-day uncertainty in the number and location of customer requests. An optimally sized fleet must balance the cost of contracting vehicles against the penalty costs of unserved customers: a larger fleet reduces the risk of unserved demand, but a smaller … Read more