--- title: "lpda: Linear Programming Discriminant Analysis" author: - Maria J. Nueda, Department of Mathematics, Alicante Universiy, Spain date: "2 March 2023" output: rmarkdown::html_vignette vignette: > %\VignetteIndexEntry{lpda: Linear Programming Discriminant Analysis} %\VignetteEncoding{UTF-8} %\VignetteEngine{knitr::rmarkdown} --- ```{r, include = FALSE} knitr::opts_chunk$set( collapse = TRUE, comment = "#>", fig.path = "figures/README-", out.width = "100%", fig.height=5, fig.width=7 ) knitr::opts_chunk$set(fig.pos = "!h", fig.align="center") ``` # The method `lpda` is an R package that addresses the classification problem through linear programming. The method looks for a hyperplane, *H*, which separates the samples into two groups by minimizing the sum of all the distances to the subspace assigned to the group each individual belongs to. It results in a convex optimization problem for which we find an equivalent linear programming problem. We demonstrated that *H* exists when the centroids of the two groups are not equal [1]. The method has been extended to more than two groups by considering pairwise comparisons. Moreover, `lpda` offers the possibility of dealing with Principal Components (PCs) to reduce the dimension of the data avoiding overfitting problems. This option can be applied independently of the number of samples, $n$, and variables, $p$, that is $n>p$ or $n