On solving a linear program with one quadratic constraint

By L. Martein, Siegfried Schaible. 1987

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Security analysis of online centroid anomaly detection (2010, methodology): “Alternatively, one can use specialized algorithms for linear programming with a single quadratic constraint (van de Panne, 1966; Martein and Schaible, 2005) or convert the quadratic constraint to a second-order cone (SOC) constraint and use general-purpose conic optimization methods.”
Tikhonov, Ivanov and Morozov regularization for support vector machine learning (2016, unknown): “(101) Algorithm 4Algorithm for solving I-SVM Problem (73) based on the results of Martein and Schaible (1987) and Anguita et al. (2010) Require: (z1, . . . , zn), K (·, ·), wMAX and the tolerance τ 1: {w, b, ξ} = solve LP problem of Eq.”