Boscia Framework: Mixed-Integer Convex Optimization

• Boscia framework is a mixed-integer convex optimization solver that combines branch-and-bound with Frank–Wolfe methods for efficient continuous relaxations.
• It leverages oracle-based linear minimization to exploit combinatorial structure in the feasible region, reducing the need for expensive global NLP solvers.
• The design supports warm-start active-set reuse and flexible customization, with extensions that enable heuristic approaches for nonconvex problems.

Searching arXiv for papers on the Boscia framework and related usage. arXiv search query: Boscia Frank-Wolfe branch-and-bound mixed-integer convex Boscia.jl Boscia is a framework for mixed-integer convex optimization in which the principal nonlinearity appears in a differentiable convex objective, while the feasible region is mixed-integer and polyhedral or piecewise polyhedral. Its defining algorithmic idea is to combine branch-and-bound, or more generally branch-and-cut, on the discrete variables with Frank–Wolfe-type first-order methods for approximately solving continuous relaxations. In the optimization literature, Boscia is presented as a solver architecture for convex MINLP or MICO with oracle access to the objective and its gradient, and with linear minimization oracles that may exploit combinatorial structure directly (Sharma et al., 2024). Subsequent work extended the same architecture beyond its original convex setting as a primal heuristic for nonconvex quadratic mixed-integer optimization (Mexi et al., 2 Aug 2025), while a later tutorial systematized its implementation and customization in the Julia package Boscia.jl (Xiao et al., 3 Nov 2025). A separate 2026 tool paper uses “Boscia” informally when discussing the Bosque API ecosystem; this is a different software-specification context rather than the optimization framework ordinarily denoted by Boscia (Marron, 13 Jun 2026).

1. Problem class and conceptual scope

Boscia targets a specialized subclass of mixed-integer nonlinear optimization: convex objective functions, linear constraints including integrality constraints, and oracle access to the objective and gradient. In the tutorial formulation, the generic problem is

$$\begin{align} \min_x \quad & f(x) \ \text{s.t.}\quad & x \in \mathcal{X}, \end{align}$$

with $\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$, where $\bar{\mathcal{X}}$ is a polyhedron and $\mathcal{X}_I$ encodes integrality on a subset of coordinates (Xiao et al., 3 Nov 2025). The framework assumes that $f$ is convex, differentiable, and $L$-smooth on the relevant convex domain, and that nonlinear structure is confined to the objective rather than the constraints (Xiao et al., 3 Nov 2025).

The 2024 network-design study states the same positioning in application-oriented terms: Boscia “can solve MICO problems when the main nonlinearity stems from a differentiable objective function,” and does so by branch-and-bound with continuous relaxations solved approximately with Frank–Wolfe algorithms (Sharma et al., 2024). In that paper, the smooth convex component is a Beckmann-type congestion cost

$$c(\mathbf{x})=\sum_{e\in E} c_e(x_e), \qquad c_e(x_e)=\alpha_e+\beta_e x_e+\gamma_e x_e^{\rho_e}, \quad \rho_e>1,$$

combined with binary network-design decisions and linear flow constraints (Sharma et al., 2024).

A closely related summary in the MIQCQP heuristic paper describes the original Boscia problem class as mixed-integer convex problems

$$\begin{align} \min_{x \in \mathbb{R}^n} \quad & f(x) \ \text{s.t.}\quad & x \in \mathcal{X}, \ & x_i \in \mathbb{Z} \quad \forall i \in I, \end{align}$$

with $\mathcal{X}$ a convex, compact polyhedral feasible set and $f$ convex differentiable (Mexi et al., 2 Aug 2025). Across these sources, the common denominator is not a specific application domain but a solver template: smooth convex objective, linear or combinatorial feasible set, and mixed-integer structure.

This positioning places Boscia adjacent to classical branch-and-bound, outer-approximation, and cutting-plane approaches, but with a different computational center of gravity. Instead of repeatedly invoking a generic nonlinear or conic solver to high precision at every node, Boscia organizes node processing around first-order conditional-gradient steps and problem-specific linear minimization oracles. This suggests that the framework is especially well matched to problems whose feasible regions have rich combinatorial structure but whose nonlinearities are concentrated in objective evaluation and differentiation.

2. Core algorithmic architecture

Boscia’s central paradigm is a Frank–Wolfe-based branch-and-bound method (Mexi et al., 2 Aug 2025). Each node of the search tree corresponds to a subproblem with additional bounds or fixings on integer variables. Rather than solving the node’s continuous relaxation with a generic convex optimizer, Boscia applies a Frank–Wolfe variant over the convex hull of the node-feasible mixed-integer points, accessed implicitly through a linear minimization oracle.

At a node, the continuous subproblem is

$\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$0

where $\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$1 denotes node-specific bounds (Xiao et al., 3 Nov 2025). Standard Frank–Wolfe generates, at iterate $\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$2, a linear minimization subproblem

$\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$3

followed by

$\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$4

Boscia’s distinctive twist is that the LMO may be implemented by a MIP solver over the mixed-integer structure active at the node, so the extreme points returned by the oracle are integer-feasible vertices (Mexi et al., 2 Aug 2025).

The convex case admits a Frank–Wolfe gap

$\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$5

which yields the valid lower bound

$\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$6

for the node objective (Xiao et al., 3 Nov 2025). This is one of Boscia’s key structural advantages: node processing can be inexact, yet still produce certified bounds, so the tree need not wait for highly accurate continuous solves.

The framework is therefore layered:

Layer	Role	Typical mechanism
Branch-and-bound	Global search over integer variables	branching, node bounds, pruning
Frank–Wolfe solver	Inexact node relaxation solve	FW, BPCG, AFW, DICG
LMO	Linear minimization over structured feasible region	MIP solver, shortest path, assignment, knapsack

The tutorial emphasizes that this decomposition creates an oracle hierarchy: branch-and-bound calls Frank–Wolfe; Frank–Wolfe calls the objective and gradient oracles and the LMO; the LMO may itself be a generic MIP model or a specialized combinatorial algorithm (Xiao et al., 3 Nov 2025). A practical implication is that Boscia can operate with black-box objective and gradient routines, provided linear optimization over the feasible region remains tractable.

3. Frank–Wolfe integration and active-set mechanics

Boscia uses active-set Frank–Wolfe variants rather than only the vanilla method. The 2024 network-design paper states that all Frank–Wolfe-based approaches there use the Blended Pairwise Conditional Gradient variant because it performs better (Sharma et al., 2024). The 2025 tutorial identifies BPCG as the default, while also exposing AFW, BCG, FCFW, PFW, DICG, and BDICG (Xiao et al., 3 Nov 2025).

The active-set perspective is essential. The current iterate is maintained as a convex combination

$\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$7

where the vertices $\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$8 are integer-feasible points returned by previous LMO calls (Mexi et al., 2 Aug 2025). Because the LMO respects node integrality, Boscia never needs an explicit description of $\mathcal{X} = \bar{\mathcal{X}} \cap \mathcal{X}_I$9; it works with an implicit convex hull represented by an active set of discrete vertices.

The tutorial presents a unified Corrective Frank–Wolfe view in which each iteration compares a global FW direction with a corrective step built from the current active set (Xiao et al., 3 Nov 2025). Corrective steps may be “towards,” “away,” pairwise, or decomposition-invariant, depending on the selected variant. Lazification follows naturally from this active-set structure: local progress is attempted using previously computed vertices before making another expensive global LMO call (Xiao et al., 3 Nov 2025). The network-design paper notes the same phenomenon operationally, describing BPCG as allowing “lazification,” in which previously computed vertices that are not exact current LMO solutions may still be used if they provide sufficient descent (Sharma et al., 2024).

This design has several algorithmic consequences that recur across the literature. First, the vertex set constitutes a native source of primal candidates, because every oracle call returns an integer-feasible extreme point for the active node. Second, active sets can be reused across branch-and-bound nodes, enabling warm starts. Third, the cost profile of the method becomes highly sensitive to LMO design, because the efficiency of obtaining new vertices largely determines overall performance. This suggests that Boscia’s strongest use cases are those in which the LMO can be implemented by a fast specialized routine rather than a general-purpose MILP solve.

4. Branch-and-bound, bounds, warm-starting, and customization

In convex mode, Boscia uses standard branch-and-bound logic on the integer variables, together with inexact but valid node processing. Lower bounds come from the Frank–Wolfe primal value minus the FW gap; upper bounds come from incumbent integer-feasible solutions obtained from oracle vertices or heuristics (Xiao et al., 3 Nov 2025). Nodes may be pruned when infeasible, when their lower bound exceeds the incumbent upper bound within tolerances, or by application-specific logic such as the graph-isomorphism criterion that a positive lower bound excludes an isomorphism certificate (Xiao et al., 3 Nov 2025).

The tutorial describes several branching strategies: most-infeasible branching, strong branching, pseudo-cost branching, gradient-based branching, and hierarchy branching (Xiao et al., 3 Nov 2025). Node selection is best-bound by default. Tolerances are configurable, including absolute and relative gaps, a Frank–Wolfe gap decay factor, starting and minimum FW tolerances, and early termination rules for node evaluation when enough better nodes are already open (Xiao et al., 3 Nov 2025).

Warm-starting is one of the framework’s most characteristic practical mechanisms. Parent-node active sets are split between children; because the constituent vertices are integer-feasible, children inherit nonempty initial active sets compatible with the new bounds after suitable filtering or reweighting (Xiao et al., 3 Nov 2025). The tutorial also describes tree-level lazification via a “shadow set” of discarded vertices that may be passed to descendants (Xiao et al., 3 Nov 2025). The MIQCQP paper likewise emphasizes that active sets are propagated down the tree and that lazification ensures vertices are computed at most once and then recycled (Mexi et al., 2 Aug 2025).

Boscia.jl exposes this machinery through a highly customizable Julia interface. Users supply f(x) and grad!(g, x) oracles, an LMO object, and a settings structure; the top-level solve call is $\mathcal{X}_I$2 (Xiao et al., 3 Nov 2025). Callbacks may intervene before node evaluation, during branching, or when new incumbents are found. Domain oracles and domain-point generators can be supplied for objectives defined only on restricted domains, as in optimal experimental design (Xiao et al., 3 Nov 2025). This programmable architecture is one reason the framework has been used both as a solver and as a research platform.

5. Structured LMOs and canonical application domains

A recurring theme in all Boscia papers is exploitation of combinatorial structure through the LMO. The framework’s performance depends not only on convexity and smoothness, but on whether

$\bar{\mathcal{X}}$0

can be solved cheaply and accurately (Xiao et al., 3 Nov 2025).

The 2024 network-design paper provides a detailed illustration. The deterministic network-design problem is

$\bar{\mathcal{X}}$1

with flow variables $\bar{\mathcal{X}}$2, binary design variables $\bar{\mathcal{X}}$3, and separable convex congestion cost $\bar{\mathcal{X}}$4 (Sharma et al., 2024). Three LMO instantiations are considered within Boscia: an integer Frank–Wolfe LMO solved as a MILP, a penalty-based LMO in which flow and design feasible regions decouple, and a Benders-decomposition-based LMO (Sharma et al., 2024). The penalty-based formulation

$\bar{\mathcal{X}}$5

removes hard linking constraints from the feasible region and transfers them into the objective, making the LMO separable into a shortest-path-type flow problem and a pure 0–1 design problem (Sharma et al., 2024). This is a paradigmatic Boscia move: weaken the formulation if doing so yields a much cheaper oracle.

The tutorial adds two further structured examples. In graph isomorphism, Boscia optimizes the convex quadratic objective

$\bar{\mathcal{X}}$6

over the Birkhoff polytope, with permutation matrices as the integer-feasible vertices (Xiao et al., 3 Nov 2025). The LMO is implemented by the Hungarian algorithm on a reduced assignment problem with propagated bounds. In optimal experimental design, Boscia addresses A-optimal and D-optimal criteria such as

$\bar{\mathcal{X}}$7

under simplex-type integer constraints, with LMOs reducible to continuous knapsack by sorting gradients (Xiao et al., 3 Nov 2025).

These examples clarify an important methodological point. Boscia is not defined by a fixed set of nonlinear models, but by a solver interface in which the LMO is the main point of structural specialization. This suggests a practical design rule: Boscia is most effective when the feasible region admits a high-performance oracle such as shortest path, assignment, or knapsack, even if the overall optimization problem remains mixed-integer and nonlinear.

6. Extensions, empirical behavior, and limits

The original Boscia framework is explicitly convex. The MIQCQP paper extends it beyond this regime as a primal heuristic for nonconvex quadratic mixed-integer optimization (Mexi et al., 2 Aug 2025). The key device is a power-penalty reformulation of quadratic constraints. A constraint

$\bar{\mathcal{X}}$8

is dropped from the feasible set and replaced in the objective by

$\bar{\mathcal{X}}$9

leading to a penalized objective

$\mathcal{X}_I$0

with $\mathcal{X}_I$1 (Mexi et al., 2 Aug 2025). This preserves Boscia’s preference for linear constraints plus differentiable objective, but sacrifices convexity.

Once convexity is lost, the classical Boscia guarantees no longer hold. The paper therefore disables node pruning based on FW lower bounds, disables use of FW dual gaps as globally valid bounds, changes solution storage to track all encountered candidates, and adds callbacks that explicitly check feasibility against the original quadratic constraints (Mexi et al., 2 Aug 2025). The resulting method is a primal heuristic engine rather than an exact solver. It augments the core Boscia architecture with rounding, Bernoulli probability rounding for binaries, 0/1 polytope rounding, simplex-aware rounding, gradient-guided “follow-the-gradient” steps, and large-neighborhood-search heuristics including ASENS, Undercover, and RINS (Mexi et al., 2 Aug 2025).

Empirically, the extension is strong. On 319 QPLIB instances, it found feasible solutions for 261 cases overall within 300 seconds, including 163 of 166 MIQPs and 98 of 153 MIQCQPs; average time to first feasible solution was 3.18 s overall, with average gap 11.57% and average primal integral 12.77 (Mexi et al., 2 Aug 2025). The same paper reports that the method won first place in the Land-Doig MIP Computational Competition 2025 and found eight new best-known QPLIB solutions (Mexi et al., 2 Aug 2025).

For convex problems, the application evidence is more structural than benchmark-centric. In network design, the 2024 study concludes that Boscia is “particularly applicable” to centralized traffic assignment problems, with the mixed-integer linear Frank–Wolfe subproblem performing well in the deterministic case, while the penalty-based approach dominates for stochastic instances with many scenarios (Sharma et al., 2024). The penalty method trades weaker continuous relaxations for much cheaper LMOs; the direct IFW approach gives tighter relaxations and smaller trees but becomes too expensive when the number of scenarios and flow variables is large (Sharma et al., 2024). The tutorial makes the same broader point: Boscia’s performance is heavily LMO-dependent, and custom lightweight oracles can materially outperform generic MIP-based LMOs (Xiao et al., 3 Nov 2025).

A common misconception is that Boscia is a general MINLP framework without qualification. The tutorial is explicit that Boscia.jl “focuses on convex MINLP where the nonlinearity appears in the objective only” (Xiao et al., 3 Nov 2025). The MIQCQP work does not overturn this statement; rather, it extends the framework heuristically beyond its original domain (Mexi et al., 2 Aug 2025). Another possible source of confusion is nomenclature. The 2026 paper on “Specifications for Humans, Agents, and Tooling” uses “Boscia” informally to refer to the Bosque/BAPI ecosystem, a specification language and tooling stack for APIs. That usage concerns spec-centered software development with Bosque, BAPI, Tecton, and Sundew, not the Frank–Wolfe branch-and-bound optimization framework described in the Boscia literature (Marron, 13 Jun 2026). This suggests that, in technical usage, the meaning of “Boscia framework” should be resolved from context: optimization papers refer to the mixed-integer convex solver architecture, whereas the 2026 tooling paper uses the term in a different and nonstandard sense.

Taken together, the literature presents Boscia as a distinctive synthesis of branch-and-bound and projection-free first-order optimization. Its characteristic strengths are oracle-based modeling, inexact node processing with valid lower bounds in the convex setting, warm-started active-set reuse, and the ability to exploit structured linear minimization subproblems directly (Xiao et al., 3 Nov 2025). Its main limitations are equally clear: original correctness results require convexity, differentiability, and linear constraints; nonlinear constraints and nonconvexity require reformulation or heuristic extensions; and practical performance depends critically on the quality of the LMO (Sharma et al., 2024). Within those boundaries, Boscia occupies a specific methodological niche in the broader landscape of mixed-integer optimization: it is a framework for solving structured mixed-integer convex problems by making the LMO, rather than the generic NLP subsolver, the primary site of algorithmic specialization.