Sciweavers

2182 search results - page 104 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
NIPS
2003
13 years 9 months ago
Inferring State Sequences for Non-linear Systems with Embedded Hidden Markov Models
We describe a Markov chain method for sampling from the distribution of the hidden state sequence in a non-linear dynamical system, given a sequence of observations. This method u...
Radford M. Neal, Matthew J. Beal, Sam T. Roweis
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 7 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
SIGIR
2003
ACM
14 years 1 months ago
A maximal figure-of-merit learning approach to text categorization
A novel maximal figure-of-merit (MFoM) learning approach to text categorization is proposed. Different from the conventional techniques, the proposed MFoM method attempts to integ...
Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
ESOP
1999
Springer
14 years 2 days ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
ICCV
2005
IEEE
14 years 9 months ago
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
Manolis I. A. Lourakis, Antonis A. Argyros