Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Xu, Luze"'
The 0/1 D-optimality problem and the Maximum-Entropy Sampling problem are two well-known NP-hard discrete maximization problems in experimental design. Algorithms for exact optimization (of moderate-sized instances) are based on branch-and-bound. The
Externí odkaz:
http://arxiv.org/abs/2411.03461
MINLO (mixed-integer nonlinear optimization) formulations of the disjunction between the origin and a polytope via a binary indicator variable is broadly used in nonlinear combinatorial optimization for modeling a fixed cost associated with carrying
Externí odkaz:
http://arxiv.org/abs/2404.07010
We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a notion of
Externí odkaz:
http://arxiv.org/abs/2403.09927
We present several algorithms aimed at constructing sparse and structured sparse (row-sparse) generalized inverses, with application to the efficient computation of least-squares solutions, for inconsistent systems of linear equations, in the setting
Externí odkaz:
http://arxiv.org/abs/2401.17540
Conforti et al. give a compact extended formulation for a class of bimodular-constrained integer programs, namely those that model the stable set polytope of a graph with no disjoint odd cycles. We extend their techniques to design compact extended f
Externí odkaz:
http://arxiv.org/abs/2311.06017
The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear equations. It is uniquely characterized by four properties, but not all
Externí odkaz:
http://arxiv.org/abs/2309.10913
An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices appears in th
Externí odkaz:
http://arxiv.org/abs/2212.03819
MINLO (mixed-integer nonlinear optimization) formulations of the disjunction between the origin and a polytope via a binary indicator variable have broad applicability in nonlinear combinatorial optimization, for modeling a fixed cost $c$ associated
Externí odkaz:
http://arxiv.org/abs/2201.07150
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if the constrai
Externí odkaz:
http://arxiv.org/abs/2105.08160
Generalized inverses are important in statistics and other areas of applied matrix algebra. A \emph{generalized inverse} of a real matrix $A$ is a matrix $H$ that satisfies the Moore-Penrose (M-P) property $AHA=A$. If $H$ also satisfies the M-P prope
Externí odkaz:
http://arxiv.org/abs/2010.11406