Sciweavers

3049 search results - page 10 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICAL
2011
301views more  ICAL 2011»
12 years 7 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
ISSAC
2007
Springer
108views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...
Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shiray...
JMLR
2006
143views more  JMLR 2006»
13 years 7 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
ATAL
2007
Springer
14 years 1 months ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer