Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems

We introduce a new class of problems, termed multi-split multiple-sets implicit convex feasibility problems (MSMS-ICFPs), define a proximity function for it and analyze its properties under certain assumptions on the involved general point-to-set operators. Additionally, we discuss its properties for a special class of point-to-set operators. For these kinds of point-to-set operators, we deploy a … Read more

Fast Subproblem Solving in Benders Decomposition for Affine Potential-Based Flow Problems with Topology Switching and Scenarios

Potential-based flow problems arise for a range of practical problems, like the operation of lossless power networks. The distribution of flows through the network is governed by the potential equation, which relates arc flows and node potentials following arc potential functions. We consider a general variant with affine potential functions, topology switching, and scenarios. It … Read more

A cardinality-indexed extended formulation with valid inequalities for unsplittable multicommodity network design

We study the unsplittable multicommodity fixed-charge network design problem, in which every commodity follows a single path and each arc is installed at most once. Its linear relaxation is weak because a commodity may occupy a fraction of an arc. We propose an extended formulation that indexes the variables of each arc by the number … Read more

Kuhn-Tucker Demand Models: Scalable Estimation and Universal Approximation

Kuhn-Tucker (KT) demand models characterize consumers’ budget allocation through the Karush-Kuhn-Tucker conditions of utility maximization. Classical specifications, including quadratic utility, are widely used to study pricing, assortment, and competition, but remain difficult to estimate from consumer data. By contrast, models designed for tractable estimation often impose restrictive assumptions on demand behavior. We address this gap … Read more

A particle swarm optimization with a reduced-subspace trust-region safeguard for contact-rich controller tuning

Contact-rich robotic insertion is challenging because uncertainty in alignment, friction, and contact conditions can lead to unsuccessful assembly, excessive contact forces,  and jamming. Designing a reliable controller therefore requires balancing insertion performance, robustness, and recovery from unexpected contact. In this paper, we propose PSO+TR, a derivative-free optimization (DFO) method that combines the exploratory search of … Read more

A Facet Enumeration Algorithm for Convex Polytopes

This paper proposes a simple facet enumeration algorithm for convex polytopes. The complexity of the algorithm is analyzed. The algorithm is implemented in Matlab. Some polytopes with known H-representations and V-representations are used as test examples. The preliminary numerical test shows the effectiveness and efficiency of the proposed algorithm. Due to the duality between the … Read more

Optimal charge scheduling of electric vehicle fleets through dynamic pricing and intraday market trading

We consider an electricity supplier for a large commercial electric vehicle (EV) fleet. The supplier uses a dynamic pricing scheme for buying and selling energy from and to the fleet, enabling the supplier to trade any deviations from the agreed day-ahead (DA) position in the intraday auction (IDA) market, while taking into account the behavior … Read more

Risk-Constrained MPPI Tuning with Update-Aware MA-ES Racing

We formulate offline tuning of Model Predictive Path Integral (MPPI) controllers as a chance-constrained black-box optimization problem and develop an update-aware framework based on Matrix Adaptation Evolution Strategy (MA-ES). We use statistical information from noisy controller evaluations to determine when the evolutionary update is sufficiently reliable. When the recombination direction is certified, a derivative-free nonmonotone … Read more

Equivalence-Based Reduction and Incremental Optimization for Categorical and Ordinal Classification

Exact mathematical programming formulations for estimating classification rules provide guarantees of empirical optimality, but their size grows rapidly with the number of predictive features and model complexity. This paper shows that interpretable classifiers can be estimated by directly maximizing empirical classification accuracy under complexity constraints, using truncation and warm-start strategies compatible with disjunctive normal form … Read more

Complexity of output feedback stabilization

We show that unless \(\mathrm P=\mathrm{NP}\), there cannot be a polynomial-time (or even pseudo-polynomial-time) algorithm for output feedback stabilization of a linear dynamical system with a linear controller. This settles one of the best-known open problems in control theory. The result holds in both continuous and discrete time. We also present a family of stabilizable … Read more