3 papers
math.OC2026
A Geometric Perspective on Polynomially Solvable Convex Maximization
Shaoning Han, Liangju Li, Yongchun Li
Convex maximization encompasses a broad class of optimization problems and is generally NP-hard, even for low-rank objectives. This paper investigates structural conditions under w…
math.OC2025
Strong Formulations and Algorithms for Regularized A-optimal Design
Yongchun Li
We study the Regularized A-optimal Design (RAOD) problem, which selects a subset of experiments to minimize the inverse of the Fisher information matrix, regularized with a sca…
math.OC2024
The Augmented Factorization Bound for Maximum-Entropy Sampling
Yongchun Li
The maximum-entropy sampling problem (MESP) aims to select the most informative principal submatrix of a prespecified size from a given covariance matrix. This paper proposes an au…