We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We characterize "linear" theories in terms of properties of the correspon...
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
A complex trait like crop yield is determined by its component traits. Multivariable conditional analysis in a general mixed linear model is helpful in dissecting the gene express...
Jixiang Wu, Dongfeng Wu, Johnie N. Jenkins Jr., Ja...
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...