23 search results - page 1 / 5 » Unconstrained Parametric Minimization of a Polynomial: Appro... |
81
Voted
ASCM
2007
Springer
15 years 5 months ago
2007
Springer
101
Voted
JMLR
2006
14 years 10 months ago
2006
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
91
Voted
MP
2002
14 years 10 months ago
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
90
Voted
TCS
2008
14 years 10 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
90
Voted
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...