Sciweavers

1210 search results - page 21 / 242
» Newton's method and its use in optimization
Sort
View
ALT
2004
Springer
14 years 4 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 7 months ago
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
Serge Gratton, Annick Sartenaer, Philippe L. Toint
SIGIR
2010
ACM
13 years 7 months ago
SED: supervised experimental design and its application to text classification
In recent years, active learning methods based on experimental design achieve state-of-the-art performance in text classification applications. Although these methods can exploit ...
Yi Zhen, Dit-Yan Yeung
QEST
2008
IEEE
14 years 1 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
PE
2010
Springer
212views Optimization» more  PE 2010»
13 years 2 months ago
Modeling TCP throughput: An elaborated large-deviations-based model and its empirical validation
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
Patrick Loiseau, Paulo Gonçalves, Julien Ba...