Searcharxiv⌕ Search

arXiv subjects

Junyuan Qiu

Publications and source records attributed to Junyuan Qiu.

3 recordsLinked to original sources

Intersection Cuts for Mixed-Integer Nonlinear Programs via Decision-Diagram-Free Sets

We introduce a novel decision-diagram-based framework for generating intersection cuts to strengthen polyhedral relaxations of bounded mixed-integer nonlinear programs (MINLPs) with general nonlinear constraints. Building on decision diagrams (DDs) that provide outer approximations of MINLP feasible regions, we propose the concept of DD-free sets, which are convex regions whose interiors do not intersect the sets represented by the DDs. By exploiting the underlying graphical structure, we develop efficient methods for constructing these regions without requiring restrictive assumptions on the functional form of nonlinear constraints or access to distance oracles. We investigate the maximality properties of DD-free sets and devise algorithms for obtaining maximal forbidden regions within several structured classes. The resulting intersection cuts exploit geometric information retained in DD representations, enabling further strengthening of relaxations beyond what can be achieved through conventional DD-based convexification. We also introduce interval DDs to facilitate the representation of general nonlinear constraints and establish convergence results for intersections of constraint-specific DDs, providing a theoretical foundation for their integration into global optimization frameworks. Computational experiments on challenging open instances from MINLPLib, encompassing a broad range of nonlinear and nonconvex structures, demonstrate that the proposed approach can substantially improve dual bounds and achieve greater optimality-gap closure than state-of-the-art global optimization solvers. These findings highlight the potential of exploiting graphical representations of infeasible regions to develop stronger cutting planes for general MINLPs.

math.OC↗

A graphical framework for global optimization of mixed-integer nonlinear programs

While mixed-integer linear programming and convex programming solvers have advanced significantly over the past several decades, solution technologies for general mixed-integer nonlinear programs (MINLPs) have yet to reach the same level of maturity. Various problem structures across different application domains remain challenging to model and solve using modern global solvers, primarily due to the lack of efficient parsers and convexification routines for their complex algebraic representations. In this paper, we introduce a novel graphical framework for globally solving MINLPs based on decision diagrams (DDs), which enable the modeling of complex problem structures that are intractable for conventional solution techniques. We describe the core components of this framework, including a graphical reformulation of MINLP constraints, convexification techniques derived from the constructed graphs, efficient cutting plane methods to generate linear outer approximations, and a spatial branch-and-bound scheme with convergence guarantees. In addition to providing a global solution method for tackling challenging MINLPs, our framework addresses a longstanding gap in the DD literature by developing a general-purpose DD-based approach for solving general MINLPs. To demonstrate its capabilities, we apply our framework to solve instances from one of the most difficult classes of unsolved test problems in the MINLP Library, which are otherwise inadmissible for state-of-the-art global solvers.

math.OC↗

A Tie-breaking based Local Search Algorithm for Stable Matching Problems

The stable marriage problem with incomplete lists and ties (SMTI) and the hospitals/residents problem with ties (HRT) are important in matching theory with broad practical applications. In this paper, we introduce a tie-breaking based local search (TBLS) algorithm designed to achieve a weakly stable matching of maximum size for both the SMTI and HRT problems. TBLS begins by arbitrarily resolving all ties and iteratively refines the tie-breaking strategy by adjusting the relative order within ties based on preference ranks and the current stable matching. Additionally, we introduce TBLS-E, an equity-focused variant of TBLS, specifically designed for the SMTI problem. This variant maintains the objective of maximizing matching size, while enhancing equity through two simple modifications. In comparison with ten other approximation and local search algorithms, TBLS achieves the highest matching size, while TBLS-E exhibits the lowest sex equality cost. Significantly, TBLS-E preserves a matching size comparable to that of TBLS. Both our algorithms demonstrate faster computational speed than other local search algorithms in solving large-scale instances. Moreover, our scalability analysis shows that both algorithms maintain efficient performance as problem size increases.

cs.DS↗