Month: February 2026

Fast Presolving Framework For Sparsity Constrained Convex Quadratic Programming: Screening-Based Cut Generation and Selection

  • Haozhe Tan
  • Guanyi Wang
    • Categories (Mixed) Integer Nonlinear Programming, Cutting Plane Approaches, Nonlinear Optimization Tags , , , ,

    Screening is widely utilized for Mixed-Integer Programming (MIP) presolving. It aims to certify a priori whether one or multiple specific binary variables can be fixed to optimal values based on solutions from convex relaxations. This paper studies the challenge of solving Sparsity-constrained (strongly) Convex Quadratic Programming (SCQP) and proposes the Screening-based Cut Presolving Framework (SCPF). … Read more

    Curvature-oriented variance reduction methods for nonconvex stochastic optimization

  • Qiankun Shi
  • Shiji Zuo
  • liuyx
  • Xiao Wang
    • Categories Constrained Nonlinear Optimization, Nonlinear Optimization Tags , , , ,

    When pursuing an approximate second-order stationary point in nonconvex constrained stochastic optimization, is it possible to design a stochastic second-order method that achieves the same sample complexity order as in the unconstrained setting? To address this question in this paper, we first introduce Carme, a curvature-oriented variance reduction method designed for unconstrained nonconvex stochastic optimization. … Read more

    Voronoi Conditional Gradient Method for Constrained Nonconvex Optimization

  • Abbas Khademi
    • Categories Constrained Nonlinear Optimization, Nonlinear Optimization Tags , , , ,

    The Conditional Gradient method offers a computationally efficient, projection-free framework for constrained problems; however, in nonconvex settings it may converge to stationary points of low quality. We propose the Voronoi Conditional Gradient (VCG) method, a geometric heuristic that systematically explores the feasible region by constructing adaptive Voronoi partitions from previously discovered stationary points. VCG incrementally … Read more

    Robust Admission Via Two-Stage Stable Matching Under Ranking Uncertainty

  • Gustavo Angulo
    • Categories Game Theory, Integer Programming, Robust Optimization Tags , , ,

    We study a two-stage admission and assignment problem under uncertainty arising in university admission systems. In the first stage, applicants are admitted to an initial two-year program. In the second stage, admitted applicants are assigned to degree programs through an articulation mechanism subject to capacity constraints. Uncertainty stems from the academic performance of admitted applicants … Read more

    A Surface-Based Formulation of the Traveling Salesman Problem

  • Yılmaz Arslanoğlu
    • Categories (Mixed) Integer Linear Programming, Other Topics Tags , , , ,

    We present an exact formulation of the symmetric Traveling Salesman Problem (TSP) that replaces the classical edge-selection view with a surface-building approach. Instead of selecting edges to form a cycle, the model selects a set of connected triangles where the boundary of the resulting surface forms the tour. This method yields a mixed-integer linear programming … Read more

    The colored knapsack problem: structural properties and exact algorithms

  • Fabio Ciccarelli
  • Alexander Helber
  • Erik Mühmer
    • Categories (Mixed) Integer Linear Programming, Combinatorial Optimization, Dynamic Programming Tags , , , ,

    We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into classes of colors and the packed items need to be ordered such that no consecutive items are of the same color. We establish that the problem is weakly … Read more

    Sensitivity-informed identification of temperature-dependent piezoelectric material parameters

  • Raphael Kuess
  • Olga Friesen
  • Leander Claes
  • Andrea Walther
    • Categories Applications - Science and Engineering, Control Applications, Nonlinear Optimization Tags , , ,

    An accurate characterization of temperature-dependent material parameters of piezoceramics is crucial for the design and simulation of reliable sensors and actuators. This characterization is typically formulated as an ill-posed inverse problem, which is challenging to solve not only because of its ill-posedness, but also because of parameter sensitivities, which vary by several orders of magnitude … Read more

    Convex analysis for composite functions without K-convexity

  • Juan Pablo Vielma
    • Categories Convex Optimization, Generalized Convexity/Monoticity

    Composite functions have been studied for over 40 years and appear in a wide range of optimization problems. Convex analysis of these functions focuses on (i) conditions for convexity of the function based on properties of its components, (ii) formulas for the convex conjugate of the function based on those of its components and (iii) … Read more

    Convex duality contracts for production-grade mathematical optimization

  • Juan Pablo Vielma
  • Ross Anderson
  • Joey Huchette
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming, Modeling Languages and Systems

    Deploying mathematical optimization in autonomous production systems requires precise contracts for objects returned by an optimization solver. Unfortunately, conventions on dual solution and infeasibility certificates (rays) vary widely across solvers and classes of problems. This paper presents the theoretical framework used by MathOpt (a domain-specific language developed and used at Google) to unify these notions. … Read more

    Riemannian Dueling Optimization

  • Yuxuan Ren
  • Abhishek Roy
  • Shiqian Ma
    • Categories Nonlinear Optimization Tags , , ,

    Dueling optimization considers optimizing an objective with access to only a comparison oracle of the objective function. It finds important applications in emerging fields such as recommendation systems and robotics. Existing works on dueling optimization mainly focused on unconstrained problems in the Euclidean space. In this work, we study dueling optimization over Riemannian manifolds, which … Read more