Bilinear separation of two sets inn-space
By Kristin P. Bennett, Olvi L. Mangasarian. 1993
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Paul S. Bradley
- Olvi L. Mangasarian
- Usama M. Fayyad
- TreesKristin P. Bennett
- Gautam Kunapuli
- Jennifer A. BlueDepartment
- Emilio Carrizosa
- Jing Hu
Citations in the corpus
- Absolute value equations (2006, unknown): “We also note that the bilinear formulation (3) can serve as a method of solution for the AVE as was bilinear programming exploited in [1,6] for other problems.”
- Optimal Decision Trees (1996, methodology): “A Frank-Wolfe method was successfully applied to the product error problem [7, 3].”
- Auction optimization using regression trees and linear models as integer programs (2014, unknown): “s learning tasks can lead to challenging optimization problems, researchers have also applied mathematical optimization methods in order to increase learning effi- ciency. For instance, Bennett et al. [33] use linear programming for determining linear combination splits within two-class decision tree”
- Bilevel Optimization and Machine Learning (2008, methodology): “[[11]] Algorithm 1 terminates at ζ that satisfies the minimum principle necessary optimality condition of PF (μ): ∇ζP (ζ; μ)′(ζ −ζ) ≥ 0 for all ζ ∈ SLP, or each accumulation ζ̄ of the sequence {ζ} satisfies the minimum principle.”
- Mathematical Programming for Data Mining: Formulations and Challenges (1999, methodology): “Hence the Uncoupled Bilinear Programming Algorithm([10]) is applicable.”