Zobrazeno 1 - 10
of 941
pro vyhledávání: '"LEE, JON"'
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
In optimal experimental design, the objective is to select a limited set of experiments that maximizes information about unknown model parameters based on factor levels. This work addresses the generalized D-optimal design problem, allowing for nonli
Externí odkaz:
http://arxiv.org/abs/2411.01405
Publikováno v:
Open Journal of Mathematical Optimization, Vol 2, Iss , Pp 1-14 (2021)
The M-P (Moore–Penrose) pseudoinverse has as a key application the computation of least-squares solutions of inconsistent systems of linear equations. Irrespective of whether a given input matrix is sparse, its M-P pseudoinverse can be dense, poten
Externí odkaz:
https://doaj.org/article/00c936d60cc3420bb57e9fb0a089c9e4
Autor:
Qu, Yushan, Lee, Jon
We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M lifting (i)
Externí odkaz:
http://arxiv.org/abs/2407.15244
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
The generalized maximum-entropy sampling problem (GMESP) is to select an order-$s$ principal submatrix from an order-$n$ covariance matrix, to maximize the product of its $t$ greatest eigenvalues, $0
Externí odkaz:
http://arxiv.org/abs/2404.01390
The circuits of a polyhedron are a superset of its edge directions. Circuit walks, a sequence of steps along circuits, generalize edge walks and are "short" if they have few steps or small total length. Both interpretations of short are relevant to t
Externí odkaz:
http://arxiv.org/abs/2402.01066
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
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical operation for gra
Externí odkaz:
http://arxiv.org/abs/2311.02047