8 papers
Polyhedral Outer Approximation for MISOCP: Geometry and Progressive Integrality
Yongzheng Dai
Polyhedral outer approximation (OA) is widely used to solve mixed-integer second-order cone programs (MISOCPs) by iteratively strengthening polyhedral relaxations of conic constrai…
An Alternating Primal Heuristic for Nonconvex MIQCQP with Dynamic Convexification and Parallel Local Branching
Yongzheng Dai, Chen Chen
We develop a novel primal heuristic for nonconvex Mixed-Integer Quadratically Constrained Quadratic Programs (MIQCQPs). The method is built around a convex approximation that is dy…
Scheduling Electricity Production Units to Mitigate Severe Weather Impact: An Efficient Computational Implementation
Yongzheng Dai, Antonio J. Conejo, Feng Qiu
Extreme weather events in electric power systems can cause line trips or physical damage to transmission infrastructure, potentially leading to large-scale load shedding. To mitiga…
Warm-Startable Progressive Integrality Outer-Inner Approximation for AC Unit Commitment with Conic Formulation
Yongzheng Dai
The alternating-current unit commitment problem provides a realistic representation of power system operations, which is a nonconvex mixed-integer nonlinear programming problem and…
Serial and Parallel Two-Column Probing for Mixed-Integer Programming
Yongzheng Dai, Chen Chen
Probing in mixed-integer programming (MIP) is a technique of temporarily fixing variables to discover implications that are useful to branch-and-cut solvers. Such fixing is typical…
Tensor Completion via Integer Optimization
Xin Chen, Sukanya Kudva, Yongzheng Dai +2
The main challenge with the tensor completion problem is a fundamental tension between computation power and the information-theoretic sample complexity rate. Past approaches eithe…
Parallelized Conflict Graph Cut Generation
Yongzheng Dai, Chen Chen
A conflict graph represents logical relations between binary variables, and effective use of the graph can significantly accelerate branch-and-cut solvers for mixed-integer program…
Sparsity-Exploiting Distributed Projections onto a Simplex
Yongzheng Dai, Chen Chen
Projecting a vector onto a simplex is a well-studied problem that arises in a wide range of optimization problems. Numerous algorithms have been proposed for determining the projec…