Complementarity constraints are treated as a Lie group under relaxation to enable parameterization that satisfies them by construction in LCQP solvers.
hub
Gurobi Optimizer Reference Manual
20 Pith papers cite this work. Polarity classification is still indexing.
20
Pith papers citing it
hub tools
citation-role summary
method 1
other 1
citation-polarity summary
representative citing papers
A hybrid controller samples low-dimensional end-effector targets for a contact-free stage then runs local complementarity MPC at each sample to approximate global contact-implicit optimization.
ProF repairs DNNs for individual fairness by using interval bound propagation to bound outputs over input sets and solving a MILP to adjust the model with guarantees on those sets.
DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.
A frequency nadir-constrained MILP framework for black-start restoration that incorporates energy storage to maintain frequency security and shorten recovery time.
A dynamic saturation rate extension to the multi-commodity store-and-forward model is reformulated as an efficient MILP that outperforms prior multi-commodity approaches in mixed CAV-HDV traffic simulations.
Ternary logic encodings of temporal behavior trees enable mixed-integer linear programming for correct-by-construction control synthesis in linear systems.
A nested amplitude amplification protocol for knapsack performs partial amplification on initial variables via an Inner Iteration Finder before global GAS, reducing solution improvement costs versus baseline in simulations on large instances.
ODYN is a novel all-shifted non-interior-point primal-dual QP solver with strong warm-start performance for robotics and AI applications.
A new series-parallel decomposition algorithm for general DAGs enables task mapping in heterogeneous systems that improves makespan over HEFT variants while running orders of magnitude faster than genetic algorithms or ILPs.
An attention-based DRL agent with Transformer encoder and GNN learns heuristics for qubit-to-core allocation in multi-core quantum systems to minimize state transfers and online compilation time.
SPARK is a sparsity-aware near-cache ILP accelerator that reuses L1 cache structures to deliver up to 15x speedup and 152x energy reduction versus CPUs on sparse MIPLIB workloads with 1.4% area overhead.
SHIELD derives safe certificates from Lagrangian duality to reduce decision variables and constraints in convex programs, accelerated by a transformer network, delivering order-of-magnitude speedups in stochastic MPC for multi-modal traffic with preserved feasibility and safety.
Feasibility-aware imitation learning accelerates Benders decomposition by predicting feasible integer assignments in the master problem, improving solution times over prior imitation learning methods while retaining finite convergence.
LACE-S uses a neural representation with a projection layer and Jacobian regularization to produce locational carbon emission metrics that remain consistent with total emissions and sensitivities, leading to reliable system-wide emission reductions in load-shifting tests unlike prior metrics.
A progressive integrality outer-inner approximation framework solves large-scale AC unit commitment problems faster and more robustly than commercial solvers on 200- and 500-bus networks.
A scalable PTDF-based two-stage optimization framework with trust-region multicut Benders decomposition for co-optimizing transmission and storage under high renewables, demonstrated on a 2000-bus synthetic Texas system with sub-2% optimality gaps.
QAOA-based QuSO achieves end-to-end speedup over classical baselines for power grid unit commitment with up to 14 qubits using 16 layers in high-load scenarios via efficient classical pre-computation.
STALC presents a graph-based hierarchical planner with mixed-integer programming for multi-robot coordination in reconnaissance scenarios, demonstrated in simulation and hardware.
Introduces a decision-aware neural ODE model that integrates outage dynamics prediction with global optimization of resilience interventions for power grids.
citing papers explorer
-
Complementarity by Construction: A Lie-Group Approach to Solving Quadratic Programs with Linear Complementarity Constraints
Complementarity constraints are treated as a Lie group under relaxation to enable parameterization that satisfies them by construction in LCQP solvers.
-
Approximating Global Contact-Implicit MPC via Sampling and Local Complementarity
A hybrid controller samples low-dimensional end-effector targets for a contact-free stage then runs local complementarity MPC at each sample to approximate global contact-implicit optimization.
-
Provable Fairness Repair for Deep Neural Networks
ProF repairs DNNs for individual fairness by using interval bound propagation to bound outputs over input sets and solving a MILP to adjust the model with guarantees on those sets.
-
From Constraint to Code: DQI-Kit -- A Software Framework for Decoded Quantum Interferometry
DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.
-
Frequency Nadir-Constrained Power System Restoration Planning with Energy Storage
A frequency nadir-constrained MILP framework for black-start restoration that incorporates energy storage to maintain frequency security and shorten recovery time.
-
Efficient MILP-based Urban Network Traffic Control in Mixed Autonomy with Dynamic Saturation Rates
A dynamic saturation rate extension to the multi-commodity store-and-forward model is reformulated as an efficient MILP that outperforms prior multi-commodity approaches in mixed CAV-HDV traffic simulations.
-
Ternary Logic Encodings of Temporal Behavior Trees with Application to Control Synthesis
Ternary logic encodings of temporal behavior trees enable mixed-integer linear programming for correct-by-construction control synthesis in linear systems.
-
A Nested Amplitude Amplification Protocol for the Binary Knapsack Problem
A nested amplitude amplification protocol for knapsack performs partial amplification on initial variables via an Inner Iteration Finder before global GAS, reducing solution improvement costs versus baseline in simulations on large instances.
-
ODYN: An All-Shifted Non-Interior-Point Method for Quadratic Programming in Robotics and AI
ODYN is a novel all-shifted non-interior-point primal-dual QP solver with strong warm-start performance for robotics and AI applications.
-
Static task mapping for heterogeneous systems based on series-parallel decompositions
A new series-parallel decomposition algorithm for general DAGs enables task mapping in heterogeneous systems that improves makespan over HEFT variants while running orders of magnitude faster than genetic algorithms or ILPs.
-
Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures
An attention-based DRL agent with Transformer encoder and GNN learns heuristics for qubit-to-core allocation in multi-core quantum systems to minimize state transfers and online compilation time.
-
A comprehensive study on ILP acceleration accounting for sparsity, area, energy, data movement using near-memory architecture
SPARK is a sparsity-aware near-cache ILP accelerator that reuses L1 cache structures to deliver up to 15x speedup and 152x energy reduction versus CPUs on sparse MIPLIB workloads with 1.4% area overhead.
-
SHIELD: Scalable Optimal Control with Certification using Duality and Convexity
SHIELD derives safe certificates from Lagrangian duality to reduce decision variables and constraints in convex programs, accelerated by a transformer network, delivering order-of-magnitude speedups in stochastic MPC for multi-modal traffic with preserved feasibility and safety.
-
Feasibility-Aware Imitation Learning for Benders Decomposition
Feasibility-aware imitation learning accelerates Benders decomposition by predicting feasible integer assignments in the master problem, improving solution times over prior imitation learning methods while retaining finite convergence.
-
LACE-S: Toward Sensitivity-consistent Locational Average Carbon Emissions via Neural Representation
LACE-S uses a neural representation with a projection layer and Jacobian regularization to produce locational carbon emission metrics that remain consistent with total emissions and sensitivities, leading to reliable system-wide emission reductions in load-shifting tests unlike prior metrics.
-
Warm-Startable Progressive Integrality Outer-Inner Approximation for AC Unit Commitment with Conic Formulation
A progressive integrality outer-inner approximation framework solves large-scale AC unit commitment problems faster and more robustly than commercial solvers on 200- and 500-bus networks.
-
High-Resolution PTDF-Based Planning of Storage and Transmission Under High Renewables
A scalable PTDF-based two-stage optimization framework with trust-region multicut Benders decomposition for co-optimizing transmission and storage under high renewables, demonstrated on a 2000-bus synthetic Texas system with sub-2% optimality gaps.
-
End-to-End Speedup for Quantum Simulation-Based Optimization in Power Grid Management
QAOA-based QuSO achieves end-to-end speedup over classical baselines for power grid unit commitment with up to 14 qubits using 16 layers in high-load scenarios via efficient classical pre-computation.
-
Stratified Topological Autonomy for Long-Range Coordination (STALC)
STALC presents a graph-based hierarchical planner with mixed-integer programming for multi-robot coordination in reconnaissance scenarios, demonstrated in simulation and hardware.
-
Global-Decision-Focused Neural ODEs for Proactive Grid Resilience Management
Introduces a decision-aware neural ODE model that integrates outage dynamics prediction with global optimization of resilience interventions for power grids.