Sciweavers

64 search results - page 1 / 13
» Adaptive Overrelaxed Bound Optimization Methods
Sort
View
ICML
2003
IEEE
14 years 5 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis
SIAMJO
2002
107views more  SIAMJO 2002»
13 years 4 months ago
A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and T...
Robert Michael Lewis, Virginia Torczon
SIAMNUM
2010
150views more  SIAMNUM 2010»
12 years 11 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto
MOC
2000
76views more  MOC 2000»
13 years 4 months ago
Optimal approximation of stochastic differential equations by adaptive step-size control
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
Norbert Hofmann, Thomas Müller-Gronbach, Klau...
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
13 years 2 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak